./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:52:14,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:52:14,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:52:14,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:52:14,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:52:14,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:52:14,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:52:14,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:52:14,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:52:14,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:52:14,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:52:14,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:52:14,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:52:14,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:52:14,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:52:14,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:52:14,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:52:14,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:52:14,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:52:14,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:52:14,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:52:14,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:52:14,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:52:14,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:52:14,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:52:14,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:52:14,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:52:14,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:52:14,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:52:14,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:52:14,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:52:14,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:52:14,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:14,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:52:14,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:52:14,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:52:14,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:52:14,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:52:14,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:52:14,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:52:14,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:52:14,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:52:14,361 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2024-10-13 05:52:14,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:52:14,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:52:14,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:52:14,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:52:14,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:52:14,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:16,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:52:16,376 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:52:16,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:16,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6960e819/32a55a2e6d1a4bf7b3f6ba9f0e0534d8/FLAG2fdceb894 [2024-10-13 05:52:16,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6960e819/32a55a2e6d1a4bf7b3f6ba9f0e0534d8 [2024-10-13 05:52:16,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:52:16,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:52:16,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:16,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:52:16,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:52:16,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1085ef28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16, skipping insertion in model container [2024-10-13 05:52:16,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:52:16,649 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2024-10-13 05:52:16,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:16,708 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:52:16,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2024-10-13 05:52:16,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:16,759 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:52:16,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16 WrapperNode [2024-10-13 05:52:16,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:16,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:16,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:52:16,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:52:16,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,804 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-13 05:52:16,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:16,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:52:16,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:52:16,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:52:16,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:52:16,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:52:16,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:52:16,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:52:16,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:52:16,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (1/1) ... [2024-10-13 05:52:16,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:52:16,893 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-10-13 05:52:16,899 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-10-13 05:52:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:52:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:52:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:52:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:52:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:52:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:52:17,030 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:52:17,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:52:17,322 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 05:52:17,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:52:17,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:52:17,383 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:52:17,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:17 BoogieIcfgContainer [2024-10-13 05:52:17,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:52:17,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:52:17,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:52:17,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:52:17,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:52:16" (1/3) ... [2024-10-13 05:52:17,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f1f771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:17, skipping insertion in model container [2024-10-13 05:52:17,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:16" (2/3) ... [2024-10-13 05:52:17,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f1f771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:17, skipping insertion in model container [2024-10-13 05:52:17,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:17" (3/3) ... [2024-10-13 05:52:17,395 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:17,409 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:52:17,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:52:17,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:52:17,474 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;@f873d00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:52:17,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:52:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:52:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 05:52:17,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:17,491 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:17,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 634484740, now seen corresponding path program 1 times [2024-10-13 05:52:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102598368] [2024-10-13 05:52:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:52:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:52:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:52:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:52:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102598368] [2024-10-13 05:52:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102598368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:52:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23787729] [2024-10-13 05:52:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:52:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:52:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:17,907 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:52:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:17,961 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-10-13 05:52:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:52:17,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-13 05:52:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:17,973 INFO L225 Difference]: With dead ends: 101 [2024-10-13 05:52:17,974 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 05:52:17,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:17,982 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:17,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 05:52:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 05:52:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:52:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-13 05:52:18,046 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 107 [2024-10-13 05:52:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-13 05:52:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:52:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-13 05:52:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 05:52:18,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:18,057 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:52:18,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1160712638, now seen corresponding path program 1 times [2024-10-13 05:52:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097615876] [2024-10-13 05:52:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:52:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:52:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:52:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:52:19,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:19,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097615876] [2024-10-13 05:52:19,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097615876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:19,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:52:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320354512] [2024-10-13 05:52:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:19,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:52:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:52:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:52:19,028 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:19,276 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2024-10-13 05:52:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:52:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-13 05:52:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:19,281 INFO L225 Difference]: With dead ends: 149 [2024-10-13 05:52:19,281 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 05:52:19,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:19,283 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:19,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 191 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:52:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 05:52:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-10-13 05:52:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:52:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-10-13 05:52:19,334 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 107 [2024-10-13 05:52:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:19,335 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-10-13 05:52:19,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-10-13 05:52:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 05:52:19,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:19,338 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:52:19,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:19,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1091507888, now seen corresponding path program 1 times [2024-10-13 05:52:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349434339] [2024-10-13 05:52:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:52:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:52:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:52:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:52:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349434339] [2024-10-13 05:52:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349434339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:52:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293388565] [2024-10-13 05:52:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:52:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:52:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:52:19,726 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:19,894 INFO L93 Difference]: Finished difference Result 157 states and 235 transitions. [2024-10-13 05:52:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:52:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-13 05:52:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:19,897 INFO L225 Difference]: With dead ends: 157 [2024-10-13 05:52:19,897 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 05:52:19,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:19,902 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:19,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:52:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 05:52:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-10-13 05:52:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:52:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-10-13 05:52:19,927 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 109 [2024-10-13 05:52:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:19,928 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-10-13 05:52:19,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-10-13 05:52:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:52:19,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:19,930 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:52:19,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -198802142, now seen corresponding path program 1 times [2024-10-13 05:52:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798329345] [2024-10-13 05:52:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:52:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:52:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:52:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:52:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798329345] [2024-10-13 05:52:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798329345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:20,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:52:20,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890575786] [2024-10-13 05:52:20,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:20,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:52:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:52:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:52:20,469 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:20,846 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2024-10-13 05:52:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:52:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-10-13 05:52:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:20,852 INFO L225 Difference]: With dead ends: 182 [2024-10-13 05:52:20,852 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 05:52:20,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:52:20,853 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 97 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:20,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 325 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:52:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 05:52:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2024-10-13 05:52:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:52:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-10-13 05:52:20,893 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 111 [2024-10-13 05:52:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:20,894 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-10-13 05:52:20,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-10-13 05:52:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:52:20,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:20,895 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:20,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:52:20,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 502262436, now seen corresponding path program 1 times [2024-10-13 05:52:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787989625] [2024-10-13 05:52:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:52:20,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:52:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:52:21,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:52:21,088 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:52:21,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:52:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:52:21,093 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 05:52:21,191 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:52:21,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:52:21 BoogieIcfgContainer [2024-10-13 05:52:21,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:52:21,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:52:21,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:52:21,195 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:52:21,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:17" (3/4) ... [2024-10-13 05:52:21,199 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:52:21,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:52:21,200 INFO L158 Benchmark]: Toolchain (without parser) took 4784.40ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 132.7MB in the beginning and 101.7MB in the end (delta: 31.1MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,201 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.5MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:52:21,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.10ms. Allocated memory is still 159.4MB. Free memory was 132.5MB in the beginning and 119.8MB in the end (delta: 12.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.46ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,205 INFO L158 Benchmark]: Boogie Preprocessor took 48.87ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 114.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,205 INFO L158 Benchmark]: RCFGBuilder took 528.74ms. Allocated memory is still 159.4MB. Free memory was 114.6MB in the beginning and 93.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,206 INFO L158 Benchmark]: TraceAbstraction took 3808.02ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 92.6MB in the beginning and 102.7MB in the end (delta: -10.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-13 05:52:21,206 INFO L158 Benchmark]: Witness Printer took 5.12ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:52:21,207 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.15ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.5MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.10ms. Allocated memory is still 159.4MB. Free memory was 132.5MB in the beginning and 119.8MB in the end (delta: 12.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.46ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.87ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 114.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.74ms. Allocated memory is still 159.4MB. Free memory was 114.6MB in the beginning and 93.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3808.02ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 92.6MB in the beginning and 102.7MB in the end (delta: -10.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Witness Printer took 5.12ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = -1; [L26] signed char var_1_8 = -50; [L27] signed char var_1_9 = 100; [L28] unsigned long int var_1_10 = 25; [L29] unsigned long int var_1_11 = 2568920345; [L30] unsigned long int var_1_12 = 1191097264; [L31] unsigned long int var_1_13 = 1801344522; [L32] signed long int var_1_14 = 64; [L33] signed short int var_1_15 = -16; [L34] float var_1_16 = 1000000.5; [L35] float var_1_17 = 4.5; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 128; [L38] unsigned long int last_1_var_1_10 = 25; [L39] signed short int last_1_var_1_15 = -16; [L40] unsigned char last_1_var_1_18 = 0; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] last_1_var_1_10 = var_1_10 [L99] last_1_var_1_15 = var_1_15 [L100] last_1_var_1_18 = var_1_18 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L76] var_1_7 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=100] [L79] var_1_9 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L80] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L82] var_1_11 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L85] var_1_12 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L89] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L91] var_1_17 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L92] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L93] var_1_19 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L94] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L111] RET updateVariables() [L112] CALL step() [L44] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L44] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L53] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L56] COND TRUE var_1_12 <= var_1_8 [L57] var_1_14 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L59] var_1_15 = 2 [L60] var_1_16 = var_1_17 [L61] var_1_18 = var_1_19 [L62] unsigned char stepLocal_0 = var_1_8 < var_1_1; VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=25, var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=2, var_1_16=27670116114859294726, var_1_17=27670116114859294726, var_1_18=-2, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L63] COND TRUE stepLocal_0 && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7) [L64] var_1_10 = (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=(((unsigned __int128) 1 << 64) | 9223372041149743105U), var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=2, var_1_16=27670116114859294726, var_1_17=27670116114859294726, var_1_18=-2, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=(((unsigned __int128) 1 << 64) | 9223372041149743105U), var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=2, var_1_16=27670116114859294726, var_1_17=27670116114859294726, var_1_18=-2, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L103-L104] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) ? ((var_1_5 && var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed char) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : 1)) && (((var_1_8 < var_1_1) && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7)) ? (var_1_10 == ((unsigned long int) (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)))) : (var_1_10 == ((unsigned long int) (var_1_11 - var_1_13))))) && ((var_1_12 <= var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_15 == ((signed short int) 2))) && (var_1_16 == ((float) var_1_17))) && (var_1_18 == ((unsigned char) var_1_19)) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=(((unsigned __int128) 1 << 64) | 9223372041149743105U), var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=2, var_1_16=27670116114859294726, var_1_17=27670116114859294726, var_1_18=-2, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=(((unsigned __int128) 1 << 64) | 9223372041149743105U), var_1_11=(((unsigned __int128) 1 << 64) | 9223372034707292159), var_1_12=-6442450945, var_1_13=-3221225473, var_1_14=50, var_1_15=2, var_1_16=27670116114859294726, var_1_17=27670116114859294726, var_1_18=-2, var_1_19=-2, var_1_1=126, var_1_5=0, var_1_6=0, var_1_7=126, var_1_8=-50, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 783 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 516 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 267 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 1796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:52:21,247 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:52:23,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:52:23,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:52:23,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:52:23,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:52:23,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:52:23,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:52:23,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:52:23,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:52:23,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:52:23,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:52:23,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:52:23,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:52:23,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:52:23,522 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:52:23,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:52:23,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:52:23,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:52:23,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:52:23,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:52:23,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:52:23,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:52:23,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:52:23,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:52:23,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:52:23,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:52:23,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:52:23,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:52:23,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:52:23,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:52:23,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:52:23,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:52:23,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:52:23,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:52:23,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:23,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:52:23,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:52:23,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:52:23,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:52:23,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:52:23,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:52:23,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:52:23,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:52:23,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:52:23,544 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:52:23,544 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2024-10-13 05:52:23,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:52:23,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:52:23,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:52:23,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:52:23,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:52:23,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:25,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:52:25,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:52:25,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:25,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc59b94/dc1bbd0860e6459aac085bdf5c0f8036/FLAGe693dc21d [2024-10-13 05:52:25,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc59b94/dc1bbd0860e6459aac085bdf5c0f8036 [2024-10-13 05:52:25,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:52:25,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:52:25,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:25,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:52:25,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:52:25,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:25" (1/1) ... [2024-10-13 05:52:25,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7437e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:25, skipping insertion in model container [2024-10-13 05:52:25,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:25" (1/1) ... [2024-10-13 05:52:25,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:52:26,000 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2024-10-13 05:52:26,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:26,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:52:26,096 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2024-10-13 05:52:26,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:26,149 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:52:26,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26 WrapperNode [2024-10-13 05:52:26,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:26,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:26,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:52:26,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:52:26,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,208 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-13 05:52:26,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:26,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:52:26,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:52:26,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:52:26,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,245 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:52:26,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:52:26,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:52:26,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:52:26,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:52:26,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (1/1) ... [2024-10-13 05:52:26,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:52:26,314 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-10-13 05:52:26,317 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-10-13 05:52:26,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:52:26,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:52:26,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:52:26,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:52:26,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:52:26,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:52:26,456 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:52:26,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:52:26,735 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 05:52:26,736 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:52:26,806 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:52:26,807 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:52:26,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:26 BoogieIcfgContainer [2024-10-13 05:52:26,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:52:26,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:52:26,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:52:26,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:52:26,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:52:25" (1/3) ... [2024-10-13 05:52:26,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa26ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:26, skipping insertion in model container [2024-10-13 05:52:26,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:26" (2/3) ... [2024-10-13 05:52:26,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa26ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:26, skipping insertion in model container [2024-10-13 05:52:26,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:26" (3/3) ... [2024-10-13 05:52:26,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2024-10-13 05:52:26,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:52:26,835 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:52:26,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:52:26,912 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;@455ccb60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:52:26,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:52:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:52:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:52:26,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:26,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:26,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1498095704, now seen corresponding path program 1 times [2024-10-13 05:52:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:52:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068252588] [2024-10-13 05:52:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:52:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:52:26,955 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-10-13 05:52:26,956 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-10-13 05:52:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:27,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:52:27,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:52:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 05:52:27,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:52:27,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:52:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068252588] [2024-10-13 05:52:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068252588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:52:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985491772] [2024-10-13 05:52:27,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:27,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:52:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:52:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:52:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:27,209 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:52:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:27,255 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2024-10-13 05:52:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:52:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-13 05:52:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:27,266 INFO L225 Difference]: With dead ends: 87 [2024-10-13 05:52:27,266 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 05:52:27,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:27,274 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:27,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 05:52:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 05:52:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:52:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-13 05:52:27,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 104 [2024-10-13 05:52:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-13 05:52:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:52:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-13 05:52:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:52:27,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:27,321 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:27,326 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-10-13 05:52:27,522 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-10-13 05:52:27,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:27,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1676442918, now seen corresponding path program 1 times [2024-10-13 05:52:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:52:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870294153] [2024-10-13 05:52:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:52:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:52:27,528 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-10-13 05:52:27,531 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-10-13 05:52:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:27,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:52:27,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:52:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:52:28,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:52:28,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:52:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870294153] [2024-10-13 05:52:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870294153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:52:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376387355] [2024-10-13 05:52:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:52:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:52:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:52:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:52:28,045 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:28,272 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2024-10-13 05:52:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:52:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-13 05:52:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:28,276 INFO L225 Difference]: With dead ends: 147 [2024-10-13 05:52:28,276 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 05:52:28,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:52:28,278 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:28,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 241 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:52:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 05:52:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2024-10-13 05:52:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:52:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-10-13 05:52:28,311 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 104 [2024-10-13 05:52:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:28,315 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-10-13 05:52:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:52:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-10-13 05:52:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:52:28,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:28,317 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:28,324 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 (3)] Ended with exit code 0 [2024-10-13 05:52:28,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10-13 05:52:28,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:28,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash 98564444, now seen corresponding path program 1 times [2024-10-13 05:52:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:52:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032128380] [2024-10-13 05:52:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:28,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:52:28,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:52:28,523 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-13 05:52:28,540 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 (4)] Waiting until timeout for monitored process [2024-10-13 05:52:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:28,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:52:28,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:52:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 258 proven. 15 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-13 05:52:29,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:52:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 05:52:29,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:52:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032128380] [2024-10-13 05:52:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032128380] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:52:29,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:52:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-10-13 05:52:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512115025] [2024-10-13 05:52:29,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:52:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:52:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:52:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:52:29,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:52:29,307 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 05:52:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:29,953 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2024-10-13 05:52:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:52:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 104 [2024-10-13 05:52:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:29,957 INFO L225 Difference]: With dead ends: 229 [2024-10-13 05:52:29,957 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 05:52:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:52:29,959 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:29,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 161 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:52:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 05:52:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 148. [2024-10-13 05:52:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 80 states have (on average 1.175) internal successors, (94), 81 states have internal predecessors, (94), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 05:52:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2024-10-13 05:52:30,009 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 104 [2024-10-13 05:52:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2024-10-13 05:52:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 05:52:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2024-10-13 05:52:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:52:30,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:30,012 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:52:30,021 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 05:52:30,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-13 05:52:30,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:30,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:30,217 INFO L85 PathProgramCache]: Analyzing trace with hash 41306142, now seen corresponding path program 1 times [2024-10-13 05:52:30,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:52:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738173951] [2024-10-13 05:52:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:30,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:52:30,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:52:30,222 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-13 05:52:30,227 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 (5)] Waiting until timeout for monitored process [2024-10-13 05:52:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:30,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 05:52:30,317 INFO L278 TraceCheckSpWp]: Computing forward predicates...