./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:21:48,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:21:48,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:21:48,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:21:48,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:21:48,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:21:48,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:21:48,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:21:48,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:21:48,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:21:48,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:21:48,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:21:48,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:21:48,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:21:48,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:21:48,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:21:48,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:21:48,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:21:48,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:21:48,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:21:48,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:21:48,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:21:48,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:21:48,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:21:48,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:21:48,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:21:48,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:21:48,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:21:48,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:21:48,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:21:48,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:21:48,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:21:48,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:48,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:21:48,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:21:48,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:21:48,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:21:48,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:21:48,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:21:48,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:21:48,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:21:48,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:21:48,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 [2024-11-08 22:21:49,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:21:49,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:21:49,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:21:49,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:21:49,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:21:49,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:21:50,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:21:50,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:21:50,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:21:50,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dca3e90/5c9e1c792fa049b48f5b89ec4c8017ef/FLAG79adbbd9e [2024-11-08 22:21:50,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dca3e90/5c9e1c792fa049b48f5b89ec4c8017ef [2024-11-08 22:21:50,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:21:50,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:21:50,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:50,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:21:50,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:21:50,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:50" (1/1) ... [2024-11-08 22:21:50,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245edb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:50, skipping insertion in model container [2024-11-08 22:21:50,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:50" (1/1) ... [2024-11-08 22:21:50,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:21:51,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-08 22:21:51,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:51,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:21:51,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-08 22:21:51,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:51,195 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:21:51,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51 WrapperNode [2024-11-08 22:21:51,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:51,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:51,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:21:51,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:21:51,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,267 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-08 22:21:51,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:51,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:21:51,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:21:51,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:21:51,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,314 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:21:51,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:21:51,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:21:51,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:21:51,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:21:51,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:51,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:21:51,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:21:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:21:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:21:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:21:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:21:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:21:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:21:51,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:21:51,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:21:51,922 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:21:51,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:21:51,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:21:51,939 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:21:51,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:51 BoogieIcfgContainer [2024-11-08 22:21:51,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:21:51,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:21:51,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:21:51,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:21:51,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:21:50" (1/3) ... [2024-11-08 22:21:51,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a884ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:51, skipping insertion in model container [2024-11-08 22:21:51,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (2/3) ... [2024-11-08 22:21:51,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a884ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:51, skipping insertion in model container [2024-11-08 22:21:51,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:51" (3/3) ... [2024-11-08 22:21:51,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:21:51,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:21:51,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:21:52,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:21:52,050 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6210c61a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:21:52,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:21:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:21:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:21:52,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:52,069 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:52,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2007325841, now seen corresponding path program 1 times [2024-11-08 22:21:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390642914] [2024-11-08 22:21:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:21:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:21:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:21:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:21:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:21:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:21:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:21:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:21:52,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390642914] [2024-11-08 22:21:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390642914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:52,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:21:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540918223] [2024-11-08 22:21:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:52,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:21:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:21:52,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:21:52,615 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:21:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:52,656 INFO L93 Difference]: Finished difference Result 182 states and 321 transitions. [2024-11-08 22:21:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:21:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-11-08 22:21:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:52,668 INFO L225 Difference]: With dead ends: 182 [2024-11-08 22:21:52,668 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 22:21:52,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:21:52,678 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:52,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 22:21:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-08 22:21:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:21:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-11-08 22:21:52,733 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 197 [2024-11-08 22:21:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:52,733 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-11-08 22:21:52,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:21:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-11-08 22:21:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:21:52,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:52,738 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:52,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:21:52,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash 757584587, now seen corresponding path program 1 times [2024-11-08 22:21:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350817560] [2024-11-08 22:21:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:21:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:21:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:21:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:21:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:21:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:21:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:21:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:21:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350817560] [2024-11-08 22:21:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350817560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:21:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196391484] [2024-11-08 22:21:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:53,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:53,565 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:21:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:53,811 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-11-08 22:21:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:21:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-08 22:21:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:53,817 INFO L225 Difference]: With dead ends: 262 [2024-11-08 22:21:53,818 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 22:21:53,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:21:53,820 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:53,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 391 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:21:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 22:21:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2024-11-08 22:21:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:21:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 252 transitions. [2024-11-08 22:21:53,867 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 252 transitions. Word has length 197 [2024-11-08 22:21:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:53,868 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 252 transitions. [2024-11-08 22:21:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:21:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 252 transitions. [2024-11-08 22:21:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:21:53,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:53,871 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:21:53,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:53,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1015750025, now seen corresponding path program 1 times [2024-11-08 22:21:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327793348] [2024-11-08 22:21:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:21:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:21:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:21:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:21:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:21:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:21:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:21:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:21:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327793348] [2024-11-08 22:21:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327793348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172084579] [2024-11-08 22:21:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:54,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:21:54,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:21:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:21:54,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-08 22:21:54,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:21:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172084579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:21:54,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:21:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-08 22:21:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33938446] [2024-11-08 22:21:54,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:21:54,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:21:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:21:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:21:54,896 INFO L87 Difference]: Start difference. First operand 161 states and 252 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-08 22:21:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:55,345 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2024-11-08 22:21:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 22:21:55,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 197 [2024-11-08 22:21:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:55,348 INFO L225 Difference]: With dead ends: 271 [2024-11-08 22:21:55,348 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 22:21:55,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-08 22:21:55,354 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 169 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:55,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 226 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:21:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 22:21:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-08 22:21:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 108 states have internal predecessors, (136), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:21:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2024-11-08 22:21:55,397 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 260 transitions. Word has length 197 [2024-11-08 22:21:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:55,398 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 260 transitions. [2024-11-08 22:21:55,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-08 22:21:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2024-11-08 22:21:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:21:55,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:55,405 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:55,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:21:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:55,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1016435579, now seen corresponding path program 1 times [2024-11-08 22:21:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440675993] [2024-11-08 22:21:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:21:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:21:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:21:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:21:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:21:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:21:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:21:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:21:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440675993] [2024-11-08 22:21:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440675993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696305866] [2024-11-08 22:21:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:56,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:21:56,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:21:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:56,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:21:56,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-08 22:21:56,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:21:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696305866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:21:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:21:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 16 [2024-11-08 22:21:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130075565] [2024-11-08 22:21:57,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:21:57,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 22:21:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 22:21:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:21:57,266 INFO L87 Difference]: Start difference. First operand 177 states and 260 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-08 22:21:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:59,850 INFO L93 Difference]: Finished difference Result 895 states and 1299 transitions. [2024-11-08 22:21:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 22:21:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 197 [2024-11-08 22:21:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:59,858 INFO L225 Difference]: With dead ends: 895 [2024-11-08 22:21:59,858 INFO L226 Difference]: Without dead ends: 786 [2024-11-08 22:21:59,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 22:21:59,860 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 521 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:59,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1352 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 22:21:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-08 22:21:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 495. [2024-11-08 22:21:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 311 states have (on average 1.2090032154340835) internal successors, (376), 313 states have internal predecessors, (376), 160 states have call successors, (160), 23 states have call predecessors, (160), 23 states have return successors, (160), 158 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 22:21:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 696 transitions. [2024-11-08 22:21:59,942 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 696 transitions. Word has length 197 [2024-11-08 22:21:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:59,943 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 696 transitions. [2024-11-08 22:21:59,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-08 22:21:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 696 transitions. [2024-11-08 22:21:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:21:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:59,948 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:59,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 22:22:00,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 22:22:00,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1284387011, now seen corresponding path program 1 times [2024-11-08 22:22:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:22:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785831995] [2024-11-08 22:22:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:22:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:22:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:22:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:22:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:22:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:22:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:22:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:22:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:22:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:22:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:22:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:22:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:22:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:22:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:22:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:22:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:22:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:22:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:22:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:22:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:22:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:22:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:22:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:22:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:22:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:22:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:22:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:22:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:22:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:22:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:22:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:22:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:22:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:22:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785831995] [2024-11-08 22:22:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785831995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:22:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524971176] [2024-11-08 22:22:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:00,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:22:00,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:22:00,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:22:00,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 22:22:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:00,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 22:22:00,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1162 proven. 246 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-08 22:22:02,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:22:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-08 22:22:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524971176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:22:03,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:22:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 12] total 34 [2024-11-08 22:22:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541165086] [2024-11-08 22:22:03,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:22:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 22:22:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:22:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 22:22:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 22:22:03,229 INFO L87 Difference]: Start difference. First operand 495 states and 696 transitions. Second operand has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) [2024-11-08 22:22:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:07,608 INFO L93 Difference]: Finished difference Result 1704 states and 2267 transitions. [2024-11-08 22:22:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-11-08 22:22:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) Word has length 197 [2024-11-08 22:22:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:07,619 INFO L225 Difference]: With dead ends: 1704 [2024-11-08 22:22:07,619 INFO L226 Difference]: Without dead ends: 1298 [2024-11-08 22:22:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5032 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3251, Invalid=10791, Unknown=0, NotChecked=0, Total=14042 [2024-11-08 22:22:07,626 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1331 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 1054 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:07,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1038 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1054 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 22:22:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-08 22:22:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 809. [2024-11-08 22:22:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 527 states have (on average 1.1821631878557874) internal successors, (623), 535 states have internal predecessors, (623), 229 states have call successors, (229), 52 states have call predecessors, (229), 52 states have return successors, (229), 221 states have call predecessors, (229), 229 states have call successors, (229) [2024-11-08 22:22:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1081 transitions. [2024-11-08 22:22:07,781 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1081 transitions. Word has length 197 [2024-11-08 22:22:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:07,785 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1081 transitions. [2024-11-08 22:22:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.575757575757576) internal successors, (151), 31 states have internal predecessors, (151), 12 states have call successors, (93), 6 states have call predecessors, (93), 11 states have return successors, (93), 12 states have call predecessors, (93), 12 states have call successors, (93) [2024-11-08 22:22:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1081 transitions. [2024-11-08 22:22:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 22:22:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:07,788 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:07,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 22:22:07,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:22:07,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:07,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1286234053, now seen corresponding path program 1 times [2024-11-08 22:22:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:22:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891268820] [2024-11-08 22:22:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:22:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:22:08,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:22:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:22:08,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:22:08,211 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:22:08,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:22:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:22:08,217 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 22:22:08,363 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:22:08,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:08 BoogieIcfgContainer [2024-11-08 22:22:08,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:22:08,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:22:08,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:22:08,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:22:08,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:51" (3/4) ... [2024-11-08 22:22:08,370 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:22:08,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:22:08,372 INFO L158 Benchmark]: Toolchain (without parser) took 17581.83ms. Allocated memory was 167.8MB in the beginning and 406.8MB in the end (delta: 239.1MB). Free memory was 114.2MB in the beginning and 286.5MB in the end (delta: -172.3MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,372 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:22:08,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.85ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 97.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.42ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 93.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,374 INFO L158 Benchmark]: Boogie Preprocessor took 69.23ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 87.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,374 INFO L158 Benchmark]: RCFGBuilder took 601.35ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 61.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,374 INFO L158 Benchmark]: TraceAbstraction took 16424.01ms. Allocated memory was 167.8MB in the beginning and 406.8MB in the end (delta: 239.1MB). Free memory was 60.2MB in the beginning and 286.5MB in the end (delta: -226.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-08 22:22:08,374 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 406.8MB. Free memory is still 286.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:22:08,375 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.85ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 97.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.42ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 93.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.23ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 87.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 601.35ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 61.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16424.01ms. Allocated memory was 167.8MB in the beginning and 406.8MB in the end (delta: 239.1MB). Free memory was 60.2MB in the beginning and 286.5MB in the end (delta: -226.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 406.8MB. Free memory is still 286.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((var_1_23 <= var_1_20) || var_1_6) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L64] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L73] COND FALSE !(var_1_21 <= var_1_23) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L76] EXPR (~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L76] COND FALSE !(((~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_10) [L79] var_1_50 = var_1_29 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L80] COND FALSE !((~ var_1_20) > var_1_20) [L83] var_1_52 = ((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L85] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L86] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L89] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L90] COND TRUE \read(var_1_4) [L91] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L95] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L96] COND FALSE !(var_1_23 < var_1_23) [L107] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L109] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=4] [L110] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L117] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L119] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L122] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=127, var_1_12=-2, var_1_13=-40961, var_1_17=-79, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=15, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_29=3576445688, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445688, var_1_52=63, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 6, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2243 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2127 mSDsluCounter, 3144 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2429 mSDsCounter, 1574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4798 IncrementalHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1574 mSolverCounterUnsat, 715 mSDtfsCounter, 4798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1689 GetRequests, 1513 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5511 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=809occurred in iteration=5, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 799 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1773 NumberOfCodeBlocks, 1773 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2156 ConstructedInterpolants, 0 QuantifiedInterpolants, 9101 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 19773/20460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:22:08,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:22:10,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:22:10,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:22:10,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:22:10,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:22:10,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:22:10,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:22:10,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:22:10,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:22:10,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:22:10,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:22:10,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:22:10,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:22:10,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:22:10,845 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:22:10,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:22:10,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:22:10,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:22:10,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:22:10,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:22:10,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:22:10,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:22:10,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:22:10,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:22:10,848 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:22:10,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:22:10,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:22:10,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:22:10,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:22:10,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:22:10,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:22:10,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:22:10,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:22:10,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:22:10,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:22:10,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:22:10,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:22:10,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:22:10,854 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:22:10,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:22:10,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:22:10,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:22:10,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:22:10,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:22:10,855 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64943cc7b0c16bec6791eb98e547ec186ef36cc0d3d8ca148c8d164737a88411 [2024-11-08 22:22:11,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:22:11,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:22:11,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:22:11,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:22:11,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:22:11,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:22:12,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:22:12,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:22:12,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:22:12,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/058004a19/d54470e0885f467695702409668f306f/FLAGca2154f3c [2024-11-08 22:22:13,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/058004a19/d54470e0885f467695702409668f306f [2024-11-08 22:22:13,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:22:13,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:22:13,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:22:13,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:22:13,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:22:13,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@887329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13, skipping insertion in model container [2024-11-08 22:22:13,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:22:13,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-08 22:22:13,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:22:13,599 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:22:13,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i[919,932] [2024-11-08 22:22:13,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:22:13,688 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:22:13,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13 WrapperNode [2024-11-08 22:22:13,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:22:13,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:22:13,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:22:13,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:22:13,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,760 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-08 22:22:13,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:22:13,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:22:13,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:22:13,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:22:13,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,799 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:22:13,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:22:13,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:22:13,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:22:13,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:22:13,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (1/1) ... [2024-11-08 22:22:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:22:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:22:13,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:22:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:22:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:22:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:22:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:22:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:22:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:22:13,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:22:14,045 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:22:14,048 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:22:16,744 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:22:16,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:22:16,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:22:16,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:22:16,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16 BoogieIcfgContainer [2024-11-08 22:22:16,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:22:16,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:22:16,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:22:16,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:22:16,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:13" (1/3) ... [2024-11-08 22:22:16,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1399fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 22:22:16,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:13" (2/3) ... [2024-11-08 22:22:16,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1399fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 22:22:16,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16" (3/3) ... [2024-11-08 22:22:16,772 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-96.i [2024-11-08 22:22:16,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:22:16,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:22:16,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:22:16,880 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31d4c838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:22:16,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:22:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:22:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:16,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:16,912 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:16,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -151723237, now seen corresponding path program 1 times [2024-11-08 22:22:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35070281] [2024-11-08 22:22:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:16,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:16,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:16,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:22:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:17,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:22:17,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-08 22:22:17,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:22:17,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:22:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35070281] [2024-11-08 22:22:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35070281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:22:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:22:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:22:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715785838] [2024-11-08 22:22:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:22:17,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:22:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:22:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:22:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:22:17,470 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:22:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:17,511 INFO L93 Difference]: Finished difference Result 170 states and 301 transitions. [2024-11-08 22:22:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:22:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-08 22:22:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:17,524 INFO L225 Difference]: With dead ends: 170 [2024-11-08 22:22:17,525 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 22:22:17,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:22:17,534 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:17,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:22:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 22:22:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 22:22:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:22:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-11-08 22:22:17,591 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 196 [2024-11-08 22:22:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:17,591 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-11-08 22:22:17,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:22:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-11-08 22:22:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:17,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:17,597 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:17,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:22:17,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:17,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash -192037471, now seen corresponding path program 1 times [2024-11-08 22:22:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628701693] [2024-11-08 22:22:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:17,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:17,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:17,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:17,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:22:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:18,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:22:18,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 618 proven. 72 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2024-11-08 22:22:18,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:22:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:22:19,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:22:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628701693] [2024-11-08 22:22:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628701693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:22:19,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:22:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 22:22:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784044233] [2024-11-08 22:22:19,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:22:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:22:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:22:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:22:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:22:19,341 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 22:22:21,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:21,451 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2024-11-08 22:22:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:22:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 196 [2024-11-08 22:22:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:21,475 INFO L225 Difference]: With dead ends: 169 [2024-11-08 22:22:21,475 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 22:22:21,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:22:21,477 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 133 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:21,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 22:22:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 22:22:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-08 22:22:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:22:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-11-08 22:22:21,500 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 196 [2024-11-08 22:22:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:21,501 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-11-08 22:22:21,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 22:22:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-11-08 22:22:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:21,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:21,505 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:21,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:22:21,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:21,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:21,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:21,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1213105825, now seen corresponding path program 1 times [2024-11-08 22:22:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725086628] [2024-11-08 22:22:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:21,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:21,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:21,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:22:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:21,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:22:22,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-08 22:22:22,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:22:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:22:22,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:22:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725086628] [2024-11-08 22:22:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725086628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:22:22,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:22:22,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 22:22:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542265304] [2024-11-08 22:22:22,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:22:22,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:22:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:22:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:22:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:22:22,833 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-08 22:22:24,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:25,032 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2024-11-08 22:22:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:22:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 196 [2024-11-08 22:22:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:25,056 INFO L225 Difference]: With dead ends: 177 [2024-11-08 22:22:25,056 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 22:22:25,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:22:25,058 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:25,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 188 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 22:22:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 22:22:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-08 22:22:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:22:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-08 22:22:25,081 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 196 [2024-11-08 22:22:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:25,082 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-08 22:22:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-08 22:22:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-08 22:22:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:25,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:25,085 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:25,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:22:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:25,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2070744221, now seen corresponding path program 1 times [2024-11-08 22:22:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454541565] [2024-11-08 22:22:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:25,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:25,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:25,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:25,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:22:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:25,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:22:25,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:22:26,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:22:26,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:22:26,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454541565] [2024-11-08 22:22:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454541565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:22:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:22:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:22:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772731879] [2024-11-08 22:22:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:22:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:22:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:22:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:22:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:22:26,118 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:22:29,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:30,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:30,658 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-11-08 22:22:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:22:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-08 22:22:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:30,689 INFO L225 Difference]: With dead ends: 268 [2024-11-08 22:22:30,690 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 22:22:30,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:22:30,691 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:30,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 355 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 22:22:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 22:22:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2024-11-08 22:22:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:22:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 240 transitions. [2024-11-08 22:22:30,736 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 240 transitions. Word has length 196 [2024-11-08 22:22:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 240 transitions. [2024-11-08 22:22:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:22:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2024-11-08 22:22:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:30,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:30,741 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:30,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 22:22:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:30,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1966057637, now seen corresponding path program 1 times [2024-11-08 22:22:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989724558] [2024-11-08 22:22:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:30,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:30,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:30,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:30,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:22:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:31,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:22:31,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 944 proven. 66 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-08 22:22:32,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:22:32,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:22:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989724558] [2024-11-08 22:22:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989724558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:22:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1589849613] [2024-11-08 22:22:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:22:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:22:32,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:22:32,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-08 22:22:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:33,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:22:33,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:22:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-08 22:22:34,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:22:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1589849613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:22:34,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:22:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-08 22:22:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437049118] [2024-11-08 22:22:34,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:22:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:22:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:22:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:22:34,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-08 22:22:34,880 INFO L87 Difference]: Start difference. First operand 165 states and 240 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-08 22:22:38,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:40,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:22:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:22:40,873 INFO L93 Difference]: Finished difference Result 366 states and 517 transitions. [2024-11-08 22:22:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:22:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 196 [2024-11-08 22:22:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:22:40,876 INFO L225 Difference]: With dead ends: 366 [2024-11-08 22:22:40,877 INFO L226 Difference]: Without dead ends: 269 [2024-11-08 22:22:40,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2024-11-08 22:22:40,879 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 22:22:40,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 467 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 22:22:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-08 22:22:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2024-11-08 22:22:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 156 states have (on average 1.1474358974358974) internal successors, (179), 156 states have internal predecessors, (179), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:22:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 365 transitions. [2024-11-08 22:22:40,913 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 365 transitions. Word has length 196 [2024-11-08 22:22:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:22:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 365 transitions. [2024-11-08 22:22:40,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-08 22:22:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 365 transitions. [2024-11-08 22:22:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 22:22:40,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:22:40,916 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:22:40,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-08 22:22:41,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 22:22:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:41,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:22:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:22:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 740561757, now seen corresponding path program 1 times [2024-11-08 22:22:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:22:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62175934] [2024-11-08 22:22:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:22:41,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:22:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:22:41,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:22:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 22:22:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:22:41,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 22:22:41,612 INFO L278 TraceCheckSpWp]: Computing forward predicates...