./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-10_file-19.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-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:02:24,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:02:24,905 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:02:24,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:02:24,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:02:24,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:02:24,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:02:24,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:02:24,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:02:24,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:02:24,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:02:24,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:02:24,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:02:24,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:02:24,946 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:02:24,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:02:24,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:02:24,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:02:24,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:02:24,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:02:24,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:02:24,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:02:24,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:02:24,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:02:24,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:02:24,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:02:24,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:02:24,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:02:24,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:02:24,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:02:24,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:02:24,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:02:24,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:02:24,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:02:24,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:02:24,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:02:24,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:02:24,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:02:24,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:02:24,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:02:24,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:02:24,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:02:24,955 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-10-11 08:02:25,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:02:25,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:02:25,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:02:25,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:02:25,243 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:02:25,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:26,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:02:26,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:02:26,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:26,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ea803203/2d9feb3330c1485a95b331ecd61d6718/FLAG9d26458a9 [2024-10-11 08:02:26,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ea803203/2d9feb3330c1485a95b331ecd61d6718 [2024-10-11 08:02:26,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:02:26,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:02:26,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:02:26,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:02:26,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:02:26,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:02:26" (1/1) ... [2024-10-11 08:02:26,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a53f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:26, skipping insertion in model container [2024-10-11 08:02:26,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:02:26" (1/1) ... [2024-10-11 08:02:26,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:02:27,122 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-10_file-19.i[915,928] [2024-10-11 08:02:27,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:02:27,241 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:02:27,253 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-10_file-19.i[915,928] [2024-10-11 08:02:27,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:02:27,317 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:02:27,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27 WrapperNode [2024-10-11 08:02:27,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:02:27,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:02:27,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:02:27,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:02:27,326 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:02:27" (1/1) ... [2024-10-11 08:02:27,345 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:02:27" (1/1) ... [2024-10-11 08:02:27,406 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-10-11 08:02:27,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:02:27,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:02:27,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:02:27,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:02:27,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,446 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:02:27,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:02:27,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:02:27,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:02:27,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:02:27,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (1/1) ... [2024-10-11 08:02:27,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:02:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:02:27,521 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:02:27,528 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:02:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:02:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:02:27,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:02:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:02:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:02:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:02:27,680 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:02:27,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:02:28,097 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 08:02:28,098 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:02:28,151 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:02:28,152 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:02:28,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:02:28 BoogieIcfgContainer [2024-10-11 08:02:28,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:02:28,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:02:28,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:02:28,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:02:28,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:02:26" (1/3) ... [2024-10-11 08:02:28,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea5a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:02:28, skipping insertion in model container [2024-10-11 08:02:28,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:27" (2/3) ... [2024-10-11 08:02:28,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea5a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:02:28, skipping insertion in model container [2024-10-11 08:02:28,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:02:28" (3/3) ... [2024-10-11 08:02:28,162 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:28,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:02:28,178 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:02:28,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:02:28,253 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;@25d208d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:02:28,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:02:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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:02:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:28,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:28,272 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] [2024-10-11 08:02:28,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1722666839, now seen corresponding path program 1 times [2024-10-11 08:02:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:02:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356882115] [2024-10-11 08:02:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:02:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:02:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:02:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:02:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:02:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:02:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:02:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:02:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:02:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:02:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:02:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:02:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:02:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:02:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:02:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:02:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:02:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:02:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:02:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:02:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:02:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:02:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:02:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:02:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:02:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:02:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:02:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:02:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:28,790 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:02:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:02:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356882115] [2024-10-11 08:02:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356882115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:02:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:02:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:02:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976756350] [2024-10-11 08:02:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:02:28,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:02:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:02:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:02:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:02:28,829 INFO L87 Difference]: Start difference. First operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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:02:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:02:28,876 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2024-10-11 08:02:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:02:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 167 [2024-10-11 08:02:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:02:28,888 INFO L225 Difference]: With dead ends: 135 [2024-10-11 08:02:28,888 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 08:02:28,893 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:02:28,898 INFO L432 NwaCegarLoop]: 101 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, 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, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:02:28,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:02:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 08:02:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 08:02:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 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:02:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-11 08:02:28,948 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 167 [2024-10-11 08:02:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:02:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-11 08:02:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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:02:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-11 08:02:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:28,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:28,956 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] [2024-10-11 08:02:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:02:28,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1660213023, now seen corresponding path program 1 times [2024-10-11 08:02:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:02:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973080516] [2024-10-11 08:02:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:02:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:02:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:02:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:02:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:02:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:02:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:02:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:02:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:02:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:02:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:02:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:02:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:02:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:02:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:02:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:02:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:02:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:02:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:02:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:02:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:02:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:02:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:02:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:02:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:02:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:02:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:02:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:02:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:29,625 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:02:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:02:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973080516] [2024-10-11 08:02:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973080516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:02:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:02:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:02:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615984919] [2024-10-11 08:02:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:02:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:02:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:02:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:02:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:02:29,633 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:02:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:02:29,861 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-11 08:02:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:02:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 167 [2024-10-11 08:02:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:02:29,865 INFO L225 Difference]: With dead ends: 213 [2024-10-11 08:02:29,866 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 08:02:29,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:02:29,868 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 76 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:02:29,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 313 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:02:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 08:02:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-10-11 08:02:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 74 states have internal predecessors, (96), 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:02:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 204 transitions. [2024-10-11 08:02:29,908 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 204 transitions. Word has length 167 [2024-10-11 08:02:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:02:29,909 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 204 transitions. [2024-10-11 08:02:29,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:02:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 204 transitions. [2024-10-11 08:02:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:29,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:29,913 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] [2024-10-11 08:02:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:02:29,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1073407009, now seen corresponding path program 1 times [2024-10-11 08:02:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:02:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540500464] [2024-10-11 08:02:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:02:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:02:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:02:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:02:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:02:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:02:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:02:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:02:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:02:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:02:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:02:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:02:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:02:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:02:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:02:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:02:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:02:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:02:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:02:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:02:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:02:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:02:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:02:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:02:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:02:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:02:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:02:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:30,260 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:02:30,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:02:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540500464] [2024-10-11 08:02:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540500464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:02:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:02:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:02:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840872853] [2024-10-11 08:02:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:02:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:02:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:02:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:02:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:02:30,265 INFO L87 Difference]: Start difference. First operand 131 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:02:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:02:30,311 INFO L93 Difference]: Finished difference Result 327 states and 510 transitions. [2024-10-11 08:02:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:02:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 167 [2024-10-11 08:02:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:02:30,315 INFO L225 Difference]: With dead ends: 327 [2024-10-11 08:02:30,315 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 08:02:30,316 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:02:30,317 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:02:30,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:02:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 08:02:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-10-11 08:02:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 08:02:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-10-11 08:02:30,369 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 167 [2024-10-11 08:02:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:02:30,371 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-10-11 08:02:30,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:02:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-10-11 08:02:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:30,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:30,377 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] [2024-10-11 08:02:30,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:02:30,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:30,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1331572447, now seen corresponding path program 1 times [2024-10-11 08:02:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:02:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129094654] [2024-10-11 08:02:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:02:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:02:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:02:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:02:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:02:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:02:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:02:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:02:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:02:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:02:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:02:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:02:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:02:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:02:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:02:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:02:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:02:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:02:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:02:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:02:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:02:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:02:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:02:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:02:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:02:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:02:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:02:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:02:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,144 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:02:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:02:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129094654] [2024-10-11 08:02:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129094654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:02:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879781057] [2024-10-11 08:02:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:02:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:02:31,149 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:02:31,150 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:02:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:31,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 08:02:31,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:02:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 468 proven. 294 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-11 08:02:33,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:02:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 24 proven. 270 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-10-11 08:02:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879781057] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:02:34,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:02:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 16] total 33 [2024-10-11 08:02:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662287086] [2024-10-11 08:02:34,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:02:34,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 08:02:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:02:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 08:02:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 08:02:34,657 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) [2024-10-11 08:02:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:02:37,330 INFO L93 Difference]: Finished difference Result 641 states and 878 transitions. [2024-10-11 08:02:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 08:02:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) Word has length 167 [2024-10-11 08:02:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:02:37,335 INFO L225 Difference]: With dead ends: 641 [2024-10-11 08:02:37,335 INFO L226 Difference]: Without dead ends: 447 [2024-10-11 08:02:37,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1738, Invalid=5918, Unknown=0, NotChecked=0, Total=7656 [2024-10-11 08:02:37,340 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 225 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:02:37,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 397 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 08:02:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-11 08:02:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 361. [2024-10-11 08:02:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 230 states have (on average 1.1782608695652175) internal successors, (271), 232 states have internal predecessors, (271), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (101), 99 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-11 08:02:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 473 transitions. [2024-10-11 08:02:37,405 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 473 transitions. Word has length 167 [2024-10-11 08:02:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:02:37,406 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 473 transitions. [2024-10-11 08:02:37,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) [2024-10-11 08:02:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 473 transitions. [2024-10-11 08:02:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:37,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:37,409 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] [2024-10-11 08:02:37,427 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:02:37,609 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:02:37,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:37,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash -386176613, now seen corresponding path program 1 times [2024-10-11 08:02:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:02:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103684466] [2024-10-11 08:02:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:02:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:02:37,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:02:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:02:37,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:02:37,885 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:02:37,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:02:37,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:02:37,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 08:02:38,012 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:02:38,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:02:38 BoogieIcfgContainer [2024-10-11 08:02:38,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:02:38,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:02:38,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:02:38,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:02:38,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:02:28" (3/4) ... [2024-10-11 08:02:38,020 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:02:38,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:02:38,021 INFO L158 Benchmark]: Toolchain (without parser) took 11101.98ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 146.8MB in the beginning and 182.0MB in the end (delta: -35.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,021 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:02:38,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.76ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 129.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.42ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 123.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,024 INFO L158 Benchmark]: Boogie Preprocessor took 77.54ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 112.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,024 INFO L158 Benchmark]: RCFGBuilder took 667.22ms. Allocated memory is still 178.3MB. Free memory was 111.2MB in the beginning and 122.3MB in the end (delta: -11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,024 INFO L158 Benchmark]: TraceAbstraction took 9860.29ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 121.3MB in the beginning and 182.0MB in the end (delta: -60.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-10-11 08:02:38,024 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 260.0MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:02:38,026 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.16ms. Allocated memory is still 115.3MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.76ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 129.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.42ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 123.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.54ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 112.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 667.22ms. Allocated memory is still 178.3MB. Free memory was 111.2MB in the beginning and 122.3MB in the end (delta: -11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9860.29ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 121.3MB in the beginning and 182.0MB in the end (delta: -60.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 260.0MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someUnaryFLOAToperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] double var_1_31 = 0.0; [L45] unsigned char var_1_32 = 8; [L46] unsigned char var_1_33 = 100; [L47] double var_1_34 = 0.19999999999999996; [L48] signed char var_1_35 = -32; [L49] signed char var_1_36 = -1; [L50] signed char var_1_37 = -8; [L51] unsigned char last_1_var_1_15 = 0; [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L147] last_1_var_1_15 = var_1_15 [L157] RET updateLastVariables() [L158] CALL updateVariables() [L102] var_1_2 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L103] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L105] var_1_3 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L106] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L109] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L111] var_1_8 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L112] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L115] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L117] var_1_12 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L118] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L119] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L119] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L122] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L122] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L123] var_1_21 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L124] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L125] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L125] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L126] var_1_23 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L127] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L128] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L128] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L129] var_1_25 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L130] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L131] var_1_26 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L132] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L134] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L135] var_1_28 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L136] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L137] var_1_31 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L138] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L139] var_1_33 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L140] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L141] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L141] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L142] var_1_37 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L143] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L144] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L144] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L158] RET updateVariables() [L159] CALL step() [L55] var_1_30 = ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) [L56] var_1_32 = var_1_33 [L57] var_1_34 = var_1_31 [L58] var_1_35 = -1 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L59] COND FALSE !(var_1_31 <= var_1_34) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L64] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L67] COND FALSE !(\read(var_1_10)) [L70] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L72] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L73] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L75] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L82] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L84] COND TRUE var_1_24 != var_1_24 [L85] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L87] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=127, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L88] COND TRUE stepLocal_1 >= var_1_29 [L89] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L91] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L94] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L95] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L96] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 626 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 380 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=4, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 6246 SizeOfPredicates, 11 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7815/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:02:38,061 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-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:02:40,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:02:40,387 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:02:40,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:02:40,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:02:40,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:02:40,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:02:40,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:02:40,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:02:40,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:02:40,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:02:40,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:02:40,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:02:40,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:02:40,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:02:40,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:02:40,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:02:40,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:02:40,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:02:40,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:02:40,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:02:40,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:02:40,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:02:40,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:02:40,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:02:40,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:02:40,440 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:02:40,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:02:40,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:02:40,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:02:40,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:02:40,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:02:40,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:02:40,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:02:40,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:02:40,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:02:40,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:02:40,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:02:40,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:02:40,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:02:40,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:02:40,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:02:40,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:02:40,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:02:40,452 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:02:40,452 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-10-11 08:02:40,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:02:40,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:02:40,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:02:40,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:02:40,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:02:40,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:42,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:02:42,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:02:42,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:42,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6815e25a1/310aeef6d403491a9c093e3de2e1d4b2/FLAGcfaf651db [2024-10-11 08:02:42,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6815e25a1/310aeef6d403491a9c093e3de2e1d4b2 [2024-10-11 08:02:42,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:02:42,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:02:42,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:02:42,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:02:42,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:02:42,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:02:42" (1/1) ... [2024-10-11 08:02:42,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cb4935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:42, skipping insertion in model container [2024-10-11 08:02:42,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:02:42" (1/1) ... [2024-10-11 08:02:42,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:02:42,940 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-10_file-19.i[915,928] [2024-10-11 08:02:43,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:02:43,045 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:02:43,058 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-10_file-19.i[915,928] [2024-10-11 08:02:43,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:02:43,138 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:02:43,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43 WrapperNode [2024-10-11 08:02:43,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:02:43,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:02:43,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:02:43,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:02:43,146 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:02:43" (1/1) ... [2024-10-11 08:02:43,165 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:02:43" (1/1) ... [2024-10-11 08:02:43,202 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-11 08:02:43,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:02:43,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:02:43,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:02:43,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:02:43,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,236 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:02:43,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:02:43,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:02:43,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:02:43,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:02:43,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (1/1) ... [2024-10-11 08:02:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:02:43,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:02:43,317 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:02:43,321 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:02:43,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:02:43,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:02:43,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:02:43,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:02:43,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:02:43,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:02:43,448 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:02:43,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:02:57,534 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 08:02:57,534 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:02:57,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:02:57,598 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:02:57,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:02:57 BoogieIcfgContainer [2024-10-11 08:02:57,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:02:57,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:02:57,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:02:57,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:02:57,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:02:42" (1/3) ... [2024-10-11 08:02:57,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ddb446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:02:57, skipping insertion in model container [2024-10-11 08:02:57,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:02:43" (2/3) ... [2024-10-11 08:02:57,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ddb446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:02:57, skipping insertion in model container [2024-10-11 08:02:57,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:02:57" (3/3) ... [2024-10-11 08:02:57,608 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-11 08:02:57,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:02:57,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:02:57,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:02:57,696 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;@22984ca3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:02:57,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:02:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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:02:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:02:57,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:02:57,723 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] [2024-10-11 08:02:57,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:02:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:02:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1722666839, now seen corresponding path program 1 times [2024-10-11 08:02:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:02:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954804792] [2024-10-11 08:02:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:02:57,748 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:02:57,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:02:57,751 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:02:57,753 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:02:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:02:58,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:02:58,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:02:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-10-11 08:02:58,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:02:58,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:02:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954804792] [2024-10-11 08:02:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954804792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:02:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:02:58,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:02:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255511072] [2024-10-11 08:02:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:02:58,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:02:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:02:58,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:02:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:02:58,723 INFO L87 Difference]: Start difference. First operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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:03:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:03,183 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2024-10-11 08:03:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:03:03,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 167 [2024-10-11 08:03:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:03,339 INFO L225 Difference]: With dead ends: 135 [2024-10-11 08:03:03,339 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 08:03:03,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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:03:03,346 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:03,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 08:03:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 08:03:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 08:03:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 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:03:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-11 08:03:03,390 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 167 [2024-10-11 08:03:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:03,391 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-11 08:03:03,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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:03:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-11 08:03:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:03:03,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:03,395 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] [2024-10-11 08:03:03,422 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:03:03,595 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:03:03,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1660213023, now seen corresponding path program 1 times [2024-10-11 08:03:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80277235] [2024-10-11 08:03:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:03,599 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:03:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:03,602 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:03:03,604 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:03:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:04,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:03:04,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:10,940 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:03:10,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:03:10,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80277235] [2024-10-11 08:03:10,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80277235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:10,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:03:10,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:03:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490279715] [2024-10-11 08:03:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:03:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:03:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:03:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:03:10,948 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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:03:15,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:19,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:23,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:28,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:32,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:36,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:40,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:44,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:03:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:03:44,553 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2024-10-11 08:03:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:03:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 167 [2024-10-11 08:03:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:03:44,713 INFO L225 Difference]: With dead ends: 223 [2024-10-11 08:03:44,713 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 08:03:44,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:03:44,717 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:03:44,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 323 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 33.4s Time] [2024-10-11 08:03:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 08:03:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2024-10-11 08:03:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 74 states have internal predecessors, (96), 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:03:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 204 transitions. [2024-10-11 08:03:44,761 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 204 transitions. Word has length 167 [2024-10-11 08:03:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:03:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 204 transitions. [2024-10-11 08:03:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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:03:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 204 transitions. [2024-10-11 08:03:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:03:44,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:03:44,765 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] [2024-10-11 08:03:44,794 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 08:03:44,966 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 [2024-10-11 08:03:44,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:03:44,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:03:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1073407009, now seen corresponding path program 1 times [2024-10-11 08:03:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:03:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484224823] [2024-10-11 08:03:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:03:44,969 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:03:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:03:44,973 INFO L229 MonitoredProcess]: Starting monitored process 4 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:03:44,974 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 (4)] Waiting until timeout for monitored process [2024-10-11 08:03:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:03:45,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:03:45,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:03:51,713 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:03:51,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:03:51,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:03:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484224823] [2024-10-11 08:03:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484224823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:03:51,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:03:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:03:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375510036] [2024-10-11 08:03:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:03:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:03:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:03:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:03:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:03:51,717 INFO L87 Difference]: Start difference. First operand 131 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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)