./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.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 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:13:00,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:13:00,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:13:00,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:13:00,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:13:00,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:13:00,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:13:00,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:13:00,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:13:00,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:13:00,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:13:00,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:13:00,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:13:00,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:13:00,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:13:00,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:13:00,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:13:00,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:13:00,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:13:00,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:13:00,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:13:00,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:13:00,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:13:00,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:13:00,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:13:00,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:13:00,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:13:00,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:13:00,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:13:00,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:13:00,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:13:00,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:13:00,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:13:00,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:13:00,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:13:00,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:13:00,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:13:00,264 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 -> 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 [2024-11-20 02:13:00,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:13:00,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:13:00,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:13:00,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:13:00,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:13:00,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:01,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:13:01,794 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:13:01,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:01,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a50f586/1655774b202d4b6fa3f8472550d3a940/FLAGd97ad1118 [2024-11-20 02:13:01,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a50f586/1655774b202d4b6fa3f8472550d3a940 [2024-11-20 02:13:01,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:13:01,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:13:01,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:13:01,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:13:01,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:13:01,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:13:01" (1/1) ... [2024-11-20 02:13:01,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301ebae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:01, skipping insertion in model container [2024-11-20 02:13:01,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:13:01" (1/1) ... [2024-11-20 02:13:01,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:13:02,018 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_codestructure_dependencies_file-22.i[919,932] [2024-11-20 02:13:02,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:13:02,090 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:13:02,098 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_codestructure_dependencies_file-22.i[919,932] [2024-11-20 02:13:02,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:13:02,134 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:13:02,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02 WrapperNode [2024-11-20 02:13:02,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:13:02,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:13:02,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:13:02,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:13:02,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,186 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-20 02:13:02,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:13:02,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:13:02,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:13:02,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:13:02,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,220 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-20 02:13:02,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:13:02,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:13:02,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:13:02,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:13:02,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (1/1) ... [2024-11-20 02:13:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:13:02,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:13:02,269 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-20 02:13:02,278 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-20 02:13:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:13:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:13:02,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:13:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:13:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:13:02,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:13:02,370 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:13:02,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:13:02,616 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 02:13:02,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:13:02,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:13:02,632 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:13:02,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:13:02 BoogieIcfgContainer [2024-11-20 02:13:02,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:13:02,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:13:02,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:13:02,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:13:02,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:13:01" (1/3) ... [2024-11-20 02:13:02,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d716ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:13:02, skipping insertion in model container [2024-11-20 02:13:02,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:02" (2/3) ... [2024-11-20 02:13:02,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d716ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:13:02, skipping insertion in model container [2024-11-20 02:13:02,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:13:02" (3/3) ... [2024-11-20 02:13:02,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:02,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:13:02,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:13:02,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:13:02,704 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;@64f4cc82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:13:02,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:13:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:13:02,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:02,717 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:02,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:02,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2097864758, now seen corresponding path program 1 times [2024-11-20 02:13:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:13:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370619351] [2024-11-20 02:13:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:13:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:13:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:13:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:13:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:13:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:13:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:13:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:13:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:13:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:13:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:13:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:13:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:13:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:13:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:13:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:13:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:13:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:13:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:13:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:13:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:13:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:13:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 02:13:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:13:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 02:13:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:13:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370619351] [2024-11-20 02:13:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370619351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:13:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:13:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:13:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365576864] [2024-11-20 02:13:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:13:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:13:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:13:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:13:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:13:03,060 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:13:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:03,106 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2024-11-20 02:13:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:13:03,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-20 02:13:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:03,114 INFO L225 Difference]: With dead ends: 133 [2024-11-20 02:13:03,115 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 02:13:03,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-20 02:13:03,132 INFO L432 NwaCegarLoop]: 98 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, 98 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-20 02:13:03,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:13:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 02:13:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-20 02:13:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-20 02:13:03,175 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 148 [2024-11-20 02:13:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:03,176 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-20 02:13:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:13:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-20 02:13:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:13:03,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:03,178 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:03,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:13:03,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:03,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931792, now seen corresponding path program 1 times [2024-11-20 02:13:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:13:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993470672] [2024-11-20 02:13:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:03,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:13:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:13:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:13:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:13:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:13:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:13:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:13:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:13:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:13:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:13:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:13:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:13:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:13:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:13:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:13:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:13:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:13:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:13:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:13:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:13:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:13:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:13:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 02:13:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:13:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 02:13:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:13:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993470672] [2024-11-20 02:13:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993470672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:13:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:13:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:13:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991005449] [2024-11-20 02:13:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:13:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:13:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:13:03,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:13:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:13:03,619 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 02:13:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:03,744 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2024-11-20 02:13:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:13:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-20 02:13:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:03,747 INFO L225 Difference]: With dead ends: 129 [2024-11-20 02:13:03,747 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 02:13:03,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:13:03,750 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:13:03,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 94 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:13:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 02:13:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-20 02:13:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-20 02:13:03,768 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 148 [2024-11-20 02:13:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:03,769 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-20 02:13:03,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 02:13:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-20 02:13:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:13:03,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:03,772 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:03,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:13:03,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash 903171826, now seen corresponding path program 1 times [2024-11-20 02:13:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:13:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063184583] [2024-11-20 02:13:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:13:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:13:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:13:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:13:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:13:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:13:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:13:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:13:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:13:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:13:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:13:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:13:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:13:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:13:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:13:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:13:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:13:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:13:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:13:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:13:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:13:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:13:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 02:13:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:13:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 02:13:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:13:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063184583] [2024-11-20 02:13:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063184583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:13:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238463434] [2024-11-20 02:13:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:13:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:13:04,514 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-20 02:13:04,515 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-20 02:13:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:04,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 02:13:04,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 651 proven. 66 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-20 02:13:05,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:13:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 60 proven. 69 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-20 02:13:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238463434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:13:05,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:13:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-11-20 02:13:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025836475] [2024-11-20 02:13:05,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:13:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 02:13:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:13:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 02:13:05,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-20 02:13:05,400 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-20 02:13:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:06,369 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2024-11-20 02:13:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-20 02:13:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) Word has length 148 [2024-11-20 02:13:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:06,371 INFO L225 Difference]: With dead ends: 240 [2024-11-20 02:13:06,372 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 02:13:06,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=526, Invalid=1454, Unknown=0, NotChecked=0, Total=1980 [2024-11-20 02:13:06,373 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 567 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:13:06,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 332 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:13:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 02:13:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2024-11-20 02:13:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 02:13:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2024-11-20 02:13:06,395 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 148 [2024-11-20 02:13:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2024-11-20 02:13:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-20 02:13:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2024-11-20 02:13:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:13:06,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:06,403 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:06,415 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-20 02:13:06,604 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-20 02:13:06,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1583230196, now seen corresponding path program 1 times [2024-11-20 02:13:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:13:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153323325] [2024-11-20 02:13:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:06,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:13:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:13:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:13:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:13:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:13:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:13:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:13:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:13:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:13:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:13:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:13:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:13:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:13:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:13:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:13:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:13:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:13:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:13:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:13:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:13:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:13:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:13:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 02:13:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:13:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 02:13:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:13:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153323325] [2024-11-20 02:13:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153323325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:13:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506254629] [2024-11-20 02:13:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:06,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:13:06,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:13:06,987 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-20 02:13:06,989 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-20 02:13:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:07,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 02:13:07,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-20 02:13:07,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:13:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 105 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-20 02:13:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506254629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:13:08,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:13:08,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 22 [2024-11-20 02:13:08,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009876908] [2024-11-20 02:13:08,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:13:08,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 02:13:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:13:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 02:13:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-11-20 02:13:08,072 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2024-11-20 02:13:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:09,217 INFO L93 Difference]: Finished difference Result 340 states and 456 transitions. [2024-11-20 02:13:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 02:13:09,218 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) Word has length 148 [2024-11-20 02:13:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:09,220 INFO L225 Difference]: With dead ends: 340 [2024-11-20 02:13:09,220 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 02:13:09,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=1884, Unknown=0, NotChecked=0, Total=2550 [2024-11-20 02:13:09,222 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 477 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:13:09,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 594 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:13:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 02:13:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 208. [2024-11-20 02:13:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 125 states have (on average 1.136) internal successors, (142), 126 states have internal predecessors, (142), 69 states have call successors, (69), 13 states have call predecessors, (69), 13 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-20 02:13:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2024-11-20 02:13:09,253 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 148 [2024-11-20 02:13:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:09,253 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2024-11-20 02:13:09,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2024-11-20 02:13:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2024-11-20 02:13:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:13:09,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:09,256 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:09,268 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-20 02:13:09,457 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-20 02:13:09,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:09,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1190203186, now seen corresponding path program 1 times [2024-11-20 02:13:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:13:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234865084] [2024-11-20 02:13:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:13:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:13:09,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:13:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:13:09,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:13:09,565 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:13:09,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:13:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:13:09,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 02:13:09,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:13:09,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:13:09 BoogieIcfgContainer [2024-11-20 02:13:09,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:13:09,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:13:09,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:13:09,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:13:09,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:13:02" (3/4) ... [2024-11-20 02:13:09,645 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:13:09,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:13:09,647 INFO L158 Benchmark]: Toolchain (without parser) took 7832.45ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 68.4MB in the beginning and 97.9MB in the end (delta: -29.5MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,647 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:13:09,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.13ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 68.2MB in the beginning and 171.1MB in the end (delta: -102.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.29ms. Allocated memory is still 205.5MB. Free memory was 171.1MB in the beginning and 166.0MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,648 INFO L158 Benchmark]: Boogie Preprocessor took 48.72ms. Allocated memory is still 205.5MB. Free memory was 166.0MB in the beginning and 158.8MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,648 INFO L158 Benchmark]: RCFGBuilder took 396.75ms. Allocated memory is still 205.5MB. Free memory was 158.8MB in the beginning and 135.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,648 INFO L158 Benchmark]: TraceAbstraction took 7006.52ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 135.6MB in the beginning and 97.9MB in the end (delta: 37.7MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. [2024-11-20 02:13:09,648 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 297.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:13:09,649 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.14ms. Allocated memory is still 138.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.13ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 68.2MB in the beginning and 171.1MB in the end (delta: -102.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.29ms. Allocated memory is still 205.5MB. Free memory was 171.1MB in the beginning and 166.0MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.72ms. Allocated memory is still 205.5MB. Free memory was 166.0MB in the beginning and 158.8MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 396.75ms. Allocated memory is still 205.5MB. Free memory was 158.8MB in the beginning and 135.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7006.52ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 135.6MB in the beginning and 97.9MB in the end (delta: 37.7MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 297.8MB. Free memory is still 97.9MB. 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 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int var_1_4 = 256; [L24] unsigned short int var_1_6 = 10000; [L25] unsigned short int var_1_7 = 10000; [L26] unsigned short int var_1_8 = 128; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_11 = 64; [L30] unsigned char var_1_12 = 16; [L31] unsigned short int var_1_13 = 256; [L32] unsigned short int var_1_17 = 4; [L33] double var_1_18 = 64.2; [L34] unsigned short int var_1_19 = 53045; [L35] double var_1_20 = 1.75; [L36] double var_1_21 = 50.35; [L37] double var_1_22 = 5.5; [L38] double var_1_23 = 7.125; [L39] unsigned long int var_1_24 = 50; [L40] unsigned long int var_1_25 = 1907531378; [L41] unsigned long int var_1_26 = 8; [L42] unsigned char var_1_27 = 0; [L43] unsigned long int last_1_var_1_24 = 50; [L44] unsigned char last_1_var_1_27 = 0; VAL [isInitial=0, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L122] last_1_var_1_24 = var_1_24 [L123] last_1_var_1_27 = var_1_27 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L133] RET updateLastVariables() [L134] CALL updateVariables() [L84] var_1_4 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L85] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L86] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L86] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L87] var_1_6 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_6 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L88] RET assume_abort_if_not(var_1_6 >= 8191) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] CALL assume_abort_if_not(var_1_6 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] RET assume_abort_if_not(var_1_6 <= 16384) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L90] var_1_7 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_7 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L91] RET assume_abort_if_not(var_1_7 >= 8192) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L92] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L92] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L93] var_1_8 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L95] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L95] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L96] var_1_9 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L97] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L99] var_1_11 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L102] var_1_12 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L105] var_1_18 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L106] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L108] var_1_19 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_19 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_19 >= 49150) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L111] var_1_21 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L113] var_1_22 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L115] var_1_23 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L117] var_1_25 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L134] RET updateVariables() [L135] CALL step() [L48] COND FALSE !(\read(last_1_var_1_27)) [L51] var_1_20 = var_1_22 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L53] COND TRUE (- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22))) [L54] var_1_27 = 0 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L56] EXPR var_1_8 << var_1_4 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L56] COND TRUE var_1_9 < (var_1_8 << var_1_4) [L57] var_1_10 = (var_1_11 + var_1_12) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L61] COND TRUE (var_1_10 <= var_1_10) || var_1_27 [L62] var_1_13 = ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L66] COND FALSE !(var_1_7 == last_1_var_1_24) [L69] var_1_24 = (var_1_10 + (var_1_25 - var_1_11)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L71] COND FALSE !(var_1_10 > (var_1_19 - var_1_7)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L74] COND TRUE var_1_20 < var_1_20 [L75] var_1_1 = ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L79] COND TRUE (var_1_20 / var_1_18) > var_1_20 [L80] var_1_17 = ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR ((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L126-L127] return ((((((((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11)))) && (((var_1_10 <= var_1_10) || var_1_27) ? (var_1_13 == ((unsigned short int) ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))))) : (var_1_13 == ((unsigned short int) var_1_10)))) && (((var_1_20 / var_1_18) > var_1_20) ? (var_1_17 == ((unsigned short int) ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7))) : 1)) && (last_1_var_1_27 ? (var_1_20 == ((double) (((((((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) > (16.6)) ? (((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) : (16.6))) - var_1_23))) : (var_1_20 == ((double) var_1_22)))) && ((var_1_7 == last_1_var_1_24) ? (var_1_24 == ((unsigned long int) (2332545940u - (1490203111u - var_1_11)))) : (var_1_24 == ((unsigned long int) (var_1_10 + (var_1_25 - var_1_11)))))) && ((var_1_10 > (var_1_19 - var_1_7)) ? (var_1_26 == ((unsigned long int) var_1_10)) : 1)) && (((- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22)))) ? (var_1_27 == ((unsigned char) 0)) : 1) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1133 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 788 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1265 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 330 mSDtfsCounter, 1265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 77, 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, 111 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 6091 SizeOfPredicates, 7 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 7682/8096 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-20 02:13:09,673 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.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 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:13:11,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:13:11,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:13:11,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:13:11,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:13:11,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:13:11,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:13:11,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:13:11,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:13:11,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:13:11,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:13:11,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:13:11,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:13:11,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:13:11,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:13:11,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:13:11,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:13:11,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:13:11,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:13:11,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:13:11,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:13:11,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:13:11,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:13:11,530 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:13:11,530 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:13:11,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:13:11,531 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:13:11,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:13:11,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:13:11,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:13:11,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:13:11,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:13:11,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:13:11,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:13:11,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:13:11,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:13:11,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:13:11,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:13:11,533 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:13:11,533 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:13:11,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:13:11,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:13:11,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:13:11,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:13:11,535 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 -> 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 [2024-11-20 02:13:11,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:13:11,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:13:11,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:13:11,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:13:11,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:13:11,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:13,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:13:13,213 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:13:13,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:13,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b08bffb/4682c5b1c09247269f58c625754d90ae/FLAG2a16a851f [2024-11-20 02:13:13,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b08bffb/4682c5b1c09247269f58c625754d90ae [2024-11-20 02:13:13,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:13:13,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:13:13,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:13:13,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:13:13,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:13:13,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3453b7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13, skipping insertion in model container [2024-11-20 02:13:13,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:13:13,760 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_codestructure_dependencies_file-22.i[919,932] [2024-11-20 02:13:13,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:13:13,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:13:13,840 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_codestructure_dependencies_file-22.i[919,932] [2024-11-20 02:13:13,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:13:13,892 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:13:13,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13 WrapperNode [2024-11-20 02:13:13,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:13:13,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:13:13,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:13:13,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:13:13,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,940 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-20 02:13:13,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:13:13,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:13:13,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:13:13,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:13:13,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,965 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-20 02:13:13,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:13,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:13:13,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:13:13,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:13:13,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:13:13,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (1/1) ... [2024-11-20 02:13:14,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:13:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:13:14,026 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-20 02:13:14,029 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-20 02:13:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:13:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:13:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:13:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:13:14,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:13:14,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:13:26,052 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:13:26,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:13:26,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:13:26,066 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:13:26,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:13:26 BoogieIcfgContainer [2024-11-20 02:13:26,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:13:26,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:13:26,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:13:26,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:13:26,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:13:13" (1/3) ... [2024-11-20 02:13:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbf0ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:13:26, skipping insertion in model container [2024-11-20 02:13:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:13:13" (2/3) ... [2024-11-20 02:13:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbf0ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:13:26, skipping insertion in model container [2024-11-20 02:13:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:13:26" (3/3) ... [2024-11-20 02:13:26,074 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-22.i [2024-11-20 02:13:26,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:13:26,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:13:26,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:13:26,148 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;@233d9108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:13:26,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:13:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:13:26,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:26,164 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:26,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 596666594, now seen corresponding path program 1 times [2024-11-20 02:13:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:13:26,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241910569] [2024-11-20 02:13:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:26,178 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-20 02:13:26,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:13:26,180 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-20 02:13:26,181 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-20 02:13:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:26,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:13:26,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-20 02:13:26,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:13:26,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:13:26,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241910569] [2024-11-20 02:13:26,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241910569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:13:26,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:13:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:13:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885788919] [2024-11-20 02:13:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:13:26,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:13:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:13:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:13:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:13:26,943 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:13:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:26,965 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2024-11-20 02:13:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:13:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-20 02:13:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:26,978 INFO L225 Difference]: With dead ends: 119 [2024-11-20 02:13:26,978 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 02:13:26,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-20 02:13:26,983 INFO L432 NwaCegarLoop]: 87 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, 87 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-20 02:13:26,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:13:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 02:13:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 02:13:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-20 02:13:27,011 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 145 [2024-11-20 02:13:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:27,012 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-20 02:13:27,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:13:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-20 02:13:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:13:27,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:27,015 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:27,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:13:27,215 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-20 02:13:27,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1184184870, now seen corresponding path program 1 times [2024-11-20 02:13:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:13:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532551075] [2024-11-20 02:13:27,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:27,218 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-20 02:13:27,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:13:27,219 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-20 02:13:27,220 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-20 02:13:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:27,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 02:13:27,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 02:13:30,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:13:30,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:13:30,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532551075] [2024-11-20 02:13:30,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532551075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:13:30,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:13:30,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:13:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031691603] [2024-11-20 02:13:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:13:30,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:13:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:13:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:13:30,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:13:30,536 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 02:13:34,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:13:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:13:34,949 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2024-11-20 02:13:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:13:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 145 [2024-11-20 02:13:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:13:35,020 INFO L225 Difference]: With dead ends: 115 [2024-11-20 02:13:35,021 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 02:13:35,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 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-20 02:13:35,022 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:13:35,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-20 02:13:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 02:13:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 02:13:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:13:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-20 02:13:35,031 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 145 [2024-11-20 02:13:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:13:35,033 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-20 02:13:35,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 02:13:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-20 02:13:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:13:35,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:13:35,035 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:13:35,056 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 (3)] Ended with exit code 0 [2024-11-20 02:13:35,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:13:35,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:13:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:13:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1442350308, now seen corresponding path program 1 times [2024-11-20 02:13:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:13:35,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547851843] [2024-11-20 02:13:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:35,237 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-20 02:13:35,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:13:35,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:13:35,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 02:13:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:35,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 02:13:35,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 620 proven. 114 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-20 02:13:41,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:13:42,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:13:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547851843] [2024-11-20 02:13:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547851843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:13:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1333155944] [2024-11-20 02:13:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:13:42,050 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:13:42,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:13:42,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 02:13:42,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 02:13:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:13:43,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 02:13:43,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:13:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 620 proven. 114 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-20 02:13:48,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:13:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1333155944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:13:48,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:13:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-20 02:13:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889141797] [2024-11-20 02:13:48,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:13:48,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:13:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:13:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:13:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:13:48,647 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 02:13:55,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:13:59,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:03,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:06,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:11,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:15,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:19,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:14:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:20,030 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2024-11-20 02:14:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:14:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 145 [2024-11-20 02:14:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:20,114 INFO L225 Difference]: With dead ends: 131 [2024-11-20 02:14:20,114 INFO L226 Difference]: Without dead ends: 75 [2024-11-20 02:14:20,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:14:20,115 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:20,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 183 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 30.8s Time] [2024-11-20 02:14:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-20 02:14:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-20 02:14:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:14:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-20 02:14:20,128 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 145 [2024-11-20 02:14:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-20 02:14:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 02:14:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-20 02:14:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:14:20,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:20,131 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:14:20,151 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 (4)] Forceful destruction successful, exit code 0 [2024-11-20 02:14:20,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-20 02:14:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 02:14:20,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1077609626, now seen corresponding path program 1 times [2024-11-20 02:14:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:14:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730151929] [2024-11-20 02:14:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:20,534 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-20 02:14:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:14:20,535 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-20 02:14:20,536 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-20 02:14:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:21,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 02:14:21,883 INFO L278 TraceCheckSpWp]: Computing forward predicates...