./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_steplocals_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_steplocals_file-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:37:06,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:37:06,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:37:06,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:37:06,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:37:06,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:37:06,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:37:06,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:37:06,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:37:06,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:37:06,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:37:06,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:37:06,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:37:06,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:37:06,171 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:37:06,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:37:06,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:37:06,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:37:06,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:37:06,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:37:06,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:37:06,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:37:06,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:37:06,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:37:06,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:37:06,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:37:06,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:37:06,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:37:06,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:37:06,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:37:06,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:37:06,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:37:06,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:06,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:37:06,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:37:06,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:37:06,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:37:06,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:37:06,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:37:06,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:37:06,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:37:06,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:37:06,185 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-10-14 07:37:06,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:37:06,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:37:06,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:37:06,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:37:06,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:37:06,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:08,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:37:08,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:37:08,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:08,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd312dff5/84c2a3c325e94258850d67438f9dca75/FLAG90b35edf0 [2024-10-14 07:37:08,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd312dff5/84c2a3c325e94258850d67438f9dca75 [2024-10-14 07:37:08,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:37:08,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:37:08,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:08,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:37:08,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:37:08,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be836ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08, skipping insertion in model container [2024-10-14 07:37:08,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:37:08,746 WARN L248 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_steplocals_file-11.i[917,930] [2024-10-14 07:37:08,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:08,817 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:37:08,833 WARN L248 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_steplocals_file-11.i[917,930] [2024-10-14 07:37:08,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:08,907 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:37:08,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08 WrapperNode [2024-10-14 07:37:08,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:08,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:08,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:37:08,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:37:08,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,968 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-14 07:37:08,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:08,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:37:08,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:37:08,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:37:08,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:08,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,021 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-10-14 07:37:09,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:37:09,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:37:09,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:37:09,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:37:09,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (1/1) ... [2024-10-14 07:37:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:09,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:37:09,104 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-10-14 07:37:09,108 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-10-14 07:37:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:37:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:37:09,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:37:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:37:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:37:09,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:37:09,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:37:09,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:37:09,547 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 07:37:09,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:37:09,611 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:37:09,611 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:37:09,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:09 BoogieIcfgContainer [2024-10-14 07:37:09,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:37:09,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:37:09,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:37:09,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:37:09,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:37:08" (1/3) ... [2024-10-14 07:37:09,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707aae4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:09, skipping insertion in model container [2024-10-14 07:37:09,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:08" (2/3) ... [2024-10-14 07:37:09,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707aae4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:09, skipping insertion in model container [2024-10-14 07:37:09,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:09" (3/3) ... [2024-10-14 07:37:09,622 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:09,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:37:09,639 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:37:09,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:37:09,706 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;@6a0cd0f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:37:09,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:37:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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-10-14 07:37:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 07:37:09,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:09,736 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] [2024-10-14 07:37:09,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2007679347, now seen corresponding path program 1 times [2024-10-14 07:37:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:09,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375755424] [2024-10-14 07:37:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:37:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:37:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:37:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:37:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:37:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:37:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:37:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:37:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:37:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:37:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:37:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:37:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:37:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:37:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:37:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:37:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:37:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:37:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:37:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:37:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:37:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:37:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:37:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 07:37:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:37:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375755424] [2024-10-14 07:37:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375755424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:37:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:37:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:37:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262944603] [2024-10-14 07:37:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:37:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:37:10,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:37:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:37:10,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:37:10,283 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-14 07:37:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:10,335 INFO L93 Difference]: Finished difference Result 119 states and 213 transitions. [2024-10-14 07:37:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:37:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 140 [2024-10-14 07:37:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:10,349 INFO L225 Difference]: With dead ends: 119 [2024-10-14 07:37:10,349 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 07:37:10,355 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-10-14 07:37:10,361 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:37:10,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:37:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 07:37:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 07:37:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-10-14 07:37:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-14 07:37:10,421 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 140 [2024-10-14 07:37:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:10,423 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-14 07:37:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-14 07:37:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-14 07:37:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 07:37:10,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:10,428 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] [2024-10-14 07:37:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:37:10,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 394913735, now seen corresponding path program 1 times [2024-10-14 07:37:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:10,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789983380] [2024-10-14 07:37:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:37:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:37:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:37:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:37:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:37:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:37:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:37:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:37:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:37:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:37:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:37:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:37:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:37:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:37:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:37:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:37:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:37:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:37:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:37:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:37:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:37:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:37:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:37:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-14 07:37:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:37:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789983380] [2024-10-14 07:37:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789983380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:37:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884899963] [2024-10-14 07:37:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:37:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:37:11,901 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-10-14 07:37:11,903 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-10-14 07:37:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:12,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 07:37:12,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:37:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 740 proven. 108 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-14 07:37:14,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:37:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884899963] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:37:16,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:37:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 25 [2024-10-14 07:37:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849819389] [2024-10-14 07:37:16,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:37:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 07:37:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:37:16,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 07:37:16,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 07:37:16,170 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-14 07:37:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:17,273 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2024-10-14 07:37:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 07:37:17,274 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) Word has length 140 [2024-10-14 07:37:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:17,277 INFO L225 Difference]: With dead ends: 167 [2024-10-14 07:37:17,277 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 07:37:17,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=684, Invalid=1968, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 07:37:17,280 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 280 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:37:17,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 416 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:37:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 07:37:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2024-10-14 07:37:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.303030303030303) internal successors, (86), 67 states have internal predecessors, (86), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 07:37:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-10-14 07:37:17,311 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 140 [2024-10-14 07:37:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:17,312 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-10-14 07:37:17,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-14 07:37:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-10-14 07:37:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 07:37:17,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:17,318 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] [2024-10-14 07:37:17,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:37:17,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:37:17,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:17,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1886725, now seen corresponding path program 1 times [2024-10-14 07:37:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:17,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934929620] [2024-10-14 07:37:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:37:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:37:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:37:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:37:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:37:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:37:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:37:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:37:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:37:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:37:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:37:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:37:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:37:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:37:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:37:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:37:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:37:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:37:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:37:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:37:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:37:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:37:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:37:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-14 07:37:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:37:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934929620] [2024-10-14 07:37:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934929620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:37:18,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281246544] [2024-10-14 07:37:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:18,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:37:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:37:18,108 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-10-14 07:37:18,114 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-10-14 07:37:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:18,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 07:37:18,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:37:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 713 proven. 162 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-14 07:37:20,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:37:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281246544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:37:21,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:37:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 26 [2024-10-14 07:37:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977314592] [2024-10-14 07:37:21,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:37:21,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 07:37:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:37:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 07:37:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 07:37:21,665 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) [2024-10-14 07:37:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:22,240 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2024-10-14 07:37:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 07:37:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) Word has length 140 [2024-10-14 07:37:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:22,245 INFO L225 Difference]: With dead ends: 207 [2024-10-14 07:37:22,245 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 07:37:22,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=610, Invalid=1742, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 07:37:22,248 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 160 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:37:22,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 216 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:37:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 07:37:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-14 07:37:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 07:37:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-10-14 07:37:22,265 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 140 [2024-10-14 07:37:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:22,266 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-10-14 07:37:22,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) [2024-10-14 07:37:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-10-14 07:37:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 07:37:22,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:22,268 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] [2024-10-14 07:37:22,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:37:22,472 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,SelfDestructingSolverStorable2 [2024-10-14 07:37:22,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:22,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1428001942, now seen corresponding path program 1 times [2024-10-14 07:37:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438628076] [2024-10-14 07:37:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:37:22,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:37:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:37:22,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:37:22,709 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:37:22,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:37:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:37:22,716 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 07:37:22,820 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:37:22,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:37:22 BoogieIcfgContainer [2024-10-14 07:37:22,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:37:22,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:37:22,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:37:22,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:37:22,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:09" (3/4) ... [2024-10-14 07:37:22,829 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:37:22,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:37:22,833 INFO L158 Benchmark]: Toolchain (without parser) took 14261.05ms. Allocated memory was 163.6MB in the beginning and 335.5MB in the end (delta: 172.0MB). Free memory was 116.2MB in the beginning and 219.2MB in the end (delta: -103.0MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,833 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:37:22,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.98ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 101.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.13ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,834 INFO L158 Benchmark]: Boogie Preprocessor took 77.93ms. Allocated memory is still 163.6MB. Free memory was 98.5MB in the beginning and 95.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,834 INFO L158 Benchmark]: RCFGBuilder took 559.89ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 73.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,834 INFO L158 Benchmark]: TraceAbstraction took 13209.03ms. Allocated memory was 163.6MB in the beginning and 335.5MB in the end (delta: 172.0MB). Free memory was 72.9MB in the beginning and 219.2MB in the end (delta: -146.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-14 07:37:22,834 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 335.5MB. Free memory is still 219.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:37:22,836 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.18ms. Allocated memory is still 163.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.98ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 101.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.13ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.93ms. Allocated memory is still 163.6MB. Free memory was 98.5MB in the beginning and 95.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 559.89ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 73.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13209.03ms. Allocated memory was 163.6MB in the beginning and 335.5MB in the end (delta: 172.0MB). Free memory was 72.9MB in the beginning and 219.2MB in the end (delta: -146.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 335.5MB. Free memory is still 219.2MB. 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 someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_6 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L101] var_1_7 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L103] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L104] var_1_8 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L106] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L110] var_1_11 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L111] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L112] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L113] var_1_13 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L114] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L117] var_1_17 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L119] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L120] var_1_18 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L121] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L122] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L123] var_1_20 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L124] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L51] unsigned long int stepLocal_1 = var_1_10; [L52] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, stepLocal_0=9, stepLocal_1=1879543162, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L53] COND TRUE var_1_6 != stepLocal_1 VAL [isInitial=1, stepLocal_0=9, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L54] COND FALSE !(stepLocal_0 <= var_1_6) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L62] COND FALSE !(\read(var_1_2)) [L71] var_1_15 = 5 VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L73] COND TRUE var_1_13 != var_1_14 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L82] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) [L83] unsigned char stepLocal_2 = var_1_12 == (var_1_8 - var_1_9); VAL [isInitial=1, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L84] COND FALSE !(stepLocal_2 && var_1_2) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 720 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 206 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 6341 SizeOfPredicates, 10 NumberOfNonLiveVariables, 647 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4670/5060 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-10-14 07:37:22,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_steplocals_file-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:37:25,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:37:25,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:37:25,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:37:25,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:37:25,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:37:25,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:37:25,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:37:25,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:37:25,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:37:25,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:37:25,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:37:25,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:37:25,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:37:25,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:37:25,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:37:25,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:37:25,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:37:25,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:37:25,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:37:25,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:37:25,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:37:25,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:37:25,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:37:25,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:37:25,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:37:25,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:37:25,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:37:25,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:37:25,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:37:25,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:37:25,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:37:25,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:37:25,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:37:25,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:25,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:37:25,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:37:25,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:37:25,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:37:25,280 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:37:25,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:37:25,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:37:25,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:37:25,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:37:25,281 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:37:25,281 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-10-14 07:37:25,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:37:25,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:37:25,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:37:25,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:37:25,622 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:37:25,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:27,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:37:27,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:37:27,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:27,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebf84ba1/3b2bf41e8c2f44259ad4df5f5390b302/FLAGd183ac6e6 [2024-10-14 07:37:27,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebf84ba1/3b2bf41e8c2f44259ad4df5f5390b302 [2024-10-14 07:37:27,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:37:27,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:37:27,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:27,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:37:27,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:37:27,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdfa28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27, skipping insertion in model container [2024-10-14 07:37:27,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:37:27,664 WARN L248 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_steplocals_file-11.i[917,930] [2024-10-14 07:37:27,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:27,763 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:37:27,795 WARN L248 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_steplocals_file-11.i[917,930] [2024-10-14 07:37:27,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:27,862 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:37:27,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27 WrapperNode [2024-10-14 07:37:27,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:27,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:27,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:37:27,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:37:27,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,922 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-14 07:37:27,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:27,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:37:27,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:37:27,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:37:27,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,967 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-10-14 07:37:27,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:27,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:37:28,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:37:28,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:37:28,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:37:28,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (1/1) ... [2024-10-14 07:37:28,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:37:28,046 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-10-14 07:37:28,053 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-10-14 07:37:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:37:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:37:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:37:28,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:37:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:37:28,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:37:28,188 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:37:28,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:37:28,532 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 07:37:28,533 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:37:28,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:37:28,610 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:37:28,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:28 BoogieIcfgContainer [2024-10-14 07:37:28,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:37:28,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:37:28,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:37:28,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:37:28,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:37:27" (1/3) ... [2024-10-14 07:37:28,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b01cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:28, skipping insertion in model container [2024-10-14 07:37:28,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:27" (2/3) ... [2024-10-14 07:37:28,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b01cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:28, skipping insertion in model container [2024-10-14 07:37:28,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:28" (3/3) ... [2024-10-14 07:37:28,622 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-10-14 07:37:28,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:37:28,641 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:37:28,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:37:28,721 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;@615c77a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:37:28,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:37:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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-10-14 07:37:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 07:37:28,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:28,745 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] [2024-10-14 07:37:28,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:28,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2007679347, now seen corresponding path program 1 times [2024-10-14 07:37:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:37:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687806539] [2024-10-14 07:37:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:28,768 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-10-14 07:37:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:37:28,771 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-10-14 07:37:28,773 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-10-14 07:37:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:29,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:37:29,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:37:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-14 07:37:29,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:37:29,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:37:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687806539] [2024-10-14 07:37:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687806539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:37:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:37:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:37:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898617807] [2024-10-14 07:37:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:37:29,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:37:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:37:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:37:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:37:29,127 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-10-14 07:37:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:29,188 INFO L93 Difference]: Finished difference Result 119 states and 213 transitions. [2024-10-14 07:37:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:37:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 140 [2024-10-14 07:37:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:29,200 INFO L225 Difference]: With dead ends: 119 [2024-10-14 07:37:29,200 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 07:37:29,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-10-14 07:37:29,206 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:37:29,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:37:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 07:37:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 07:37:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-10-14 07:37:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-14 07:37:29,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 140 [2024-10-14 07:37:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-14 07:37:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-10-14 07:37:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-14 07:37:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 07:37:29,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:29,269 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] [2024-10-14 07:37:29,278 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-10-14 07:37:29,470 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-10-14 07:37:29,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:29,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 394913735, now seen corresponding path program 1 times [2024-10-14 07:37:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:37:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104783937] [2024-10-14 07:37:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:29,474 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-10-14 07:37:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:37:29,475 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-10-14 07:37:29,477 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-10-14 07:37:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:29,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 07:37:29,750 INFO L278 TraceCheckSpWp]: Computing forward predicates...