./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-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:05:28,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:05:28,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:05:28,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:05:28,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:05:28,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:05:28,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:05:28,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:05:28,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:05:28,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:05:28,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:05:28,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:05:28,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:05:28,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:05:28,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:05:28,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:05:28,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:05:28,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:05:28,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:05:28,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:05:28,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:05:28,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:05:28,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:05:28,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:05:28,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:05:28,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:05:28,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:05:28,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:05:28,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:05:28,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:05:28,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:05:28,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:05:28,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:05:28,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:05:28,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:05:28,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:05:28,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:05:28,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:05:28,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:05:28,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:05:28,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:05:28,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:05:28,349 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-clean/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-clean/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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2024-10-11 11:05:28,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:05:28,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:05:28,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:05:28,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:05:28,641 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:05:28,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-10-11 11:05:30,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:05:30,257 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:05:30,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-10-11 11:05:30,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99d986eb5/106c08926edf4f5e837a51f757d711c6/FLAGdae7e9745 [2024-10-11 11:05:30,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99d986eb5/106c08926edf4f5e837a51f757d711c6 [2024-10-11 11:05:30,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:05:30,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:05:30,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:05:30,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:05:30,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:05:30,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:30,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dad94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30, skipping insertion in model container [2024-10-11 11:05:30,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:30,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:05:30,806 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-37.i[916,929] [2024-10-11 11:05:30,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:05:30,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:05:30,914 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-37.i[916,929] [2024-10-11 11:05:30,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:05:30,975 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:05:30,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30 WrapperNode [2024-10-11 11:05:30,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:05:30,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:05:30,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:05:30,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:05:30,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:30,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,034 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-11 11:05:31,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:05:31,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:05:31,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:05:31,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:05:31,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,075 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-11 11:05:31,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:05:31,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:05:31,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:05:31,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:05:31,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (1/1) ... [2024-10-11 11:05:31,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:05:31,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:31,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:05:31,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:05:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:05:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:05:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:05:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:05:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:05:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:05:31,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:05:31,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:05:31,842 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-11 11:05:31,843 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:05:31,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:05:31,893 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:05:31,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:05:31 BoogieIcfgContainer [2024-10-11 11:05:31,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:05:31,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:05:31,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:05:31,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:05:31,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:05:30" (1/3) ... [2024-10-11 11:05:31,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8dc6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:05:31, skipping insertion in model container [2024-10-11 11:05:31,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:30" (2/3) ... [2024-10-11 11:05:31,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8dc6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:05:31, skipping insertion in model container [2024-10-11 11:05:31,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:05:31" (3/3) ... [2024-10-11 11:05:31,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-10-11 11:05:31,922 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:05:31,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:05:31,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:05:32,002 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;@48b83477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:05:32,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:05:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:05:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 11:05:32,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:32,024 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:32,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -44020509, now seen corresponding path program 1 times [2024-10-11 11:05:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076747349] [2024-10-11 11:05:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:05:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:05:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:05:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:05:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:05:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:05:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:05:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:05:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:05:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:05:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:05:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:05:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:05:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:05:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:05:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:05:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:05:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:05:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:05:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:05:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 11:05:32,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076747349] [2024-10-11 11:05:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076747349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:05:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:05:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:05:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17444605] [2024-10-11 11:05:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:05:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:05:32,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:32,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:05:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:05:32,518 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 11:05:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:32,566 INFO L93 Difference]: Finished difference Result 173 states and 299 transitions. [2024-10-11 11:05:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:05:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-10-11 11:05:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:32,576 INFO L225 Difference]: With dead ends: 173 [2024-10-11 11:05:32,576 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 11:05:32,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11 11:05:32,583 INFO L432 NwaCegarLoop]: 132 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, 132 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-11 11:05:32,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:05:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 11:05:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 11:05:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 63 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:05:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-11 11:05:32,640 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 133 [2024-10-11 11:05:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:32,642 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-11 11:05:32,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 11:05:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-11 11:05:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 11:05:32,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:32,646 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:32,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:05:32,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:32,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 69223847, now seen corresponding path program 1 times [2024-10-11 11:05:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174475222] [2024-10-11 11:05:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:05:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:05:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:05:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:05:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:05:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:05:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:05:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:05:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:05:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:05:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:05:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:05:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:05:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:05:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:05:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:05:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:05:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:05:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:05:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:05:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 11:05:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174475222] [2024-10-11 11:05:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174475222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:05:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:05:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:05:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837804330] [2024-10-11 11:05:33,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:05:33,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:05:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:05:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:05:33,014 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:33,140 INFO L93 Difference]: Finished difference Result 250 states and 397 transitions. [2024-10-11 11:05:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:05:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-11 11:05:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:33,145 INFO L225 Difference]: With dead ends: 250 [2024-10-11 11:05:33,146 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 11:05:33,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-11 11:05:33,149 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:33,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 281 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:05:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 11:05:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-10-11 11:05:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.462809917355372) internal successors, (177), 121 states have internal predecessors, (177), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 11:05:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 257 transitions. [2024-10-11 11:05:33,199 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 257 transitions. Word has length 133 [2024-10-11 11:05:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 257 transitions. [2024-10-11 11:05:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 257 transitions. [2024-10-11 11:05:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 11:05:33,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:33,202 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:05:33,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -633594072, now seen corresponding path program 1 times [2024-10-11 11:05:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903481875] [2024-10-11 11:05:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:05:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:05:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:05:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:05:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:05:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:05:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:05:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:05:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:05:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:05:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:05:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:05:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:05:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:05:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:05:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:05:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:05:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:05:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:05:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:05:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 11:05:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:33,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903481875] [2024-10-11 11:05:33,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903481875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:05:33,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:05:33,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:05:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205097206] [2024-10-11 11:05:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:05:33,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:05:33,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:05:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:05:33,762 INFO L87 Difference]: Start difference. First operand 164 states and 257 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:34,251 INFO L93 Difference]: Finished difference Result 379 states and 586 transitions. [2024-10-11 11:05:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:05:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-10-11 11:05:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:34,254 INFO L225 Difference]: With dead ends: 379 [2024-10-11 11:05:34,254 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 11:05:34,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:05:34,261 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 174 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:34,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 585 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:05:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 11:05:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2024-10-11 11:05:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.4329268292682926) internal successors, (235), 165 states have internal predecessors, (235), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 11:05:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2024-10-11 11:05:34,306 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 134 [2024-10-11 11:05:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:34,307 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2024-10-11 11:05:34,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2024-10-11 11:05:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:05:34,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:34,311 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:05:34,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1087470546, now seen corresponding path program 1 times [2024-10-11 11:05:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451406594] [2024-10-11 11:05:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:05:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:05:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:05:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:05:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:05:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:05:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:05:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:05:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:05:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:05:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:05:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:05:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:05:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:05:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:05:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:05:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:05:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:05:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:05:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:05:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 11:05:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451406594] [2024-10-11 11:05:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451406594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:05:34,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:05:34,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:05:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733941039] [2024-10-11 11:05:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:05:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:05:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:05:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:05:34,659 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:35,099 INFO L93 Difference]: Finished difference Result 437 states and 651 transitions. [2024-10-11 11:05:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:05:35,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-10-11 11:05:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:35,104 INFO L225 Difference]: With dead ends: 437 [2024-10-11 11:05:35,105 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 11:05:35,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:05:35,106 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 152 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:35,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 612 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:05:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 11:05:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 188. [2024-10-11 11:05:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 11:05:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2024-10-11 11:05:35,142 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 135 [2024-10-11 11:05:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:35,143 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2024-10-11 11:05:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 11:05:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2024-10-11 11:05:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 11:05:35,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:35,145 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:35,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:05:35,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:35,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash -188239155, now seen corresponding path program 1 times [2024-10-11 11:05:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120763292] [2024-10-11 11:05:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:05:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:05:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:05:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:05:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:05:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:05:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:05:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:05:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:05:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:05:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:05:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:05:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:05:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:05:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:05:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:05:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:05:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:05:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:05:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:05:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 11:05:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120763292] [2024-10-11 11:05:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120763292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:05:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090570407] [2024-10-11 11:05:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:35,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:05:35,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:05:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:36,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:05:36,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:05:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 11:05:36,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:05:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 11:05:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090570407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:05:36,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:05:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 11:05:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472832931] [2024-10-11 11:05:36,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:05:36,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:05:36,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:05:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:05:36,583 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:05:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:36,840 INFO L93 Difference]: Finished difference Result 296 states and 443 transitions. [2024-10-11 11:05:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:05:36,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 136 [2024-10-11 11:05:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:36,843 INFO L225 Difference]: With dead ends: 296 [2024-10-11 11:05:36,843 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 11:05:36,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:05:36,844 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 313 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:36,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 219 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:05:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 11:05:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2024-10-11 11:05:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:05:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-11 11:05:36,862 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 136 [2024-10-11 11:05:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:36,862 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-11 11:05:36,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:05:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-11 11:05:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 11:05:36,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:36,864 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:36,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:05:37,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:37,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 779255797, now seen corresponding path program 1 times [2024-10-11 11:05:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607128510] [2024-10-11 11:05:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:05:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56670622] [2024-10-11 11:05:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:37,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:05:37,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:05:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:37,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 11:05:37,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:05:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 402 proven. 78 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 11:05:38,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:05:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 11:05:40,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:40,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607128510] [2024-10-11 11:05:40,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:05:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56670622] [2024-10-11 11:05:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56670622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:05:40,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:05:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-10-11 11:05:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799754486] [2024-10-11 11:05:40,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:05:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 11:05:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 11:05:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-10-11 11:05:40,869 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-10-11 11:05:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:47,482 INFO L93 Difference]: Finished difference Result 553 states and 758 transitions. [2024-10-11 11:05:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 11:05:47,482 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 137 [2024-10-11 11:05:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:47,485 INFO L225 Difference]: With dead ends: 553 [2024-10-11 11:05:47,485 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 11:05:47,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4511, Unknown=0, NotChecked=0, Total=6006 [2024-10-11 11:05:47,488 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1984 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:47,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1987 Valid, 761 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 11:05:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 11:05:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 304. [2024-10-11 11:05:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 11:05:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2024-10-11 11:05:47,563 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 137 [2024-10-11 11:05:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:47,563 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2024-10-11 11:05:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-10-11 11:05:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2024-10-11 11:05:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 11:05:47,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:47,566 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:47,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:05:47,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:47,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 192449783, now seen corresponding path program 1 times [2024-10-11 11:05:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719679093] [2024-10-11 11:05:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:05:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026897465] [2024-10-11 11:05:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:47,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:05:47,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:05:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:48,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 11:05:48,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:05:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 464 proven. 54 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 11:05:49,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:05:56,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~last_1_var_1_10~0 65536)) (.cse0 (* c_~last_1_var_1_29~0 c_~last_1_var_1_1~0))) (let ((.cse4 (div .cse0 c_~var_1_4~0)) (.cse1 (+ .cse6 1))) (let ((.cse2 (= (mod .cse0 c_~var_1_4~0) 0)) (.cse5 (< c_~var_1_4~0 0)) (.cse3 (< .cse4 .cse1))) (and (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) .cse1) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0))) (or (not .cse2) .cse3) (or (and (<= .cse4 .cse1) (or .cse5 (< .cse4 .cse6))) (< 0 (+ .cse0 1)) .cse2) (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) (+ 2 .cse6)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (or .cse5 .cse3) (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) .cse1) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (not (= (mod .cse0 ~var_1_23~0) 0)))))))) is different from false [2024-10-11 11:05:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:05:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719679093] [2024-10-11 11:05:56,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:05:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026897465] [2024-10-11 11:05:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026897465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:05:56,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:05:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-11 11:05:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263510642] [2024-10-11 11:05:56,640 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:05:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:05:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:05:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:05:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2024-10-11 11:05:56,641 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 11:05:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:05:58,087 INFO L93 Difference]: Finished difference Result 539 states and 732 transitions. [2024-10-11 11:05:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 11:05:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 137 [2024-10-11 11:05:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:05:58,090 INFO L225 Difference]: With dead ends: 539 [2024-10-11 11:05:58,090 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 11:05:58,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=196, Invalid=737, Unknown=1, NotChecked=58, Total=992 [2024-10-11 11:05:58,092 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 233 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:05:58,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 698 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 11:05:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 11:05:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2024-10-11 11:05:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 231 states have (on average 1.29004329004329) internal successors, (298), 231 states have internal predecessors, (298), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 11:05:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 418 transitions. [2024-10-11 11:05:58,160 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 418 transitions. Word has length 137 [2024-10-11 11:05:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:05:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 418 transitions. [2024-10-11 11:05:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 11:05:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 418 transitions. [2024-10-11 11:05:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 11:05:58,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:58,163 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:05:58,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:05:58,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:58,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 645242291, now seen corresponding path program 1 times [2024-10-11 11:05:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:05:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539914386] [2024-10-11 11:05:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:05:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374972548] [2024-10-11 11:05:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:58,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:05:58,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:58,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:05:58,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 11:05:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:58,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 11:05:58,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:06:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 376 proven. 111 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-11 11:06:01,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:06:22,905 WARN L286 SmtUtils]: Spent 12.36s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 11:06:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:06:31,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539914386] [2024-10-11 11:06:31,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:06:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374972548] [2024-10-11 11:06:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374972548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:06:31,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:06:31,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-10-11 11:06:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468435868] [2024-10-11 11:06:31,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:06:31,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 11:06:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:06:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 11:06:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-10-11 11:06:31,656 INFO L87 Difference]: Start difference. First operand 308 states and 418 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 11:06:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:06:33,415 INFO L93 Difference]: Finished difference Result 503 states and 675 transitions. [2024-10-11 11:06:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 11:06:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 137 [2024-10-11 11:06:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:06:33,419 INFO L225 Difference]: With dead ends: 503 [2024-10-11 11:06:33,419 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 11:06:33,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=409, Invalid=1753, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 11:06:33,421 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 610 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:06:33,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 752 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 11:06:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 11:06:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 340. [2024-10-11 11:06:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 256 states have (on average 1.2734375) internal successors, (326), 257 states have internal predecessors, (326), 64 states have call successors, (64), 19 states have call predecessors, (64), 19 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:06:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 454 transitions. [2024-10-11 11:06:33,509 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 454 transitions. Word has length 137 [2024-10-11 11:06:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:06:33,510 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 454 transitions. [2024-10-11 11:06:33,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 11:06:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 454 transitions. [2024-10-11 11:06:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 11:06:33,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:33,512 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:06:33,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 11:06:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 11:06:33,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:33,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 58436277, now seen corresponding path program 1 times [2024-10-11 11:06:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398460224] [2024-10-11 11:06:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:06:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987216758] [2024-10-11 11:06:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:33,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:33,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:06:33,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 11:06:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:34,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 11:06:34,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:06:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 502 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 11:06:35,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:06:42,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~last_1_var_1_10~0 65536))) (let ((.cse3 (< 0 (+ c_~var_1_5~0 1))) (.cse0 (+ .cse2 1))) (and (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (not (= (mod c_~var_1_5~0 ~var_1_23~0) 0)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (forall ((~var_1_23~0 Int)) (let ((.cse1 (div c_~var_1_5~0 ~var_1_23~0))) (or (< .cse1 .cse0) (= .cse1 .cse0) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0)))) (or (forall ((~var_1_23~0 Int)) (or (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (= (mod c_~var_1_5~0 ~var_1_23~0) 0) (< (div c_~var_1_5~0 ~var_1_23~0) (+ 2 .cse2)))) .cse3) (let ((.cse4 (= (mod c_~var_1_5~0 c_~var_1_4~0) 0)) (.cse5 (div c_~var_1_5~0 c_~var_1_4~0))) (or (and (not .cse4) (or (< .cse5 .cse2) (and (<= (+ c_~var_1_4~0 1) 0) (<= .cse5 .cse0)))) (and (or .cse3 .cse4) (<= .cse5 .cse2)))) (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0)))))) is different from false [2024-10-11 11:06:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:06:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398460224] [2024-10-11 11:06:42,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:06:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987216758] [2024-10-11 11:06:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987216758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:06:42,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:06:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-11 11:06:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117872169] [2024-10-11 11:06:42,558 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:06:42,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 11:06:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:06:42,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 11:06:42,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=264, Unknown=1, NotChecked=34, Total=380 [2024-10-11 11:06:42,560 INFO L87 Difference]: Start difference. First operand 340 states and 454 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-11 11:06:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:06:43,505 INFO L93 Difference]: Finished difference Result 492 states and 662 transitions. [2024-10-11 11:06:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 11:06:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 137 [2024-10-11 11:06:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:06:43,508 INFO L225 Difference]: With dead ends: 492 [2024-10-11 11:06:43,508 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 11:06:43,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=310, Invalid=953, Unknown=1, NotChecked=68, Total=1332 [2024-10-11 11:06:43,510 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 157 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:06:43,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 484 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:06:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 11:06:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2024-10-11 11:06:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 256 states have (on average 1.26953125) internal successors, (325), 257 states have internal predecessors, (325), 64 states have call successors, (64), 19 states have call predecessors, (64), 19 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:06:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 453 transitions. [2024-10-11 11:06:43,579 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 453 transitions. Word has length 137 [2024-10-11 11:06:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:06:43,579 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 453 transitions. [2024-10-11 11:06:43,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-11 11:06:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 453 transitions. [2024-10-11 11:06:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 11:06:43,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:43,581 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:06:43,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 11:06:43,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:43,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:43,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -889968132, now seen corresponding path program 1 times [2024-10-11 11:06:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32044047] [2024-10-11 11:06:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:06:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716486228] [2024-10-11 11:06:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:43,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:06:43,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 11:06:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:06:44,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:06:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:06:44,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:06:44,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:06:44,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:06:44,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 11:06:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 11:06:44,484 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:44,623 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:06:44,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:06:44 BoogieIcfgContainer [2024-10-11 11:06:44,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:06:44,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:06:44,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:06:44,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:06:44,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:05:31" (3/4) ... [2024-10-11 11:06:44,630 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:06:44,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:06:44,631 INFO L158 Benchmark]: Toolchain (without parser) took 74028.06ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 112.7MB in the beginning and 303.5MB in the end (delta: -190.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:06:44,631 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:06:44,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 94.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:06:44,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.35ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:06:44,632 INFO L158 Benchmark]: Boogie Preprocessor took 80.56ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 84.5MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:06:44,632 INFO L158 Benchmark]: RCFGBuilder took 777.44ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 117.9MB in the end (delta: -33.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 11:06:44,633 INFO L158 Benchmark]: TraceAbstraction took 72729.57ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 116.9MB in the beginning and 303.5MB in the end (delta: -186.5MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. [2024-10-11 11:06:44,633 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 343.9MB. Free memory is still 303.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:06:44,634 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 94.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.35ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.56ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 84.5MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 777.44ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 117.9MB in the end (delta: -33.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 72729.57ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 116.9MB in the beginning and 303.5MB in the end (delta: -186.5MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 343.9MB. Free memory is still 303.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 75, overapproximation of someUnaryFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 10; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 5; [L27] double var_1_7 = 4.175; [L28] unsigned char var_1_9 = 100; [L29] unsigned short int var_1_10 = 128; [L30] float var_1_11 = 10.6; [L31] float var_1_12 = 16.25; [L32] float var_1_13 = 0.0; [L33] float var_1_14 = 127.2; [L34] double var_1_15 = 0.75; [L35] unsigned char var_1_18 = 1; [L36] unsigned char var_1_19 = 1; [L37] signed char var_1_20 = 1; [L38] signed short int var_1_21 = -1; [L39] unsigned long int var_1_22 = 1000000000; [L40] signed long int var_1_23 = -50; [L41] unsigned long int var_1_24 = 3900988395; [L42] unsigned long int var_1_25 = 2230016845; [L43] unsigned long int var_1_26 = 256; [L44] unsigned long int var_1_27 = 4; [L45] signed char var_1_29 = 8; [L46] signed long int last_1_var_1_1 = 2; [L47] unsigned char last_1_var_1_9 = 100; [L48] unsigned short int last_1_var_1_10 = 128; [L49] double last_1_var_1_15 = 0.75; [L50] signed short int last_1_var_1_21 = -1; [L51] unsigned long int last_1_var_1_22 = 1000000000; [L52] unsigned long int last_1_var_1_27 = 4; [L53] signed char last_1_var_1_29 = 8; [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L173] last_1_var_1_1 = var_1_1 [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_10 = var_1_10 [L176] last_1_var_1_15 = var_1_15 [L177] last_1_var_1_21 = var_1_21 [L178] last_1_var_1_22 = var_1_22 [L179] last_1_var_1_27 = var_1_27 [L180] last_1_var_1_29 = var_1_29 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L143] var_1_3 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L144] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L147] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L149] var_1_5 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L152] var_1_12 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L153] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L154] var_1_13 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L155] RET assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L156] var_1_14 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L157] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L161] var_1_23 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L162] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L165] var_1_24 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_24 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L166] RET assume_abort_if_not(var_1_24 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L168] var_1_25 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L169] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L192] RET updateVariables() [L193] CALL step() [L57] signed long int stepLocal_3 = last_1_var_1_1 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_3=16, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L58] COND TRUE var_1_5 == stepLocal_3 [L59] var_1_21 = ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L63] signed long int stepLocal_4 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_4=128, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L64] COND TRUE (var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= stepLocal_4 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L65] COND TRUE \read(var_1_19) [L66] var_1_22 = (var_1_24 - (last_1_var_1_9 + var_1_4)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L71] COND TRUE last_1_var_1_15 < (- var_1_14) [L72] var_1_18 = (var_1_2 || var_1_19) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L74] var_1_10 = ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) [L75] var_1_11 = (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13)))) [L76] var_1_20 = var_1_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L77] COND TRUE var_1_21 != 10 [L78] var_1_9 = ((((var_1_4) > (2)) ? (var_1_4) : (2))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L90] signed short int stepLocal_2 = var_1_21; [L91] unsigned long int stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, stepLocal_2=-13763, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L92] COND FALSE !((var_1_9 * (var_1_4 * var_1_5)) < stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L99] COND TRUE \read(var_1_18) [L100] var_1_15 = ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L112] signed long int stepLocal_0 = 500 * var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L113] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L114] COND FALSE !((var_1_3 - (var_1_4 - var_1_5)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L120] COND TRUE var_1_18 && var_1_19 [L121] var_1_27 = ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L123] COND TRUE (var_1_13 - var_1_14) <= var_1_12 [L124] var_1_26 = (var_1_25 - var_1_27) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L128] unsigned char stepLocal_5 = var_1_13 < var_1_15; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, stepLocal_5=1, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L129] COND TRUE var_1_18 || stepLocal_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L130] COND TRUE (((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15 [L131] var_1_29 = (var_1_5 - 10) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483812, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L193] RET step() [L194] CALL, EXPR property() [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183] EXPR ((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183-L184] return ((((((((((((var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1)) && ((var_1_21 != 10) ? (var_1_9 == ((unsigned char) ((((var_1_4) > (2)) ? (var_1_4) : (2))))) : ((var_1_22 > (var_1_21 / 128)) ? (var_1_18 ? (var_1_9 == ((unsigned char) var_1_4)) : (var_1_9 == ((unsigned char) var_1_5))) : (var_1_9 == ((unsigned char) var_1_4))))) && (var_1_10 == ((unsigned short int) ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4)))))) && (var_1_11 == ((float) (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13))))))) && (var_1_18 ? (var_1_15 == ((double) ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : ((var_1_22 < var_1_4) ? ((var_1_18 || var_1_18) ? (var_1_15 == ((double) var_1_14)) : (var_1_15 == ((double) var_1_14))) : (var_1_15 == ((double) var_1_13))))) && ((last_1_var_1_15 < (- var_1_14)) ? (var_1_18 == ((unsigned char) (var_1_2 || var_1_19))) : 1)) && (var_1_20 == ((signed char) var_1_5))) && ((var_1_5 == (last_1_var_1_1 * last_1_var_1_29)) ? (var_1_21 == ((signed short int) ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))))) : (var_1_21 == ((signed short int) ((((last_1_var_1_21) > (var_1_4)) ? (last_1_var_1_21) : (var_1_4))))))) && (((var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= last_1_var_1_10) ? (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_24 - (last_1_var_1_9 + var_1_4)))) : (var_1_22 == ((unsigned long int) (((((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) < (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))) ? ((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) : (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))))))) : 1)) && (((var_1_13 - var_1_14) <= var_1_12) ? (var_1_26 == ((unsigned long int) (var_1_25 - var_1_27))) : (var_1_26 == ((unsigned long int) ((((var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) < 0 ) ? -(var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) : (var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))))))))) && ((var_1_18 && var_1_19) ? (var_1_27 == ((unsigned long int) ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))))) : 1)) && ((var_1_18 || (var_1_13 < var_1_15)) ? (((((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15) ? (var_1_29 == ((signed char) (var_1_5 - 10))) : (var_1_29 == ((signed char) var_1_5))) : (var_1_29 == ((signed char) var_1_5))) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=-2147483812, var_1_23=35, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.5s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3766 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3743 mSDsluCounter, 4524 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3468 mSDsCounter, 776 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4890 IncrementalHoareTripleChecker+Invalid, 5666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 776 mSolverCounterUnsat, 1056 mSDtfsCounter, 4890 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1436 GetRequests, 1223 SyntacticMatches, 2 SemanticMatches, 211 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2934 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=8, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 290 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 55.5s InterpolantComputationTime, 2179 NumberOfCodeBlocks, 2179 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1616 ConstructedInterpolants, 4 QuantifiedInterpolants, 10840 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1790 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 8610/9120 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-11 11:06:44,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:06:46,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:06:46,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:06:46,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:06:46,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:06:47,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:06:47,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:06:47,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:06:47,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:06:47,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:06:47,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:06:47,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:06:47,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:06:47,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:06:47,008 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:06:47,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:06:47,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:06:47,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:06:47,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:06:47,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:06:47,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:06:47,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:06:47,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:06:47,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:06:47,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:06:47,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:06:47,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:06:47,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:06:47,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:06:47,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:06:47,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:06:47,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:06:47,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:06:47,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:06:47,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:47,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:06:47,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:06:47,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:06:47,020 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:06:47,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:06:47,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:06:47,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:06:47,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:06:47,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:06:47,022 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:06:47,022 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-clean/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-clean/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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2024-10-11 11:06:47,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:06:47,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:06:47,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:06:47,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:06:47,395 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:06:47,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-10-11 11:06:48,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:06:49,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:06:49,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-10-11 11:06:49,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1220b785/6bf39b8d78c844ff96a862a413298ad7/FLAG198e8e043 [2024-10-11 11:06:49,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1220b785/6bf39b8d78c844ff96a862a413298ad7 [2024-10-11 11:06:49,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:06:49,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:06:49,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:49,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:06:49,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:06:49,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb77de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49, skipping insertion in model container [2024-10-11 11:06:49,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:06:49,452 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-37.i[916,929] [2024-10-11 11:06:49,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:49,595 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:06:49,608 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-37.i[916,929] [2024-10-11 11:06:49,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:49,690 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:06:49,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49 WrapperNode [2024-10-11 11:06:49,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:49,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:49,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:06:49,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:06:49,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,760 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 11:06:49,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:49,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:06:49,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:06:49,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:06:49,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,806 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-11 11:06:49,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:06:49,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:06:49,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:06:49,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:06:49,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:49" (1/1) ... [2024-10-11 11:06:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:49,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:06:49,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:06:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:06:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:06:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:06:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:06:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:06:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:06:50,002 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:06:50,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation