./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_fillercodestructure_filler-ps-ci_file-5.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_fillercodestructure_filler-ps-ci_file-5.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 bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:02:11,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:02:11,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:02:11,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:02:11,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:02:11,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:02:11,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:02:11,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:02:11,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:02:11,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:02:11,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:02:11,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:02:11,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:02:11,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:02:11,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:02:11,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:02:11,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:02:11,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:02:11,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:02:11,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:02:11,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:02:11,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:02:11,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:02:11,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:02:11,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:02:11,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:02:11,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:02:11,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:02:11,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:02:11,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:02:11,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:02:11,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:02:11,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:02:11,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:02:11,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:02:11,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:02:11,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:02:11,537 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 -> bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 [2024-10-11 10:02:11,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:02:11,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:02:11,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:02:11,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:02:11,828 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:02:11,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:13,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:02:13,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:02:13,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:13,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1946d70eb/99fa2100908a410fac39d15f6c7d0fa3/FLAGf699deb8a [2024-10-11 10:02:13,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1946d70eb/99fa2100908a410fac39d15f6c7d0fa3 [2024-10-11 10:02:13,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:02:13,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:02:13,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:02:13,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:02:13,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:02:13,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55099f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13, skipping insertion in model container [2024-10-11 10:02:13,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:02:13,447 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_fillercodestructure_filler-ps-ci_file-5.i[918,931] [2024-10-11 10:02:13,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:02:13,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:02:13,522 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_fillercodestructure_filler-ps-ci_file-5.i[918,931] [2024-10-11 10:02:13,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:02:13,595 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:02:13,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13 WrapperNode [2024-10-11 10:02:13,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:02:13,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:02:13,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:02:13,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:02:13,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,662 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-11 10:02:13,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:02:13,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:02:13,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:02:13,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:02:13,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,715 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 10:02:13,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:02:13,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:02:13,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:02:13,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:02:13,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (1/1) ... [2024-10-11 10:02:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:02:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:02:13,782 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 10:02:13,784 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 10:02:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:02:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:02:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:02:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:02:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:02:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:02:13,886 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:02:13,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:02:14,268 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:02:14,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:02:14,304 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:02:14,304 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:02:14,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:02:14 BoogieIcfgContainer [2024-10-11 10:02:14,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:02:14,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:02:14,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:02:14,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:02:14,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:02:13" (1/3) ... [2024-10-11 10:02:14,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7a2a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:02:14, skipping insertion in model container [2024-10-11 10:02:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:13" (2/3) ... [2024-10-11 10:02:14,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7a2a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:02:14, skipping insertion in model container [2024-10-11 10:02:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:02:14" (3/3) ... [2024-10-11 10:02:14,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:14,327 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:02:14,327 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:02:14,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:02:14,397 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;@2a49fa78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:02:14,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:02:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:02:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 10:02:14,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:14,417 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:14,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:14,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash 536502740, now seen corresponding path program 1 times [2024-10-11 10:02:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:02:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403529180] [2024-10-11 10:02:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:02:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:02:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:02:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:02:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:02:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:02:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:02:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:02:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:02:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:02:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:02:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:02:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:02:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:02:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:02:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:02:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:02:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:02:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:02:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:02:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:02:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:02:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403529180] [2024-10-11 10:02:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403529180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:02:14,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:02:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:02:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146318902] [2024-10-11 10:02:14,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:02:14,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:02:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:02:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:02:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:02:14,847 INFO L87 Difference]: Start difference. First operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 10:02:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:02:14,930 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2024-10-11 10:02:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:02:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2024-10-11 10:02:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:02:14,939 INFO L225 Difference]: With dead ends: 133 [2024-10-11 10:02:14,939 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 10:02:14,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:02:14,944 INFO L432 NwaCegarLoop]: 99 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, 99 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 10:02:14,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:02:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 10:02:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 10:02:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:02:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-11 10:02:14,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 128 [2024-10-11 10:02:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:02:14,998 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-11 10:02:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 10:02:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-11 10:02:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 10:02:15,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:15,006 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:15,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:02:15,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:15,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1779446838, now seen corresponding path program 1 times [2024-10-11 10:02:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:02:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996328745] [2024-10-11 10:02:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:15,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:02:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:02:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:02:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:02:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:02:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:02:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:02:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:02:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:02:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:02:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:02:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:02:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:02:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:02:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:02:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:02:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:02:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:02:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:02:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:02:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:02:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:02:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996328745] [2024-10-11 10:02:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996328745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:02:15,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:02:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:02:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056674984] [2024-10-11 10:02:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:02:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:02:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:02:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:02:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:02:15,309 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:02:15,374 INFO L93 Difference]: Finished difference Result 177 states and 270 transitions. [2024-10-11 10:02:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:02:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2024-10-11 10:02:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:02:15,377 INFO L225 Difference]: With dead ends: 177 [2024-10-11 10:02:15,377 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 10:02:15,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 10:02:15,381 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:02:15,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:02:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 10:02:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-10-11 10:02:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.364864864864865) internal successors, (101), 75 states have internal predecessors, (101), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:02:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-10-11 10:02:15,411 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 129 [2024-10-11 10:02:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:02:15,415 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-10-11 10:02:15,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-10-11 10:02:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 10:02:15,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:15,417 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:15,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:02:15,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 191098936, now seen corresponding path program 1 times [2024-10-11 10:02:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:02:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605299286] [2024-10-11 10:02:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:02:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:02:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:02:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:02:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:02:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:02:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:02:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:02:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:02:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:02:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:02:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:02:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:02:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:02:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:02:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:02:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:02:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:02:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:02:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:02:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:02:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:02:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605299286] [2024-10-11 10:02:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605299286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:02:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:02:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:02:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645205410] [2024-10-11 10:02:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:02:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:02:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:02:16,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:02:16,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:02:16,699 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:02:17,342 INFO L93 Difference]: Finished difference Result 362 states and 549 transitions. [2024-10-11 10:02:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:02:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2024-10-11 10:02:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:02:17,348 INFO L225 Difference]: With dead ends: 362 [2024-10-11 10:02:17,348 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 10:02:17,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 10:02:17,349 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 239 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:02:17,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 505 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:02:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 10:02:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 171. [2024-10-11 10:02:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 117 states have internal predecessors, (158), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 10:02:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2024-10-11 10:02:17,373 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 129 [2024-10-11 10:02:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:02:17,374 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2024-10-11 10:02:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2024-10-11 10:02:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 10:02:17,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:17,375 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:17,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:02:17,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -626549514, now seen corresponding path program 1 times [2024-10-11 10:02:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:02:17,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406632494] [2024-10-11 10:02:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:02:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:02:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104000653] [2024-10-11 10:02:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:02:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:02:17,483 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 10:02:17,488 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 10:02:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:02:18,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:02:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:02:18,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:02:18,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:02:18,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:02:18,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:02:18,482 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 10:02:18,486 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 10:02:18,578 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:02:18,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:02:18 BoogieIcfgContainer [2024-10-11 10:02:18,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:02:18,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:02:18,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:02:18,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:02:18,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:02:14" (3/4) ... [2024-10-11 10:02:18,592 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:02:18,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:02:18,598 INFO L158 Benchmark]: Toolchain (without parser) took 5297.01ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 95.1MB in the beginning and 135.3MB in the end (delta: -40.2MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,598 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:02:18,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.76ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 77.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.51ms. Allocated memory is still 167.8MB. Free memory was 77.8MB in the beginning and 73.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,599 INFO L158 Benchmark]: Boogie Preprocessor took 87.94ms. Allocated memory is still 167.8MB. Free memory was 73.1MB in the beginning and 65.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,599 INFO L158 Benchmark]: RCFGBuilder took 552.79ms. Allocated memory is still 167.8MB. Free memory was 65.1MB in the beginning and 116.9MB in the end (delta: -51.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,599 INFO L158 Benchmark]: TraceAbstraction took 4282.23ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 115.7MB in the beginning and 136.4MB in the end (delta: -20.7MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-10-11 10:02:18,602 INFO L158 Benchmark]: Witness Printer took 7.71ms. Allocated memory is still 253.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:02:18,604 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.76ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 77.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.51ms. Allocated memory is still 167.8MB. Free memory was 77.8MB in the beginning and 73.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.94ms. Allocated memory is still 167.8MB. Free memory was 73.1MB in the beginning and 65.4MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 552.79ms. Allocated memory is still 167.8MB. Free memory was 65.1MB in the beginning and 116.9MB in the end (delta: -51.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4282.23ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 115.7MB in the beginning and 136.4MB in the end (delta: -20.7MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 7.71ms. Allocated memory is still 253.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryArithmeticDOUBLEoperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] signed long int var_1_22 = -32; [L39] signed char var_1_26 = 25; [L40] signed char var_1_27 = 4; [L41] unsigned long int var_1_28 = 32; [L42] signed short int var_1_30 = 5; [L43] unsigned long int var_1_32 = 4; [L44] float var_1_34 = 31.25; [L45] double var_1_39 = 7.4; [L46] signed long int var_1_44 = 25; [L47] unsigned short int last_1_var_1_12 = 25; [L48] double last_1_var_1_15 = 64.375; [L170] isInitial = 1 [L171] FCALL initially() [L172] COND TRUE 1 [L173] CALL updateLastVariables() [L162] last_1_var_1_12 = var_1_12 [L163] last_1_var_1_15 = var_1_15 [L173] RET updateLastVariables() [L174] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_6=5, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L136] var_1_10 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L138] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L142] var_1_14 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L143] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L144] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L145] var_1_16 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L146] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L147] var_1_17 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L148] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L150] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L151] var_1_20 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L153] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L154] var_1_26 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_26 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L155] RET assume_abort_if_not(var_1_26 >= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_26 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L156] RET assume_abort_if_not(var_1_26 <= 32) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_27 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L159] RET assume_abort_if_not(var_1_27 <= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L174] RET updateVariables() [L175] CALL step() [L52] EXPR ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >> (var_1_26 - var_1_27) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L52] COND FALSE !(var_1_4 <= (((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >> (var_1_26 - var_1_27))) [L55] var_1_22 = var_1_5 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L57] COND FALSE !(8.4 <= var_1_16) [L60] var_1_28 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L62] COND TRUE var_1_18 == ((((32.5) < (var_1_17)) ? (32.5) : (var_1_17))) [L63] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L73] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L76] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L85] COND TRUE -256 < (var_1_4 * 10) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L86] COND TRUE var_1_17 >= var_1_16 [L87] var_1_39 = (((((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) > (var_1_16)) ? (((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) : (var_1_16))) - var_1_16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=25, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L92] var_1_44 = var_1_1 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L93] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L98] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L101] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L103] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L104] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L108] var_1_21 = var_1_10 [L109] unsigned long int stepLocal_3 = var_1_6; [L110] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=128, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L111] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L116] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=128, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=25, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L117] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L118] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=16388, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L122] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=16388, var_1_14=-114689, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L123] COND TRUE stepLocal_1 <= var_1_12 [L124] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=63, var_1_11=-192, var_1_12=16388, var_1_14=-114689, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L175] RET step() [L176] CALL, EXPR property() [L166-L167] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; [L176] RET, EXPR property() [L176] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=16388, var_1_14=-114689, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=63, var_1_11=-192, var_1_12=16388, var_1_14=-114689, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_22=0, var_1_26=16, var_1_27=16, var_1_28=10, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_44=10, var_1_4=128, var_1_5=256, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 850 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 348 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 86 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 1101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/2052 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 10:02:18,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.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 bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:02:20,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:02:20,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:02:20,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:02:20,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:02:20,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:02:20,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:02:20,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:02:20,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:02:20,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:02:20,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:02:20,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:02:20,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:02:20,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:02:20,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:02:20,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:02:20,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:02:20,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:02:20,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:02:20,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:02:20,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:02:20,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:02:20,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:02:20,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:02:20,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:02:20,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:02:20,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:02:20,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:02:20,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:02:20,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:02:20,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:02:20,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:02:20,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:02:20,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:02:20,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:02:20,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:02:20,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:02:20,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:02:20,971 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:02:20,971 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:02:20,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:02:20,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:02:20,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:02:20,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:02:20,972 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:02:20,972 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 -> bccc52d5a80f7f9488ab76128bea7894b8a72ec0524b5f7d0f24fdc919e34583 [2024-10-11 10:02:21,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:02:21,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:02:21,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:02:21,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:02:21,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:02:21,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:22,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:02:22,984 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:02:22,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:23,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b04213b0/7c7b000b6ee94ce694dd51fae7416dcc/FLAGcc85b5146 [2024-10-11 10:02:23,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b04213b0/7c7b000b6ee94ce694dd51fae7416dcc [2024-10-11 10:02:23,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:02:23,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:02:23,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:02:23,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:02:23,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:02:23,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef92852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23, skipping insertion in model container [2024-10-11 10:02:23,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:02:23,536 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_fillercodestructure_filler-ps-ci_file-5.i[918,931] [2024-10-11 10:02:23,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:02:23,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:02:23,660 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_fillercodestructure_filler-ps-ci_file-5.i[918,931] [2024-10-11 10:02:23,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:02:23,709 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:02:23,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23 WrapperNode [2024-10-11 10:02:23,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:02:23,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:02:23,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:02:23,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:02:23,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,762 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-10-11 10:02:23,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:02:23,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:02:23,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:02:23,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:02:23,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,799 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 10:02:23,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:02:23,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:02:23,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:02:23,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:02:23,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (1/1) ... [2024-10-11 10:02:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:02:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:02:23,887 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 10:02:23,895 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 10:02:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:02:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:02:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:02:23,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:02:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:02:23,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:02:24,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:02:24,014 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:02:24,715 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:02:24,715 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:02:24,756 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:02:24,757 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:02:24,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:02:24 BoogieIcfgContainer [2024-10-11 10:02:24,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:02:24,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:02:24,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:02:24,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:02:24,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:02:23" (1/3) ... [2024-10-11 10:02:24,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a40d75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:02:24, skipping insertion in model container [2024-10-11 10:02:24,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:02:23" (2/3) ... [2024-10-11 10:02:24,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a40d75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:02:24, skipping insertion in model container [2024-10-11 10:02:24,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:02:24" (3/3) ... [2024-10-11 10:02:24,764 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-5.i [2024-10-11 10:02:24,777 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:02:24,777 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:02:24,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:02:24,853 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;@2c554957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:02:24,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:02:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 45 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:02:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 10:02:24,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:24,870 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:24,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 188674567, now seen corresponding path program 1 times [2024-10-11 10:02:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:02:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147399558] [2024-10-11 10:02:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:24,889 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 10:02:24,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:02:24,892 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 10:02:24,893 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 10:02:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:25,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:02:25,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:02:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:02:25,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:02:25,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:02:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147399558] [2024-10-11 10:02:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147399558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:02:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:02:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:02:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359110679] [2024-10-11 10:02:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:02:25,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:02:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:02:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:02:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:02:25,348 INFO L87 Difference]: Start difference. First operand has 66 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 45 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:02:25,508 INFO L93 Difference]: Finished difference Result 129 states and 229 transitions. [2024-10-11 10:02:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:02:25,526 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 127 [2024-10-11 10:02:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:02:25,533 INFO L225 Difference]: With dead ends: 129 [2024-10-11 10:02:25,533 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 10:02:25,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 10:02:25,540 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:02:25,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:02:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 10:02:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 10:02:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:02:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-11 10:02:25,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 127 [2024-10-11 10:02:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:02:25,574 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-11 10:02:25,574 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:02:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-11 10:02:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 10:02:25,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:25,577 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:25,587 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 10:02:25,781 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 10:02:25,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash -678673942, now seen corresponding path program 1 times [2024-10-11 10:02:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:02:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734210569] [2024-10-11 10:02:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:25,786 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 10:02:25,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:02:25,788 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 10:02:25,790 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 10:02:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:26,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 10:02:26,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:02:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 162 proven. 96 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-11 10:02:27,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:02:28,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:02:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734210569] [2024-10-11 10:02:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734210569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:02:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503540482] [2024-10-11 10:02:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:02:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:02:28,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:02:28,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 10:02:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:28,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:02:28,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:02:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 162 proven. 96 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-11 10:02:29,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:02:30,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1503540482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:02:30,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:02:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 10:02:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676843158] [2024-10-11 10:02:30,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:02:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 10:02:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:02:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 10:02:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:02:30,141 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 10:02:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:02:31,132 INFO L93 Difference]: Finished difference Result 201 states and 306 transitions. [2024-10-11 10:02:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 10:02:31,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 128 [2024-10-11 10:02:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:02:31,135 INFO L225 Difference]: With dead ends: 201 [2024-10-11 10:02:31,135 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 10:02:31,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-10-11 10:02:31,137 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 213 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:02:31,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 283 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 10:02:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 10:02:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2024-10-11 10:02:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:02:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2024-10-11 10:02:31,158 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 128 [2024-10-11 10:02:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:02:31,159 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2024-10-11 10:02:31,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 6 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-11 10:02:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2024-10-11 10:02:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 10:02:31,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:02:31,161 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:31,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:02:31,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 10:02:31,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 10:02:31,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:02:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:02:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1496322392, now seen corresponding path program 1 times [2024-10-11 10:02:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:02:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591109877] [2024-10-11 10:02:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:02:31,564 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 10:02:31,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:02:31,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:02:31,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:02:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:02:31,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 10:02:31,839 INFO L278 TraceCheckSpWp]: Computing forward predicates...