./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_fillercode_fillercodesize_ps-cn-25_file-70.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_fillercode_fillercodesize_ps-cn-25_file-70.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 e51b45edcf8f68c10b32ce16709cfc1efc4cc1c7ec847560d5401a660e4d2eca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:29:10,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:29:11,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:29:11,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:29:11,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:29:11,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:29:11,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:29:11,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:29:11,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:29:11,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:29:11,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:29:11,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:29:11,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:29:11,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:29:11,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:29:11,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:29:11,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:29:11,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:29:11,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:29:11,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:29:11,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:29:11,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:29:11,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:29:11,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:29:11,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:29:11,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:29:11,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:29:11,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:29:11,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:29:11,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:29:11,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:29:11,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:29:11,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:11,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:29:11,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:29:11,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:29:11,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:29:11,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:29:11,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:29:11,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:29:11,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:29:11,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:29:11,050 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 -> e51b45edcf8f68c10b32ce16709cfc1efc4cc1c7ec847560d5401a660e4d2eca [2024-10-11 08:29:11,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:29:11,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:29:11,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:29:11,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:29:11,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:29:11,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:12,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:29:13,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:29:13,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:13,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/079b8d1a9/61de6e40238b460d9b4df5c191d6c2b0/FLAG85fcc83b3 [2024-10-11 08:29:13,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/079b8d1a9/61de6e40238b460d9b4df5c191d6c2b0 [2024-10-11 08:29:13,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:29:13,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:29:13,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:13,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:29:13,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:29:13,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:13,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d1f278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13, skipping insertion in model container [2024-10-11 08:29:13,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:13,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:29:13,728 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_fillercode_fillercodesize_ps-cn-25_file-70.i[915,928] [2024-10-11 08:29:13,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:13,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:29:13,859 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_fillercode_fillercodesize_ps-cn-25_file-70.i[915,928] [2024-10-11 08:29:13,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:13,972 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:29:13,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13 WrapperNode [2024-10-11 08:29:13,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:13,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:13,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:29:13,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:29:13,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,051 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-10-11 08:29:14,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:14,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:29:14,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:29:14,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:29:14,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,091 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 08:29:14,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:29:14,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:29:14,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:29:14,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:29:14,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (1/1) ... [2024-10-11 08:29:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:14,163 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 08:29:14,169 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 08:29:14,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:29:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:29:14,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:29:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:29:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:29:14,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:29:14,330 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:29:14,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:29:14,819 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:29:14,820 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:29:14,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:29:14,894 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:29:14,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:14 BoogieIcfgContainer [2024-10-11 08:29:14,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:29:14,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:29:14,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:29:14,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:29:14,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:29:13" (1/3) ... [2024-10-11 08:29:14,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d97caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:14, skipping insertion in model container [2024-10-11 08:29:14,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:13" (2/3) ... [2024-10-11 08:29:14,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d97caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:14, skipping insertion in model container [2024-10-11 08:29:14,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:14" (3/3) ... [2024-10-11 08:29:14,909 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:14,928 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:29:14,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:29:15,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:29:15,023 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;@23082d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:29:15,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:29:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 08:29:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:29:15,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:15,051 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:15,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -575630186, now seen corresponding path program 1 times [2024-10-11 08:29:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200390404] [2024-10-11 08:29:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:29:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:29:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:29:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:29:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:29:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:29:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:29:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:29:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:29:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:29:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:29:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:29:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:29:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:29:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:29:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:29:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:29:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:29:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:29:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:29:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:29:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:29:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:29:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:29:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 08:29:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200390404] [2024-10-11 08:29:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200390404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:15,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:29:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486477608] [2024-10-11 08:29:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:29:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:29:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:29:15,664 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:29:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:15,730 INFO L93 Difference]: Finished difference Result 144 states and 259 transitions. [2024-10-11 08:29:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:29:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 169 [2024-10-11 08:29:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:15,744 INFO L225 Difference]: With dead ends: 144 [2024-10-11 08:29:15,744 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 08:29:15,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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 08:29:15,785 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:15,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:29:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 08:29:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 08:29:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 08:29:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-11 08:29:15,909 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 169 [2024-10-11 08:29:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:15,910 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-11 08:29:15,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:29:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-11 08:29:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:29:15,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:15,915 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:15,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:29:15,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:15,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash 970725336, now seen corresponding path program 1 times [2024-10-11 08:29:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884724836] [2024-10-11 08:29:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:29:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:29:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:29:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:29:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:29:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:29:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:29:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:29:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:29:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:29:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:29:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:29:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:29:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:29:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:29:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:29:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:29:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:29:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:29:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:29:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:29:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:29:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:29:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 08:29:16,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:16,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884724836] [2024-10-11 08:29:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884724836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:29:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693667400] [2024-10-11 08:29:16,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:29:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:29:16,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:29:16,832 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 08:29:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:16,918 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2024-10-11 08:29:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:29:16,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2024-10-11 08:29:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:16,926 INFO L225 Difference]: With dead ends: 211 [2024-10-11 08:29:16,926 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 08:29:16,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 08:29:16,928 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:16,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:29:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 08:29:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-10-11 08:29:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 08:29:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-10-11 08:29:16,982 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 169 [2024-10-11 08:29:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:16,983 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-10-11 08:29:16,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 08:29:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-10-11 08:29:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:29:16,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:16,989 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:29:16,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:16,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 970784918, now seen corresponding path program 1 times [2024-10-11 08:29:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063838827] [2024-10-11 08:29:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:29:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:29:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:29:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:29:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:29:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:29:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:29:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:29:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:29:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:29:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:29:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:29:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:29:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:29:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:29:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:29:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:29:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:29:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:29:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:29:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:29:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:29:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:29:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:29:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 08:29:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:17,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063838827] [2024-10-11 08:29:17,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063838827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:17,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:29:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269038127] [2024-10-11 08:29:17,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:17,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:29:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:29:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:29:17,485 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 08:29:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:17,575 INFO L93 Difference]: Finished difference Result 415 states and 637 transitions. [2024-10-11 08:29:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:29:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2024-10-11 08:29:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:17,580 INFO L225 Difference]: With dead ends: 415 [2024-10-11 08:29:17,581 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 08:29:17,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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 08:29:17,583 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:17,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:29:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 08:29:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-10-11 08:29:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 162 states have (on average 1.271604938271605) internal successors, (206), 162 states have internal predecessors, (206), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-11 08:29:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 422 transitions. [2024-10-11 08:29:17,649 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 422 transitions. Word has length 169 [2024-10-11 08:29:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 422 transitions. [2024-10-11 08:29:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 08:29:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 422 transitions. [2024-10-11 08:29:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:29:17,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:17,654 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:29:17,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1991853272, now seen corresponding path program 1 times [2024-10-11 08:29:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406388738] [2024-10-11 08:29:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:29:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:29:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 08:29:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:29:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:29:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:29:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:29:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:29:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:29:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:29:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:29:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:29:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:29:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:29:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:29:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:29:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:29:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:29:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:29:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:29:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:29:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:29:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:29:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:29:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-11 08:29:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406388738] [2024-10-11 08:29:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406388738] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:29:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130865354] [2024-10-11 08:29:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:18,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:18,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:18,970 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 08:29:18,972 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 08:29:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:19,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 08:29:19,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:29:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 725 proven. 84 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-10-11 08:29:21,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:29:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 66 proven. 87 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-10-11 08:29:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130865354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:29:23,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:29:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 27 [2024-10-11 08:29:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041486691] [2024-10-11 08:29:23,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:29:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 08:29:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:23,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 08:29:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-11 08:29:23,143 INFO L87 Difference]: Start difference. First operand 275 states and 422 transitions. Second operand has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2024-10-11 08:29:28,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 08:29:33,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 08:29:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:37,615 INFO L93 Difference]: Finished difference Result 1356 states and 1979 transitions. [2024-10-11 08:29:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-11 08:29:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) Word has length 169 [2024-10-11 08:29:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:37,625 INFO L225 Difference]: With dead ends: 1356 [2024-10-11 08:29:37,625 INFO L226 Difference]: Without dead ends: 1082 [2024-10-11 08:29:37,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2010, Invalid=7890, Unknown=0, NotChecked=0, Total=9900 [2024-10-11 08:29:37,630 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1090 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 1146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1146 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:37,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1017 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1146 Valid, 1536 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-10-11 08:29:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-10-11 08:29:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 608. [2024-10-11 08:29:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 376 states have (on average 1.2579787234042554) internal successors, (473), 378 states have internal predecessors, (473), 213 states have call successors, (213), 18 states have call predecessors, (213), 18 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 08:29:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 899 transitions. [2024-10-11 08:29:37,813 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 899 transitions. Word has length 169 [2024-10-11 08:29:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:37,815 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 899 transitions. [2024-10-11 08:29:37,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2024-10-11 08:29:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 899 transitions. [2024-10-11 08:29:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:29:37,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:37,821 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:37,838 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 08:29:38,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:38,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:38,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2047204950, now seen corresponding path program 1 times [2024-10-11 08:29:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781833832] [2024-10-11 08:29:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:29:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297827854] [2024-10-11 08:29:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:38,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:38,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:38,240 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 08:29:38,241 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 08:29:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:29:38,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:29:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:29:38,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:29:38,813 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:29:38,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:29:38,836 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 08:29:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:39,025 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 08:29:39,163 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:29:39,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:29:39 BoogieIcfgContainer [2024-10-11 08:29:39,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:29:39,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:29:39,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:29:39,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:29:39,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:14" (3/4) ... [2024-10-11 08:29:39,170 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:29:39,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:29:39,172 INFO L158 Benchmark]: Toolchain (without parser) took 25696.35ms. Allocated memory was 134.2MB in the beginning and 390.1MB in the end (delta: 255.9MB). Free memory was 63.4MB in the beginning and 272.1MB in the end (delta: -208.8MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,172 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 134.2MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:29:39,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.81ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 63.4MB in the beginning and 172.2MB in the end (delta: -108.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.16ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 167.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,173 INFO L158 Benchmark]: Boogie Preprocessor took 69.57ms. Allocated memory is still 203.4MB. Free memory was 167.0MB in the beginning and 161.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,174 INFO L158 Benchmark]: RCFGBuilder took 773.32ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 130.3MB in the end (delta: 31.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,174 INFO L158 Benchmark]: TraceAbstraction took 24267.50ms. Allocated memory was 203.4MB in the beginning and 390.1MB in the end (delta: 186.6MB). Free memory was 129.3MB in the beginning and 272.1MB in the end (delta: -142.9MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-10-11 08:29:39,174 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 390.1MB. Free memory is still 272.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:29:39,176 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.23ms. Allocated memory is still 134.2MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.81ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 63.4MB in the beginning and 172.2MB in the end (delta: -108.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.16ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 167.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.57ms. Allocated memory is still 203.4MB. Free memory was 167.0MB in the beginning and 161.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 773.32ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 130.3MB in the end (delta: 31.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24267.50ms. Allocated memory was 203.4MB in the beginning and 390.1MB in the end (delta: 186.6MB). Free memory was 129.3MB in the beginning and 272.1MB in the end (delta: -142.9MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 390.1MB. Free memory is still 272.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someUnaryDOUBLEoperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned short int var_1_22 = 5; [L39] unsigned short int var_1_23 = 8; [L40] signed long int var_1_24 = 0; [L41] unsigned short int var_1_25 = 5; [L42] unsigned short int var_1_26 = 1; [L43] unsigned long int var_1_27 = 16; [L44] unsigned short int var_1_30 = 50; [L45] signed long int var_1_31 = 1000; [L46] float var_1_32 = 32.5; [L47] double var_1_33 = 9999999999.2; [L48] double var_1_34 = 5.5; [L49] double var_1_35 = 4.25; [L50] signed long int var_1_36 = 2; [L51] double last_1_var_1_1 = 5.05; [L52] unsigned short int last_1_var_1_9 = 1; [L53] unsigned long int last_1_var_1_11 = 8; [L54] unsigned char last_1_var_1_14 = 32; [L55] unsigned char last_1_var_1_20 = 0; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L154] last_1_var_1_1 = var_1_1 [L155] last_1_var_1_9 = var_1_9 [L156] last_1_var_1_11 = var_1_11 [L157] last_1_var_1_14 = var_1_14 [L158] last_1_var_1_20 = var_1_20 [L168] RET updateLastVariables() [L169] CALL updateVariables() [L109] var_1_6 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L110] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L111] var_1_7 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_8=67/4, var_1_9=1] [L112] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_8=67/4, var_1_9=1] [L113] var_1_8 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L114] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L116] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L117] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L118] var_1_15 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L119] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L120] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L120] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L121] var_1_16 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L123] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L123] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L124] var_1_17 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L125] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L126] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L127] var_1_19 = __VERIFIER_nondet_ulong() [L128] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L128] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L129] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_22=5, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L130] var_1_22 = __VERIFIER_nondet_ushort() [L131] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L131] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_22 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L132] RET assume_abort_if_not(var_1_22 <= 65535) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_23=8, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L133] var_1_23 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L134] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L135] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=0, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L136] var_1_24 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_24 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L137] RET assume_abort_if_not(var_1_24 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L138] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=5, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L139] var_1_25 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=1, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L142] var_1_26 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L144] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=50, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L145] var_1_30 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L146] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_30 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L147] RET assume_abort_if_not(var_1_30 <= 65535) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_34=11/2, var_1_35=17/4, var_1_36=2, var_1_9=1] [L148] var_1_34 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_35=17/4, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_35=17/4, var_1_36=2, var_1_9=1] [L149] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_35=17/4, var_1_36=2, var_1_9=1] [L150] var_1_35 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L151] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L169] RET updateVariables() [L170] CALL step() [L59] COND TRUE ((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23))) > var_1_24 [L60] var_1_21 = (((((10 + var_1_25)) < (var_1_26)) ? ((10 + var_1_25)) : (var_1_26))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L62] COND FALSE !(var_1_25 < (- var_1_23)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_31=1000, var_1_32=65/2, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L67] var_1_31 = var_1_30 [L68] var_1_32 = 256.25f VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=49999999996/5, var_1_36=2, var_1_9=1] [L69] COND TRUE ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) <= var_1_30 [L70] var_1_33 = ((((((((5.8) > (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34))))) ? (5.8) : (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34))))))) > (var_1_35)) ? (((((5.8) > (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34))))) ? (5.8) : (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34))))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=2, var_1_9=1] [L72] EXPR var_1_21 | 100 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=2, var_1_9=1] [L72] COND TRUE var_1_23 > (var_1_24 + (var_1_21 | 100)) [L73] var_1_36 = var_1_25 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_9=1] [L75] COND TRUE \read(var_1_13) [L76] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_9=1] [L80] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_9=1] [L89] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L90] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_9=1] [L94] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=101/20, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_9=1] [L95] COND FALSE !(var_1_18 >= stepLocal_0) [L98] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_7=2, var_1_9=1] [L100] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L101] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=2, var_1_20=1, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_7=2, var_1_9=1] [L103] COND TRUE \read(var_1_20) [L104] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=2, var_1_20=1, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_7=2, var_1_9=1] [L106] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=2, var_1_20=1, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=21474836469, var_1_19=21474836478, var_1_1=2, var_1_20=1, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=-101, var_1_25=0, var_1_26=0, var_1_27=16, var_1_30=0, var_1_31=0, var_1_32=1025/4, var_1_33=29/5, var_1_34=0, var_1_35=0, var_1_36=0, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1198 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1196 mSDsluCounter, 1554 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1091 mSDsCounter, 1146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1146 mSolverCounterUnsat, 463 mSDtfsCounter, 1560 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=4, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 478 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1183 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 7824 SizeOfPredicates, 7 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8208/8424 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 08:29:39,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercode_fillercodesize_ps-cn-25_file-70.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 e51b45edcf8f68c10b32ce16709cfc1efc4cc1c7ec847560d5401a660e4d2eca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:29:41,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:29:41,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:29:41,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:29:41,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:29:41,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:29:41,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:29:41,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:29:41,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:29:41,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:29:41,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:29:41,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:29:41,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:29:41,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:29:41,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:29:41,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:29:41,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:29:41,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:29:41,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:29:41,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:29:41,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:29:41,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:29:41,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:29:41,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:29:41,651 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:29:41,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:29:41,651 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:29:41,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:29:41,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:29:41,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:29:41,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:29:41,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:29:41,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:29:41,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:29:41,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:41,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:29:41,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:29:41,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:29:41,656 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:29:41,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:29:41,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:29:41,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:29:41,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:29:41,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:29:41,658 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:29:41,658 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 -> e51b45edcf8f68c10b32ce16709cfc1efc4cc1c7ec847560d5401a660e4d2eca [2024-10-11 08:29:42,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:29:42,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:29:42,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:29:42,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:29:42,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:29:42,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:43,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:29:43,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:29:43,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:43,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc3ea8cc7/d7e1531202a54f2b87a153a528f4eda8/FLAG902c1c0eb [2024-10-11 08:29:44,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc3ea8cc7/d7e1531202a54f2b87a153a528f4eda8 [2024-10-11 08:29:44,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:29:44,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:29:44,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:44,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:29:44,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:29:44,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afb602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44, skipping insertion in model container [2024-10-11 08:29:44,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:29:44,459 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_fillercode_fillercodesize_ps-cn-25_file-70.i[915,928] [2024-10-11 08:29:44,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:44,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:29:44,582 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_fillercode_fillercodesize_ps-cn-25_file-70.i[915,928] [2024-10-11 08:29:44,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:44,660 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:29:44,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44 WrapperNode [2024-10-11 08:29:44,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:44,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:44,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:29:44,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:29:44,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,732 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 08:29:44,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:44,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:29:44,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:29:44,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:29:44,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,789 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 08:29:44,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:29:44,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:29:44,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:29:44,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:29:44,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (1/1) ... [2024-10-11 08:29:44,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:44,870 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 08:29:44,874 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 08:29:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:29:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:29:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:29:44,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:29:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:29:44,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:29:45,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:29:45,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:29:48,916 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:29:48,917 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:29:49,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:29:49,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:29:49,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:49 BoogieIcfgContainer [2024-10-11 08:29:49,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:29:49,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:29:49,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:29:49,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:29:49,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:29:44" (1/3) ... [2024-10-11 08:29:49,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9ec3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:49, skipping insertion in model container [2024-10-11 08:29:49,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:44" (2/3) ... [2024-10-11 08:29:49,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9ec3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:49, skipping insertion in model container [2024-10-11 08:29:49,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:49" (3/3) ... [2024-10-11 08:29:49,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-70.i [2024-10-11 08:29:49,041 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:29:49,041 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:29:49,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:29:49,135 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;@3860fbfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:29:49,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:29:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 08:29:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:29:49,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:49,160 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:49,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:49,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 651094937, now seen corresponding path program 1 times [2024-10-11 08:29:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:29:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661060638] [2024-10-11 08:29:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:49,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:29:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:29:49,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:29:49,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:29:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:29:49,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:29:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2024-10-11 08:29:49,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:29:49,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:29:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661060638] [2024-10-11 08:29:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661060638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:49,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:29:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407784878] [2024-10-11 08:29:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:49,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:29:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:29:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:29:49,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:29:49,799 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:29:52,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:29:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:52,736 INFO L93 Difference]: Finished difference Result 138 states and 249 transitions. [2024-10-11 08:29:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:29:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 168 [2024-10-11 08:29:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:52,772 INFO L225 Difference]: With dead ends: 138 [2024-10-11 08:29:52,773 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 08:29:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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 08:29:52,778 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:52,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 08:29:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 08:29:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 08:29:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 08:29:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-10-11 08:29:52,825 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 168 [2024-10-11 08:29:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:52,826 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-10-11 08:29:52,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:29:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-10-11 08:29:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:29:52,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:52,830 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:52,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:29:53,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:29:53,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1654327273, now seen corresponding path program 1 times [2024-10-11 08:29:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:29:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330256225] [2024-10-11 08:29:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:53,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:29:53,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:29:53,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:29:53,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:29:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:53,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 08:29:53,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:29:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-11 08:29:59,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:30:00,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:30:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330256225] [2024-10-11 08:30:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330256225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:30:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [402477207] [2024-10-11 08:30:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:00,559 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:30:00,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:30:00,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:30:00,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 08:30:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:01,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 08:30:01,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:30:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-11 08:30:05,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:30:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [402477207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:30:06,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:30:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 08:30:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496206498] [2024-10-11 08:30:06,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:30:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:30:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:30:06,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:30:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:30:06,419 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:30:10,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:12,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:13,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:30:14,734 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2024-10-11 08:30:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 08:30:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 168 [2024-10-11 08:30:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:30:14,740 INFO L225 Difference]: With dead ends: 276 [2024-10-11 08:30:14,740 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 08:30:14,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-11 08:30:14,742 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 228 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:30:14,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 433 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-10-11 08:30:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 08:30:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2024-10-11 08:30:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 08:30:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2024-10-11 08:30:14,795 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 168 [2024-10-11 08:30:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:30:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2024-10-11 08:30:14,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 08:30:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2024-10-11 08:30:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:30:14,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:14,801 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:30:14,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:30:15,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 08:30:15,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:30:15,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1597068971, now seen corresponding path program 1 times [2024-10-11 08:30:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317635721] [2024-10-11 08:30:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:15,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:15,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:30:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:15,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 08:30:15,652 INFO L278 TraceCheckSpWp]: Computing forward predicates...