./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14034a331b777dfd4bcf98d49d07f782df13f19e43a2e185157ef77069ad9e0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:33:16,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:33:16,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:33:16,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:33:16,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:33:16,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:33:16,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:33:16,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:33:16,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:33:16,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:33:16,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:33:16,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:33:16,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:33:16,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:33:16,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:33:16,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:33:16,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:33:16,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:33:16,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:33:16,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:33:16,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:33:16,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:33:16,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:33:16,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:33:16,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:33:16,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:33:16,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:33:16,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:33:16,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:33:16,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:33:16,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:33:16,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:33:16,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:33:16,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:33:16,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:33:16,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:33:16,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:33:16,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:33:16,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:33:16,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:33:16,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:33:16,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:33:16,661 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14034a331b777dfd4bcf98d49d07f782df13f19e43a2e185157ef77069ad9e0 [2024-11-10 06:33:16,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:33:17,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:33:17,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:33:17,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:33:17,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:33:17,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:18,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:33:18,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:33:18,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:18,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4122ec/4b8d302bf14d4fe7901bf94a243e81f7/FLAGf6744481d [2024-11-10 06:33:18,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4122ec/4b8d302bf14d4fe7901bf94a243e81f7 [2024-11-10 06:33:18,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:33:18,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:33:18,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:33:18,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:33:18,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:33:18,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:18" (1/1) ... [2024-11-10 06:33:18,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53933863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:18, skipping insertion in model container [2024-11-10 06:33:18,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:18" (1/1) ... [2024-11-10 06:33:18,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:33:19,142 WARN L250 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_normal_file-57.i[913,926] [2024-11-10 06:33:19,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:33:19,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:33:19,236 WARN L250 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_normal_file-57.i[913,926] [2024-11-10 06:33:19,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:33:19,302 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:33:19,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19 WrapperNode [2024-11-10 06:33:19,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:33:19,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:33:19,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:33:19,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:33:19,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,378 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 06:33:19,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:33:19,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:33:19,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:33:19,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:33:19,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,438 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-11-10 06:33:19,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:33:19,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:33:19,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:33:19,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:33:19,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (1/1) ... [2024-11-10 06:33:19,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:33:19,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:33:19,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:33:19,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:33:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:33:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:33:19,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:33:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:33:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:33:19,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:33:19,703 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:33:19,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:33:20,126 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 06:33:20,190 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 06:33:20,194 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:33:20,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:33:20,293 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:33:20,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:20 BoogieIcfgContainer [2024-11-10 06:33:20,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:33:20,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:33:20,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:33:20,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:33:20,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:33:18" (1/3) ... [2024-11-10 06:33:20,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798d47e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:20, skipping insertion in model container [2024-11-10 06:33:20,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:19" (2/3) ... [2024-11-10 06:33:20,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798d47e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:20, skipping insertion in model container [2024-11-10 06:33:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:20" (3/3) ... [2024-11-10 06:33:20,337 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:20,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:33:20,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:33:20,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:33:20,459 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;@4912767b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:33:20,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:33:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:33:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 06:33:20,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:20,483 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:20,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2025536186, now seen corresponding path program 1 times [2024-11-10 06:33:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:33:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096585207] [2024-11-10 06:33:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:33:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:33:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:33:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:33:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:33:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:33:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:33:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:33:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:33:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:33:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:33:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:33:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:33:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:33:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:33:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:33:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:33:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:33:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:33:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 06:33:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:33:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:33:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:33:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:33:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:33:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:33:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:33:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:33:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:33:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096585207] [2024-11-10 06:33:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096585207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:33:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:33:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:33:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766668257] [2024-11-10 06:33:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:33:21,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:33:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:33:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:33:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:33:21,061 INFO L87 Difference]: Start difference. First operand has 94 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:33:21,116 INFO L93 Difference]: Finished difference Result 180 states and 303 transitions. [2024-11-10 06:33:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:33:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-10 06:33:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:33:21,132 INFO L225 Difference]: With dead ends: 180 [2024-11-10 06:33:21,133 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 06:33:21,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-11-10 06:33:21,143 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:33:21,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:33:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 06:33:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 06:33:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:33:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2024-11-10 06:33:21,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 171 [2024-11-10 06:33:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:33:21,202 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 134 transitions. [2024-11-10 06:33:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2024-11-10 06:33:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 06:33:21,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:21,207 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:21,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:33:21,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash 924028642, now seen corresponding path program 1 times [2024-11-10 06:33:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:33:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924359624] [2024-11-10 06:33:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:33:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:33:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:33:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:33:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:33:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:33:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:33:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:33:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:33:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:33:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:33:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:33:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:33:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:33:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:33:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:33:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:33:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:33:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:33:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 06:33:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:33:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:33:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:33:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:33:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:33:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:33:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:33:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:33:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:33:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924359624] [2024-11-10 06:33:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924359624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:33:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34795062] [2024-11-10 06:33:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:33:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:33:22,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:33:22,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:33:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:22,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:33:22,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:33:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-10 06:33:22,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:33:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:33:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34795062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:33:23,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:33:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 06:33:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820444480] [2024-11-10 06:33:23,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:33:23,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 06:33:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:33:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 06:33:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-10 06:33:23,130 INFO L87 Difference]: Start difference. First operand 89 states and 134 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 06:33:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:33:23,511 INFO L93 Difference]: Finished difference Result 183 states and 273 transitions. [2024-11-10 06:33:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:33:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 171 [2024-11-10 06:33:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:33:23,518 INFO L225 Difference]: With dead ends: 183 [2024-11-10 06:33:23,519 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 06:33:23,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:33:23,521 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 63 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:33:23,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 316 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:33:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 06:33:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-10 06:33:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:33:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-10 06:33:23,552 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 171 [2024-11-10 06:33:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:33:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-10 06:33:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 06:33:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-10 06:33:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 06:33:23,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:23,561 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:23,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:33:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:33:23,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1863386845, now seen corresponding path program 1 times [2024-11-10 06:33:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:33:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105936161] [2024-11-10 06:33:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:33:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:33:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:33:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:33:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:33:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:33:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:33:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:33:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:33:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:33:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:33:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:33:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:33:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:33:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:33:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:33:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:33:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:33:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:33:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 06:33:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:33:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:33:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:33:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:33:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:33:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:33:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:33:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:33:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:33:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105936161] [2024-11-10 06:33:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105936161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:33:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:33:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:33:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919656062] [2024-11-10 06:33:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:33:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:33:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:33:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:33:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:33:24,574 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:33:25,872 INFO L93 Difference]: Finished difference Result 448 states and 647 transitions. [2024-11-10 06:33:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:33:25,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-10 06:33:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:33:25,878 INFO L225 Difference]: With dead ends: 448 [2024-11-10 06:33:25,879 INFO L226 Difference]: Without dead ends: 356 [2024-11-10 06:33:25,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-10 06:33:25,888 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 415 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:33:25,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 872 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 06:33:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-10 06:33:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 320. [2024-11-10 06:33:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 231 states have (on average 1.3376623376623376) internal successors, (309), 233 states have internal predecessors, (309), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-10 06:33:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 469 transitions. [2024-11-10 06:33:25,965 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 469 transitions. Word has length 171 [2024-11-10 06:33:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:33:25,969 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 469 transitions. [2024-11-10 06:33:25,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 469 transitions. [2024-11-10 06:33:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 06:33:25,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:25,973 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:33:25,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -340372236, now seen corresponding path program 1 times [2024-11-10 06:33:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:33:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706927734] [2024-11-10 06:33:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:33:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:33:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:33:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:33:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:33:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:33:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:33:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:33:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:33:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:33:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:33:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:33:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 06:33:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:33:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:33:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:33:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:33:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:33:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:33:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 06:33:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:33:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:33:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:33:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:33:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:33:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:33:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:33:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:33:26,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:33:26,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706927734] [2024-11-10 06:33:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706927734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:33:26,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:33:26,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:33:26,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859283605] [2024-11-10 06:33:26,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:33:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:33:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:33:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:33:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:33:26,433 INFO L87 Difference]: Start difference. First operand 320 states and 469 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:33:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:33:27,141 INFO L93 Difference]: Finished difference Result 790 states and 1148 transitions. [2024-11-10 06:33:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:33:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-10 06:33:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:33:27,149 INFO L225 Difference]: With dead ends: 790 [2024-11-10 06:33:27,149 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 06:33:27,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:33:27,157 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 250 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:33:27,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 692 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 06:33:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 06:33:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 336. [2024-11-10 06:33:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 247 states have (on average 1.3522267206477734) internal successors, (334), 249 states have internal predecessors, (334), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-10 06:33:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 494 transitions. [2024-11-10 06:33:27,221 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 494 transitions. Word has length 172 [2024-11-10 06:33:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:33:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 494 transitions. [2024-11-10 06:33:27,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:33:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 494 transitions. [2024-11-10 06:33:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 06:33:27,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:27,224 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:27,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:33:27,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1810954355, now seen corresponding path program 1 times [2024-11-10 06:33:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:33:27,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172742617] [2024-11-10 06:33:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:33:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:33:27,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865533488] [2024-11-10 06:33:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:27,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:33:27,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:33:27,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:33:27,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 06:33:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:33:27,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:33:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:33:27,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:33:27,694 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:33:27,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:33:27,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:33:27,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:33:27,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 06:33:28,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:33:28,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:33:28 BoogieIcfgContainer [2024-11-10 06:33:28,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:33:28,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:33:28,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:33:28,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:33:28,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:20" (3/4) ... [2024-11-10 06:33:28,013 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:33:28,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:33:28,016 INFO L158 Benchmark]: Toolchain (without parser) took 9098.53ms. Allocated memory was 153.1MB in the beginning and 226.5MB in the end (delta: 73.4MB). Free memory was 96.1MB in the beginning and 171.4MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:33:28,019 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:33:28,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.24ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 79.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:33:28,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.15ms. Allocated memory is still 153.1MB. Free memory was 79.9MB in the beginning and 75.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:33:28,020 INFO L158 Benchmark]: Boogie Preprocessor took 102.72ms. Allocated memory is still 153.1MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:33:28,020 INFO L158 Benchmark]: IcfgBuilder took 810.87ms. Allocated memory is still 153.1MB. Free memory was 70.0MB in the beginning and 121.5MB in the end (delta: -51.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-11-10 06:33:28,021 INFO L158 Benchmark]: TraceAbstraction took 7706.47ms. Allocated memory was 153.1MB in the beginning and 226.5MB in the end (delta: 73.4MB). Free memory was 120.8MB in the beginning and 171.4MB in the end (delta: -50.6MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2024-11-10 06:33:28,021 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 226.5MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:33:28,022 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.21ms. Allocated memory is still 153.1MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.24ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 79.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.15ms. Allocated memory is still 153.1MB. Free memory was 79.9MB in the beginning and 75.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.72ms. Allocated memory is still 153.1MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 810.87ms. Allocated memory is still 153.1MB. Free memory was 70.0MB in the beginning and 121.5MB in the end (delta: -51.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7706.47ms. Allocated memory was 153.1MB in the beginning and 226.5MB in the end (delta: 73.4MB). Free memory was 120.8MB in the beginning and 171.4MB in the end (delta: -50.6MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 226.5MB. Free memory is still 171.4MB. 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 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=-1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L89] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L91] var_1_3 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L94] var_1_5 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L98] var_1_6 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L99] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L101] var_1_8 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L102] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L103] var_1_9 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L104] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L105] var_1_10 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L106] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L107] var_1_11 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L108] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L109] var_1_12 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L110] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L111] var_1_14 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L112] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L113] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L113] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L114] var_1_15 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L116] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L116] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L117] var_1_16 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L118] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L119] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L119] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L122] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L122] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L123] var_1_18 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L124] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L125] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L125] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L128] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L128] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L141] RET updateVariables() [L142] CALL step() [L46] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L47] COND TRUE -256 <= stepLocal_0 [L48] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L54] COND TRUE var_1_11 <= var_1_9 [L55] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L57] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L58] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L66] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L66] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L67] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L70] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L70] signed long int stepLocal_2 = var_1_1 & var_1_3; [L71] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L78] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L80] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L81] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1] [L82] COND TRUE ! (! var_1_6) [L83] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L133] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L133-L134] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_12=2, var_1_13=1, var_1_14=-66, var_1_15=63, var_1_16=128, var_1_17=-448, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=0, var_1_3=0, var_1_5=-1, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 2010 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1384 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1744 IncrementalHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 626 mSDtfsCounter, 1744 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 175 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 2265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7593/7800 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-11-10 06:33:28,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14034a331b777dfd4bcf98d49d07f782df13f19e43a2e185157ef77069ad9e0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:33:30,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:33:30,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:33:30,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:33:30,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:33:30,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:33:30,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:33:30,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:33:30,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:33:30,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:33:30,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:33:30,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:33:30,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:33:30,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:33:30,697 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:33:30,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:33:30,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:33:30,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:33:30,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:33:30,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:33:30,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:33:30,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:33:30,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:33:30,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:33:30,704 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:33:30,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:33:30,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:33:30,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:33:30,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:33:30,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:33:30,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:33:30,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:33:30,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:33:30,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:33:30,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:33:30,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:33:30,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:33:30,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:33:30,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:33:30,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:33:30,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:33:30,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:33:30,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:33:30,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:33:30,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14034a331b777dfd4bcf98d49d07f782df13f19e43a2e185157ef77069ad9e0 [2024-11-10 06:33:31,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:33:31,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:33:31,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:33:31,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:33:31,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:33:31,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:32,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:33:33,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:33:33,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:33,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed16e9e9/f74b9828a261415dbf1abab922899bb8/FLAG45ff10dc9 [2024-11-10 06:33:33,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed16e9e9/f74b9828a261415dbf1abab922899bb8 [2024-11-10 06:33:33,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:33:33,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:33:33,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:33:33,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:33:33,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:33:33,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:33,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca99493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33, skipping insertion in model container [2024-11-10 06:33:33,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:33,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:33:33,803 WARN L250 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_normal_file-57.i[913,926] [2024-11-10 06:33:33,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:33:33,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:33:33,931 WARN L250 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_normal_file-57.i[913,926] [2024-11-10 06:33:33,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:33:33,997 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:33:33,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33 WrapperNode [2024-11-10 06:33:33,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:33:33,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:33:33,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:33:33,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:33:34,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,048 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-10 06:33:34,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:33:34,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:33:34,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:33:34,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:33:34,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,087 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-11-10 06:33:34,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:33:34,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:33:34,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:33:34,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:33:34,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (1/1) ... [2024-11-10 06:33:34,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:33:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:33:34,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:33:34,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:33:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:33:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:33:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:33:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:33:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:33:34,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:33:34,281 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:33:34,284 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:33:42,848 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 06:33:42,849 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:33:42,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:33:42,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:33:42,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:42 BoogieIcfgContainer [2024-11-10 06:33:42,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:33:42,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:33:42,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:33:42,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:33:42,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:33:33" (1/3) ... [2024-11-10 06:33:42,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e939475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:42, skipping insertion in model container [2024-11-10 06:33:42,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:33" (2/3) ... [2024-11-10 06:33:42,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e939475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:42, skipping insertion in model container [2024-11-10 06:33:42,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:42" (3/3) ... [2024-11-10 06:33:42,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-57.i [2024-11-10 06:33:42,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:33:42,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:33:42,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:33:42,999 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;@2958f70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:33:42,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:33:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:33:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 06:33:43,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:43,022 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:43,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -817642529, now seen corresponding path program 1 times [2024-11-10 06:33:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:33:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286435273] [2024-11-10 06:33:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:43,049 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-11-10 06:33:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:33:43,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:33:43,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:33:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:43,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:33:43,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:33:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-10 06:33:43,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:33:43,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:33:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286435273] [2024-11-10 06:33:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286435273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:33:43,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:33:43,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:33:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772032961] [2024-11-10 06:33:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:33:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:33:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:33:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:33:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:33:43,728 INFO L87 Difference]: Start difference. First operand has 76 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:33:43,761 INFO L93 Difference]: Finished difference Result 143 states and 245 transitions. [2024-11-10 06:33:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:33:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 06:33:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:33:43,774 INFO L225 Difference]: With dead ends: 143 [2024-11-10 06:33:43,774 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 06:33:43,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-11-10 06:33:43,782 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:33:43,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:33:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 06:33:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 06:33:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:33:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2024-11-10 06:33:43,829 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 165 [2024-11-10 06:33:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:33:43,830 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2024-11-10 06:33:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:33:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-11-10 06:33:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 06:33:43,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:33:43,835 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:33:43,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:33:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:33:44,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:33:44,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:33:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 232845947, now seen corresponding path program 1 times [2024-11-10 06:33:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:33:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178111632] [2024-11-10 06:33:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:33:44,039 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-11-10 06:33:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:33:44,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:33:44,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:33:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:33:44,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 06:33:44,888 INFO L278 TraceCheckSpWp]: Computing forward predicates...