./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.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_variablewrapping_normal_file-92.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:25:59,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:25:59,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:25:59,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:25:59,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:25:59,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:25:59,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:25:59,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:25:59,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:25:59,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:25:59,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:25:59,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:25:59,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:25:59,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:25:59,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:25:59,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:25:59,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:25:59,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:25:59,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:25:59,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:25:59,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:25:59,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:25:59,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:25:59,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:25:59,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:25:59,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:25:59,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:25:59,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:25:59,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:25:59,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:25:59,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:25:59,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:25:59,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:25:59,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:25:59,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:25:59,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:25:59,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:25:59,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:25:59,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:25:59,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:25:59,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:25:59,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:25:59,258 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 -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 [2024-11-09 01:25:59,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:25:59,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:25:59,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:25:59,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:25:59,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:25:59,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:01,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:01,285 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:01,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:01,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941a3b74b/c740afcd556646f684d04e22573b5eca/FLAGf62e2129e [2024-11-09 01:26:01,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941a3b74b/c740afcd556646f684d04e22573b5eca [2024-11-09 01:26:01,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:01,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:01,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:01,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:01,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:01,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3d4888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01, skipping insertion in model container [2024-11-09 01:26:01,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:01,534 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_variablewrapping_normal_file-92.i[913,926] [2024-11-09 01:26:01,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:01,615 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:01,628 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_variablewrapping_normal_file-92.i[913,926] [2024-11-09 01:26:01,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:01,680 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:01,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01 WrapperNode [2024-11-09 01:26:01,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:01,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:01,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:01,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:01,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,733 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-09 01:26:01,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:01,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:01,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:01,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:01,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,776 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-09 01:26:01,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:01,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:01,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:01,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:01,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (1/1) ... [2024-11-09 01:26:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:01,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:01,848 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-09 01:26:01,851 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-09 01:26:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:01,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:26:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:01,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:01,994 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:01,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:02,323 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:02,324 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:02,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:02,337 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:02,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:02 BoogieIcfgContainer [2024-11-09 01:26:02,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:02,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:02,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:02,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:02,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:01" (1/3) ... [2024-11-09 01:26:02,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eadc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:02, skipping insertion in model container [2024-11-09 01:26:02,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:01" (2/3) ... [2024-11-09 01:26:02,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eadc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:02, skipping insertion in model container [2024-11-09 01:26:02,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:02" (3/3) ... [2024-11-09 01:26:02,346 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:02,361 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:02,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:02,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:02,432 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;@28fbb249, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:02,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:26:02,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:02,453 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:02,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 72896585, now seen corresponding path program 1 times [2024-11-09 01:26:02,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237982041] [2024-11-09 01:26:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:02,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:26:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:26:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:26:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:26:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:26:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:26:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237982041] [2024-11-09 01:26:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237982041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:02,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394107354] [2024-11-09 01:26:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:02,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:02,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:02,965 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:26:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:02,997 INFO L93 Difference]: Finished difference Result 119 states and 197 transitions. [2024-11-09 01:26:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-09 01:26:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:03,010 INFO L225 Difference]: With dead ends: 119 [2024-11-09 01:26:03,012 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 01:26:03,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-09 01:26:03,021 INFO L432 NwaCegarLoop]: 85 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, 85 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-09 01:26:03,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 01:26:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 01:26:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-11-09 01:26:03,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 123 [2024-11-09 01:26:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:03,089 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-11-09 01:26:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:26:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-11-09 01:26:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:26:03,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:03,096 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:26:03,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:03,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash 525457999, now seen corresponding path program 1 times [2024-11-09 01:26:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317150914] [2024-11-09 01:26:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:26:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:26:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:26:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:26:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:26:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:26:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317150914] [2024-11-09 01:26:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317150914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:26:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824034430] [2024-11-09 01:26:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:26:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:03,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:26:03,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:26:03,712 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:26:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:03,924 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2024-11-09 01:26:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:26:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-09 01:26:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:03,927 INFO L225 Difference]: With dead ends: 117 [2024-11-09 01:26:03,928 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:26:03,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:26:03,930 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:03,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:26:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:26:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-11-09 01:26:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-11-09 01:26:03,948 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 123 [2024-11-09 01:26:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:03,952 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-11-09 01:26:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:26:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-11-09 01:26:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:26:03,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:03,954 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:03,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:26:03,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1619810410, now seen corresponding path program 1 times [2024-11-09 01:26:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:03,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431557495] [2024-11-09 01:26:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:26:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:26:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:26:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:26:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:26:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 01:26:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431557495] [2024-11-09 01:26:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431557495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616289169] [2024-11-09 01:26:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:04,559 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-09 01:26:04,561 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-09 01:26:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:04,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:26:04,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-09 01:26:04,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 01:26:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616289169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:05,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:26:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 01:26:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90140193] [2024-11-09 01:26:05,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:05,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:26:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:05,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:26:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:26:05,085 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 01:26:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:05,737 INFO L93 Difference]: Finished difference Result 249 states and 345 transitions. [2024-11-09 01:26:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 01:26:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2024-11-09 01:26:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:05,747 INFO L225 Difference]: With dead ends: 249 [2024-11-09 01:26:05,747 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 01:26:05,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:26:05,749 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 266 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:05,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 379 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:26:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 01:26:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 65. [2024-11-09 01:26:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-09 01:26:05,773 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 125 [2024-11-09 01:26:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:05,774 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-09 01:26:05,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 01:26:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-09 01:26:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:26:05,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:05,780 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:05,802 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-09 01:26:05,980 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-09 01:26:05,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1995098516, now seen corresponding path program 1 times [2024-11-09 01:26:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:05,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101234211] [2024-11-09 01:26:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:26:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088147612] [2024-11-09 01:26:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:06,087 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-09 01:26:06,090 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-09 01:26:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:06,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:26:06,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-09 01:26:06,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101234211] [2024-11-09 01:26:06,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:26:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088147612] [2024-11-09 01:26:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088147612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:06,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:26:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-09 01:26:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544724637] [2024-11-09 01:26:06,923 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:06,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:26:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:26:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=98, Unknown=2, NotChecked=0, Total=132 [2024-11-09 01:26:06,928 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:26:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:07,329 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2024-11-09 01:26:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:26:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 125 [2024-11-09 01:26:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:07,331 INFO L225 Difference]: With dead ends: 139 [2024-11-09 01:26:07,333 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 01:26:07,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=193, Unknown=2, NotChecked=0, Total=272 [2024-11-09 01:26:07,335 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 22 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:07,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 251 Invalid, 7 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:26:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 01:26:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-09 01:26:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-09 01:26:07,355 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 125 [2024-11-09 01:26:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-09 01:26:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:26:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-09 01:26:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:26:07,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:07,361 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:07,383 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-09 01:26:07,561 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-09 01:26:07,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:07,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1974092308, now seen corresponding path program 1 times [2024-11-09 01:26:07,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:07,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084481429] [2024-11-09 01:26:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:07,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:26:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8811296] [2024-11-09 01:26:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:07,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:07,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:07,623 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-09 01:26:07,625 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-09 01:26:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:07,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:26:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:07,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:26:07,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:26:07,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:26:07,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:08,049 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-09 01:26:08,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 01:26:08,139 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:26:08,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:26:08 BoogieIcfgContainer [2024-11-09 01:26:08,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:26:08,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:26:08,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:26:08,144 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:26:08,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:02" (3/4) ... [2024-11-09 01:26:08,149 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:26:08,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:26:08,152 INFO L158 Benchmark]: Toolchain (without parser) took 6841.15ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 103.4MB in the beginning and 89.1MB in the end (delta: 14.2MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,152 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:08,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.86ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 89.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 161.5MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,153 INFO L158 Benchmark]: Boogie Preprocessor took 55.53ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 83.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,153 INFO L158 Benchmark]: RCFGBuilder took 540.96ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 83.3MB in the beginning and 187.2MB in the end (delta: -103.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,154 INFO L158 Benchmark]: TraceAbstraction took 5802.75ms. Allocated memory is still 218.1MB. Free memory was 185.5MB in the beginning and 89.1MB in the end (delta: 96.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-09 01:26:08,154 INFO L158 Benchmark]: Witness Printer took 7.64ms. Allocated memory is still 218.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:08,156 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.21ms. Allocated memory is still 161.5MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.86ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 89.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 161.5MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.53ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 83.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 540.96ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 83.3MB in the beginning and 187.2MB in the end (delta: -103.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5802.75ms. Allocated memory is still 218.1MB. Free memory was 185.5MB in the beginning and 89.1MB in the end (delta: 96.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 7.64ms. Allocated memory is still 218.1MB. Free memory is still 89.1MB. 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 94, overapproximation of someBinaryFLOATComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] double var_1_9 = 15.5; [L31] signed short int var_1_10 = 500; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_13 = 0; [L34] unsigned short int var_1_14 = 100; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 0; [L37] float var_1_17 = 2.4; VAL [isInitial=0, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L64] var_1_3 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L67] var_1_4 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L70] var_1_5 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L73] var_1_6 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L76] var_1_8 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L77] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L78] var_1_9 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L80] var_1_14 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L82] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L82] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L83] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L83] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L84] var_1_15 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L86] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L86] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L89] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L89] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L42] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L42] signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3); [L43] COND TRUE stepLocal_0 >= var_1_4 [L44] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L48] var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L49] signed long int stepLocal_1 = var_1_6 / var_1_14; VAL [isInitial=1, stepLocal_1=0, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L50] COND FALSE !(stepLocal_1 < -100) [L53] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L55] var_1_17 = var_1_8 VAL [isInitial=1, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L56] COND TRUE ! var_1_13 [L57] var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94-L95] return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 812 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 301 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 136 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 740 ConstructedInterpolants, 1 QuantifiedInterpolants, 2224 SizeOfPredicates, 4 NumberOfNonLiveVariables, 571 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4047/4104 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-09 01:26:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_variablewrapping_normal_file-92.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:26:10,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:10,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:26:10,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:10,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:10,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:10,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:10,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:10,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:26:10,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:26:10,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:10,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:10,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:26:10,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:26:10,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:26:10,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:10,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:10,633 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:10,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:10,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:10,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:10,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:10,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:10,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:26:10,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:26:10,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:10,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:26:10,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:10,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:10,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:10,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:10,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:10,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:10,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:10,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:10,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:10,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:10,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:10,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:26:10,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:10,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:10,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:26:10,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:26:10,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:10,643 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 -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 [2024-11-09 01:26:10,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:11,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:11,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:11,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:11,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:11,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:12,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:12,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:12,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:12,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3832526d/b80e1d488666488ab4d5ab6ec75b0785/FLAGb6bd9aef1 [2024-11-09 01:26:13,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3832526d/b80e1d488666488ab4d5ab6ec75b0785 [2024-11-09 01:26:13,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:13,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:13,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:13,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:13,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:13,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216a6653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13, skipping insertion in model container [2024-11-09 01:26:13,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:13,466 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_variablewrapping_normal_file-92.i[913,926] [2024-11-09 01:26:13,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:13,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:13,565 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_variablewrapping_normal_file-92.i[913,926] [2024-11-09 01:26:13,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:13,640 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:13,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13 WrapperNode [2024-11-09 01:26:13,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:13,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:13,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:13,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:13,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,700 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-09 01:26:13,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:13,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:13,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:13,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:13,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,738 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-09 01:26:13,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:13,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:13,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:13,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:13,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (1/1) ... [2024-11-09 01:26:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:13,806 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-09 01:26:13,810 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-09 01:26:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:26:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:13,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:13,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:13,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:14,607 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:14,608 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:14,631 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:14,634 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:14,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:14 BoogieIcfgContainer [2024-11-09 01:26:14,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:14,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:14,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:14,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:14,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:13" (1/3) ... [2024-11-09 01:26:14,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44491a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:14, skipping insertion in model container [2024-11-09 01:26:14,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:13" (2/3) ... [2024-11-09 01:26:14,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44491a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:14, skipping insertion in model container [2024-11-09 01:26:14,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:14" (3/3) ... [2024-11-09 01:26:14,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i [2024-11-09 01:26:14,674 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:14,675 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:14,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:14,751 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;@7361641f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:14,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:26:14,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:14,772 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:14,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:14,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -769796365, now seen corresponding path program 1 times [2024-11-09 01:26:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220540108] [2024-11-09 01:26:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:14,797 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-09 01:26:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:14,801 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-09 01:26:14,802 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-09 01:26:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:15,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:26:15,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-09 01:26:15,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:15,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:26:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220540108] [2024-11-09 01:26:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220540108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:15,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745864977] [2024-11-09 01:26:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:15,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:26:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:15,179 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:26:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:15,212 INFO L93 Difference]: Finished difference Result 99 states and 167 transitions. [2024-11-09 01:26:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-11-09 01:26:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:15,222 INFO L225 Difference]: With dead ends: 99 [2024-11-09 01:26:15,222 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 01:26:15,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-09 01:26:15,233 INFO L432 NwaCegarLoop]: 70 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, 70 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-09 01:26:15,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 01:26:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 01:26:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-09 01:26:15,300 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 119 [2024-11-09 01:26:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:15,301 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-09 01:26:15,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:26:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-09 01:26:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:26:15,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:15,307 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:15,317 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:15,508 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-09 01:26:15,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:15,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1489589241, now seen corresponding path program 1 times [2024-11-09 01:26:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275777132] [2024-11-09 01:26:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:15,511 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-09 01:26:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:15,516 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-09 01:26:15,518 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-09 01:26:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:15,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:26:15,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-09 01:26:16,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:17,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:26:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275777132] [2024-11-09 01:26:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275777132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1074389910] [2024-11-09 01:26:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:17,483 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:26:17,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:26:17,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 01:26:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:26:18,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-09 01:26:18,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1074389910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:18,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:26:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-09 01:26:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261236170] [2024-11-09 01:26:18,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:18,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:26:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:26:18,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:26:18,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:26:18,798 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:26:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:20,528 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2024-11-09 01:26:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:26:20,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 119 [2024-11-09 01:26:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:20,543 INFO L225 Difference]: With dead ends: 107 [2024-11-09 01:26:20,543 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:26:20,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:26:20,548 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:20,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 140 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 01:26:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:26:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-09 01:26:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-09 01:26:20,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 119 [2024-11-09 01:26:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:20,564 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-09 01:26:20,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:26:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-09 01:26:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:26:20,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:20,566 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:20,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 01:26:20,775 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-09 01:26:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 01:26:20,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1030370693, now seen corresponding path program 1 times [2024-11-09 01:26:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:20,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100270790] [2024-11-09 01:26:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:20,970 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-09 01:26:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:20,977 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-09 01:26:20,982 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-09 01:26:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:21,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:26:21,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-09 01:26:21,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 01:26:21,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:26:21,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100270790] [2024-11-09 01:26:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100270790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:21,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:26:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-09 01:26:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657707193] [2024-11-09 01:26:21,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:21,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:26:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:26:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:26:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:26:21,604 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 01:26:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:22,226 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2024-11-09 01:26:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:26:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 119 [2024-11-09 01:26:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:22,239 INFO L225 Difference]: With dead ends: 121 [2024-11-09 01:26:22,239 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 01:26:22,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:26:22,241 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 99 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:22,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 95 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:26:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 01:26:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-09 01:26:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:26:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-09 01:26:22,259 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 119 [2024-11-09 01:26:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:22,260 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-09 01:26:22,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 01:26:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-09 01:26:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:26:22,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:22,264 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:26:22,275 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-09 01:26:22,465 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-09 01:26:22,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1032217735, now seen corresponding path program 1 times [2024-11-09 01:26:22,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:22,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635608268] [2024-11-09 01:26:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:22,467 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-09 01:26:22,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:22,470 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-09 01:26:22,471 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-09 01:26:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 01:26:22,729 INFO L278 TraceCheckSpWp]: Computing forward predicates...