./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_loopvsstraightlinecode_100-1loop_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_loopvsstraightlinecode_100-1loop_file-6.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 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:49:02,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:49:02,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:49:02,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:49:02,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:49:02,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:49:02,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:49:02,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:49:02,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:49:02,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:49:02,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:49:02,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:49:02,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:49:02,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:49:02,974 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:49:02,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:49:02,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:49:02,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:49:02,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:49:02,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:49:02,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:49:02,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:49:02,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:49:02,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:49:02,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:49:02,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:49:02,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:49:02,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:49:02,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:49:02,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:49:02,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:49:02,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:49:02,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:49:02,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:49:02,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:49:02,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:49:02,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:49:02,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:49:02,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:49:02,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:49:02,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:49:02,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:49:02,985 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 -> 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a [2024-10-13 03:49:03,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:49:03,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:49:03,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:49:03,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:49:03,261 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:49:03,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:04,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:49:04,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:49:04,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:04,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a268448a/e50b5d68e00f4ac4870ccc6362b89c77/FLAG43580df3c [2024-10-13 03:49:04,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a268448a/e50b5d68e00f4ac4870ccc6362b89c77 [2024-10-13 03:49:04,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:49:04,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:49:04,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:49:04,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:49:04,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:49:04,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:49:04" (1/1) ... [2024-10-13 03:49:04,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fd9e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:04, skipping insertion in model container [2024-10-13 03:49:04,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:49:04" (1/1) ... [2024-10-13 03:49:04,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:49:05,136 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_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-10-13 03:49:05,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:49:05,227 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:49:05,244 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_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-10-13 03:49:05,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:49:05,320 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:49:05,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05 WrapperNode [2024-10-13 03:49:05,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:49:05,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:49:05,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:49:05,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:49:05,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,394 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-13 03:49:05,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:49:05,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:49:05,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:49:05,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:49:05,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,448 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-13 03:49:05,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:49:05,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:49:05,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:49:05,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:49:05,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (1/1) ... [2024-10-13 03:49:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:49:05,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:49:05,539 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-13 03:49:05,542 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-13 03:49:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:49:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:49:05,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:49:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:49:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:49:05,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:49:05,688 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:49:05,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:49:06,183 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 03:49:06,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:49:06,226 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:49:06,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:49:06,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:49:06 BoogieIcfgContainer [2024-10-13 03:49:06,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:49:06,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:49:06,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:49:06,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:49:06,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:49:04" (1/3) ... [2024-10-13 03:49:06,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaae55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:49:06, skipping insertion in model container [2024-10-13 03:49:06,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:05" (2/3) ... [2024-10-13 03:49:06,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaae55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:49:06, skipping insertion in model container [2024-10-13 03:49:06,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:49:06" (3/3) ... [2024-10-13 03:49:06,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:06,252 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:49:06,253 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:49:06,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:49:06,320 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;@b6c7983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:49:06,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:49:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 60 states have internal predecessors, (89), 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-13 03:49:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 03:49:06,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:06,343 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:06,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:06,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash 947653659, now seen corresponding path program 1 times [2024-10-13 03:49:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4165077] [2024-10-13 03:49:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:06,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:49:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:49:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:49:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:49:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:49:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:49:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:49:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:49:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:49:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:49:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:49:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:49:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:49:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:49:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:49:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:49:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:49:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:49:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:49:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:49:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:49:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:49:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:49:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:06,784 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-13 03:49:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:49:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4165077] [2024-10-13 03:49:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4165077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:49:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:49:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:49:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623133210] [2024-10-13 03:49:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:49:06,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:49:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:49:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:49:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:49:06,822 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 60 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 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-13 03:49:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:06,865 INFO L93 Difference]: Finished difference Result 168 states and 290 transitions. [2024-10-13 03:49:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:49:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 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 149 [2024-10-13 03:49:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:06,875 INFO L225 Difference]: With dead ends: 168 [2024-10-13 03:49:06,875 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 03:49:06,879 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-13 03:49:06,882 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:06,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:49:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 03:49:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 03:49:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 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-13 03:49:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-13 03:49:06,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 149 [2024-10-13 03:49:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:06,934 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-13 03:49:06,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 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-13 03:49:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-13 03:49:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 03:49:06,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:06,941 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:49:06,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1357888095, now seen corresponding path program 1 times [2024-10-13 03:49:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527078581] [2024-10-13 03:49:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:49:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:49:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:49:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:49:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:49:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:49:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:49:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:49:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:49:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:49:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:49:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:49:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:49:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:49:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:49:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:49:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:49:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:49:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:49:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:49:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:49:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:49:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:49:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 03:49:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:49:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527078581] [2024-10-13 03:49:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527078581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:49:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339517317] [2024-10-13 03:49:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:49:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:49:08,564 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-13 03:49:08,567 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-13 03:49:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:08,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 03:49:08,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:49:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-13 03:49:09,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:49:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-13 03:49:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339517317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:49:10,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:49:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 28 [2024-10-13 03:49:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961305717] [2024-10-13 03:49:10,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:49:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 03:49:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:49:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 03:49:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2024-10-13 03:49:10,127 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39) [2024-10-13 03:49:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:13,551 INFO L93 Difference]: Finished difference Result 410 states and 586 transitions. [2024-10-13 03:49:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-13 03:49:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39) Word has length 149 [2024-10-13 03:49:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:13,556 INFO L225 Difference]: With dead ends: 410 [2024-10-13 03:49:13,556 INFO L226 Difference]: Without dead ends: 329 [2024-10-13 03:49:13,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1681, Invalid=5629, Unknown=0, NotChecked=0, Total=7310 [2024-10-13 03:49:13,561 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 841 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:13,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 955 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 03:49:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-13 03:49:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 103. [2024-10-13 03:49:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:49:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-13 03:49:13,618 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2024-10-13 03:49:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:13,619 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-13 03:49:13,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39) [2024-10-13 03:49:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-13 03:49:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:49:13,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:13,624 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:13,642 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-13 03:49:13,828 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-13 03:49:13,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:13,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 629868501, now seen corresponding path program 1 times [2024-10-13 03:49:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:13,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947192457] [2024-10-13 03:49:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:49:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:49:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:49:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:49:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:49:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:49:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:49:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:49:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:49:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:49:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:49:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:49:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:49:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:49:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:49:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:49:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:49:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:49:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:49:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:49:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:49:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:49:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:49:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:13,957 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-13 03:49:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:49:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947192457] [2024-10-13 03:49:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947192457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:49:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:49:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:49:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527673920] [2024-10-13 03:49:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:49:13,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:49:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:49:13,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:49:13,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:49:13,960 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:49:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:14,020 INFO L93 Difference]: Finished difference Result 245 states and 360 transitions. [2024-10-13 03:49:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:49:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-13 03:49:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:14,023 INFO L225 Difference]: With dead ends: 245 [2024-10-13 03:49:14,023 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 03:49:14,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:49:14,028 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:14,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:49:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 03:49:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-10-13 03:49:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:49:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2024-10-13 03:49:14,061 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 150 [2024-10-13 03:49:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:14,061 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2024-10-13 03:49:14,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:49:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2024-10-13 03:49:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:49:14,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:14,066 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:14,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:49:14,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1205433963, now seen corresponding path program 1 times [2024-10-13 03:49:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868026632] [2024-10-13 03:49:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:49:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:49:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:49:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:49:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:49:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:49:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:49:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:49:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:49:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:49:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:49:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:49:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:49:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:49:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:49:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:49:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:49:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:49:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:49:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:49:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:49:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:49:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:49:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,188 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-13 03:49:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:49:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868026632] [2024-10-13 03:49:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868026632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:49:14,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:49:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:49:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128670348] [2024-10-13 03:49:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:49:14,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:49:14,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:49:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:49:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:49:14,194 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:49:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:14,241 INFO L93 Difference]: Finished difference Result 310 states and 457 transitions. [2024-10-13 03:49:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:49:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-13 03:49:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:14,244 INFO L225 Difference]: With dead ends: 310 [2024-10-13 03:49:14,245 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 03:49:14,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:49:14,247 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:14,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 250 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:49:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 03:49:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-10-13 03:49:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 149 states have (on average 1.429530201342282) internal successors, (213), 150 states have internal predecessors, (213), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:49:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 263 transitions. [2024-10-13 03:49:14,281 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 263 transitions. Word has length 150 [2024-10-13 03:49:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:14,282 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 263 transitions. [2024-10-13 03:49:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:49:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 263 transitions. [2024-10-13 03:49:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:49:14,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:14,286 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:14,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:49:14,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:14,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2068464979, now seen corresponding path program 1 times [2024-10-13 03:49:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741386589] [2024-10-13 03:49:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:49:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:49:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:49:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:49:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:49:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:49:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:49:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:49:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:49:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:49:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:49:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:49:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:49:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:49:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:49:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:49:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:49:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:49:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:49:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:49:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:49:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:49:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:49:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 03:49:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:49:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741386589] [2024-10-13 03:49:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741386589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:49:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871457027] [2024-10-13 03:49:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:49:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:49:14,669 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-13 03:49:14,671 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-13 03:49:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:14,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:49:14,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:49:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-13 03:49:15,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:49:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 03:49:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871457027] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:49:15,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:49:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-10-13 03:49:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878543671] [2024-10-13 03:49:15,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:49:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:49:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:49:15,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:49:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:49:15,292 INFO L87 Difference]: Start difference. First operand 180 states and 263 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 03:49:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:15,494 INFO L93 Difference]: Finished difference Result 351 states and 504 transitions. [2024-10-13 03:49:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:49:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 150 [2024-10-13 03:49:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:15,498 INFO L225 Difference]: With dead ends: 351 [2024-10-13 03:49:15,498 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 03:49:15,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:49:15,500 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 57 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:15,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 222 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:49:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 03:49:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2024-10-13 03:49:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:49:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 234 transitions. [2024-10-13 03:49:15,532 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 234 transitions. Word has length 150 [2024-10-13 03:49:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 234 transitions. [2024-10-13 03:49:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 03:49:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 234 transitions. [2024-10-13 03:49:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 03:49:15,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:15,536 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:15,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:49:15,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:49:15,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -603616414, now seen corresponding path program 1 times [2024-10-13 03:49:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:49:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576354276] [2024-10-13 03:49:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:49:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:49:15,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:49:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:49:15,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:49:15,925 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:49:15,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:49:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:49:15,932 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 03:49:16,058 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:49:16,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:49:16 BoogieIcfgContainer [2024-10-13 03:49:16,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:49:16,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:49:16,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:49:16,064 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:49:16,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:49:06" (3/4) ... [2024-10-13 03:49:16,067 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:49:16,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:49:16,070 INFO L158 Benchmark]: Toolchain (without parser) took 11132.59ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 104.2MB in the beginning and 102.6MB in the end (delta: 1.6MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,070 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:49:16,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.65ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 86.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.39ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 81.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,072 INFO L158 Benchmark]: Boogie Preprocessor took 103.98ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,073 INFO L158 Benchmark]: RCFGBuilder took 727.13ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 123.4MB in the end (delta: -51.4MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,073 INFO L158 Benchmark]: TraceAbstraction took 9834.55ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 122.6MB in the beginning and 103.7MB in the end (delta: 18.9MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-10-13 03:49:16,073 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 255.9MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:49:16,075 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.19ms. Allocated memory is still 159.4MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.65ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 86.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.39ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 81.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.98ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 727.13ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 123.4MB in the end (delta: -51.4MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9834.55ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 122.6MB in the beginning and 103.7MB in the end (delta: 18.9MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 255.9MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 34011; [L26] unsigned short int var_1_6 = 2; [L27] signed short int var_1_7 = -4; [L28] signed long int var_1_9 = -4; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_12 = 1.8; [L31] double var_1_13 = 49.5; [L32] double var_1_14 = 0.0; [L33] double var_1_15 = 8.5; [L34] unsigned long int var_1_16 = 4; [L35] float var_1_17 = 3.65; [L36] unsigned char var_1_18 = 0; [L37] signed long int var_1_19 = 32; [L38] signed long int var_1_20 = 1000000000; [L39] signed long int var_1_21 = 1141305717; [L40] unsigned char var_1_22 = 50; [L41] unsigned char var_1_23 = 0; [L42] unsigned short int var_1_24 = 2; [L43] signed short int var_1_25 = -16; [L44] double var_1_26 = 15.6; [L45] double var_1_27 = 4.25; [L46] unsigned long int var_1_28 = 10; [L47] unsigned char last_1_var_1_22 = 50; [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L176] last_1_var_1_22 = var_1_22 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L142] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L147] var_1_6 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_7=-4, var_1_9=-4] [L148] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_7=-4, var_1_9=-4] [L149] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L149] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L150] var_1_13 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L152] var_1_14 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L159] var_1_20 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_20 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L160] RET assume_abort_if_not(var_1_20 >= 536870911) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L162] var_1_21 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_21 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L163] RET assume_abort_if_not(var_1_21 >= 1073741822) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L165] var_1_23 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L166] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L171] var_1_27 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L188] RET updateVariables() [L189] CALL step() [L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22) [L52] unsigned char stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=50, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=0] [L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3)) [L54] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=0] [L58] COND TRUE var_1_2 || var_1_3 [L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=-4, var_1_9=0] [L63] COND FALSE !(var_1_22 <= (- 500)) [L68] var_1_7 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L70] var_1_10 = (var_1_5 - (var_1_22 + 1000)) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L71] COND FALSE !(! var_1_3) [L74] var_1_12 = (var_1_14 - var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L76] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=4, var_1_10=31763, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L77] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=4, var_1_10=31763, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0 [L81] var_1_16 = 128u VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L86] COND TRUE \read(var_1_18) [L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L99] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=2, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L100] COND TRUE ! ((! var_1_3) && var_1_18) [L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L107] unsigned short int stepLocal_4 = var_1_24; [L108] unsigned short int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31763, stepLocal_4=4, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31763, stepLocal_4=4, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L122] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=4, stepLocal_3=31763, stepLocal_4=4, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L123] COND TRUE var_1_24 >= stepLocal_1 VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31763, stepLocal_4=4, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L124] COND TRUE ! var_1_2 [L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5))) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31763, stepLocal_4=4, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L189] RET step() [L190] CALL, EXPR property() [L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21)) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31763, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=4, var_1_20=1073741823, var_1_21=1073741822, var_1_22=4, var_1_23=4, var_1_24=4, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-294913, var_1_6=0, var_1_7=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 995 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 991 mSDsluCounter, 1776 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1181 mSDsCounter, 432 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1700 IncrementalHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 432 mSolverCounterUnsat, 595 mSDtfsCounter, 1700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 945 GetRequests, 847 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 250 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1198 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1337 ConstructedInterpolants, 0 QuantifiedInterpolants, 3557 SizeOfPredicates, 15 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8850/9108 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-13 03:49:16,119 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_loopvsstraightlinecode_100-1loop_file-6.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 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:49:18,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:49:18,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:49:18,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:49:18,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:49:18,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:49:18,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:49:18,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:49:18,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:49:18,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:49:18,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:49:18,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:49:18,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:49:18,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:49:18,457 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:49:18,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:49:18,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:49:18,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:49:18,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:49:18,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:49:18,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:49:18,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:49:18,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:49:18,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:49:18,462 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:49:18,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:49:18,462 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:49:18,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:49:18,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:49:18,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:49:18,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:49:18,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:49:18,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:49:18,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:49:18,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:49:18,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:49:18,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:49:18,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:49:18,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:49:18,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:49:18,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:49:18,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:49:18,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:49:18,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:49:18,470 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:49:18,470 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 -> 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a [2024-10-13 03:49:18,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:49:18,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:49:18,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:49:18,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:49:18,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:49:18,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:20,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:49:20,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:49:20,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:20,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10026d43c/967558f72a164c31b733c8bf4ac0c668/FLAG34e16e775 [2024-10-13 03:49:20,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10026d43c/967558f72a164c31b733c8bf4ac0c668 [2024-10-13 03:49:20,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:49:20,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:49:20,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:49:20,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:49:20,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:49:20,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:49:20" (1/1) ... [2024-10-13 03:49:20,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e1cf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:20, skipping insertion in model container [2024-10-13 03:49:20,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:49:20" (1/1) ... [2024-10-13 03:49:20,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:49:20,974 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_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-10-13 03:49:21,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:49:21,085 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:49:21,099 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_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-10-13 03:49:21,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:49:21,174 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:49:21,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21 WrapperNode [2024-10-13 03:49:21,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:49:21,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:49:21,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:49:21,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:49:21,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,241 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-13 03:49:21,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:49:21,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:49:21,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:49:21,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:49:21,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,290 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-13 03:49:21,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:49:21,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:49:21,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:49:21,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:49:21,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (1/1) ... [2024-10-13 03:49:21,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:49:21,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:49:21,375 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-13 03:49:21,377 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-13 03:49:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:49:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:49:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:49:21,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:49:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:49:21,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:49:21,497 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:49:21,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:49:38,234 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-13 03:49:38,235 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:49:38,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:49:38,298 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:49:38,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:49:38 BoogieIcfgContainer [2024-10-13 03:49:38,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:49:38,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:49:38,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:49:38,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:49:38,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:49:20" (1/3) ... [2024-10-13 03:49:38,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4fc75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:49:38, skipping insertion in model container [2024-10-13 03:49:38,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:49:21" (2/3) ... [2024-10-13 03:49:38,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4fc75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:49:38, skipping insertion in model container [2024-10-13 03:49:38,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:49:38" (3/3) ... [2024-10-13 03:49:38,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-10-13 03:49:38,347 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:49:38,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:49:38,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:49:38,438 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;@635a9197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:49:38,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:49:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 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-13 03:49:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 03:49:38,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:38,461 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:38,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:38,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash 56485099, now seen corresponding path program 1 times [2024-10-13 03:49:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:49:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757404140] [2024-10-13 03:49:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:38,485 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-13 03:49:38,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:49:38,489 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-13 03:49:38,505 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-13 03:49:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:39,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:49:39,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:49:39,797 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-13 03:49:39,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:49:39,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:49:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757404140] [2024-10-13 03:49:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757404140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:49:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:49:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:49:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507368044] [2024-10-13 03:49:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:49:39,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:49:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:49:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:49:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:49:39,836 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-13 03:49:44,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:49:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:49:44,437 INFO L93 Difference]: Finished difference Result 146 states and 258 transitions. [2024-10-13 03:49:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:49:44,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 147 [2024-10-13 03:49:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:49:44,450 INFO L225 Difference]: With dead ends: 146 [2024-10-13 03:49:44,450 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 03:49:44,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-13 03:49:44,459 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:49:44,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 03:49:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 03:49:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 03:49:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 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-13 03:49:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-13 03:49:44,505 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 147 [2024-10-13 03:49:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:49:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-13 03:49:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-13 03:49:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-13 03:49:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 03:49:44,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:49:44,513 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:49:44,557 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-13 03:49:44,713 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-13 03:49:44,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:49:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:49:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1184810993, now seen corresponding path program 1 times [2024-10-13 03:49:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:49:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419257088] [2024-10-13 03:49:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:44,716 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-13 03:49:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:49:44,718 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-13 03:49:44,720 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-13 03:49:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:45,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 03:49:45,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:49:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-13 03:49:49,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:49:51,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:49:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419257088] [2024-10-13 03:49:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419257088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:49:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1807495266] [2024-10-13 03:49:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:49:51,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:49:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:49:51,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:49:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:49:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:49:54,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 03:49:54,929 INFO L278 TraceCheckSpWp]: Computing forward predicates...