./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_loopvsstraightlinecode_25-1loop_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_loopvsstraightlinecode_25-1loop_file-68.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 a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:38,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:38,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:29:38,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:38,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:38,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:38,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:38,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:38,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:38,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:38,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:38,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:38,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:38,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:38,616 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:38,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:38,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:38,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:38,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:29:38,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:38,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:38,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:38,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:38,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:38,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:38,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:38,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:38,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:38,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:38,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:38,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:38,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:38,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:38,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:38,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:38,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:38,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:29:38,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:29:38,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:38,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:38,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:38,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:38,629 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 -> a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e [2024-10-24 09:29:38,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:38,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:38,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:38,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:38,901 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:38,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:40,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:40,589 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:40,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:40,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988955ed4/41af6d9f918a4d619cf9b2fa5dd00079/FLAGe187b9276 [2024-10-24 09:29:40,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988955ed4/41af6d9f918a4d619cf9b2fa5dd00079 [2024-10-24 09:29:40,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:40,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:40,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:40,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:40,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:40,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599b84ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40, skipping insertion in model container [2024-10-24 09:29:40,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:40,842 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_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-10-24 09:29:40,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:40,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:40,897 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_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-10-24 09:29:40,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:40,930 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:40,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40 WrapperNode [2024-10-24 09:29:40,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:40,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:40,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:40,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:40,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,968 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 09:29:40,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:40,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:40,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:40,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:40,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,998 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-24 09:29:40,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:40,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:41,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:41,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:41,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:41,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (1/1) ... [2024-10-24 09:29:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:41,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:41,055 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-24 09:29:41,058 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-24 09:29:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:41,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:41,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:29:41,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:41,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:41,170 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:41,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:29:41,443 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 09:29:41,443 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:29:41,490 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:29:41,490 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:29:41,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:41 BoogieIcfgContainer [2024-10-24 09:29:41,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:29:41,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:29:41,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:29:41,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:29:41,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:29:40" (1/3) ... [2024-10-24 09:29:41,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4986f4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:41, skipping insertion in model container [2024-10-24 09:29:41,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:40" (2/3) ... [2024-10-24 09:29:41,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4986f4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:41, skipping insertion in model container [2024-10-24 09:29:41,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:41" (3/3) ... [2024-10-24 09:29:41,501 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:41,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:29:41,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:29:41,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:29:41,603 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;@79f1952c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:29:41,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:29:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 09:29:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 09:29:41,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:41,636 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:41,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:41,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1011231969, now seen corresponding path program 1 times [2024-10-24 09:29:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364729319] [2024-10-24 09:29:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:29:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:29:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:29:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:29:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:29:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:29:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:29:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 09:29:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364729319] [2024-10-24 09:29:42,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364729319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:29:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91321557] [2024-10-24 09:29:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:29:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:29:42,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:42,057 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 09:29:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:42,096 INFO L93 Difference]: Finished difference Result 97 states and 161 transitions. [2024-10-24 09:29:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:29:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-10-24 09:29:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:42,106 INFO L225 Difference]: With dead ends: 97 [2024-10-24 09:29:42,106 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 09:29:42,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-24 09:29:42,113 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:42,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:29:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 09:29:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 09:29:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 09:29:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-24 09:29:42,153 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 90 [2024-10-24 09:29:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-24 09:29:42,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 09:29:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-24 09:29:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 09:29:42,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:42,158 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:29:42,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -85434281, now seen corresponding path program 1 times [2024-10-24 09:29:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134561136] [2024-10-24 09:29:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:29:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:29:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:29:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:29:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:29:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:29:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:29:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 09:29:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134561136] [2024-10-24 09:29:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134561136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:42,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:29:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246827082] [2024-10-24 09:29:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:29:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:29:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:29:42,619 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:42,735 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2024-10-24 09:29:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:29:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-10-24 09:29:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:42,738 INFO L225 Difference]: With dead ends: 111 [2024-10-24 09:29:42,739 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 09:29:42,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-24 09:29:42,741 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:42,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 158 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:29:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 09:29:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-10-24 09:29:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 09:29:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-10-24 09:29:42,754 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 90 [2024-10-24 09:29:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:42,757 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-10-24 09:29:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-10-24 09:29:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 09:29:42,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:42,760 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:42,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:29:42,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1551395648, now seen corresponding path program 1 times [2024-10-24 09:29:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003751674] [2024-10-24 09:29:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:29:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:29:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:29:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:29:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:29:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:29:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:29:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 09:29:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003751674] [2024-10-24 09:29:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003751674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359441353] [2024-10-24 09:29:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:43,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:43,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:43,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:29:43,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:29:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:43,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:29:43,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-24 09:29:43,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 09:29:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359441353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:29:43,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:29:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2024-10-24 09:29:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774754634] [2024-10-24 09:29:43,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:29:43,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 09:29:43,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 09:29:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:29:43,986 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-10-24 09:29:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:44,477 INFO L93 Difference]: Finished difference Result 219 states and 317 transitions. [2024-10-24 09:29:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 09:29:44,478 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 91 [2024-10-24 09:29:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:44,480 INFO L225 Difference]: With dead ends: 219 [2024-10-24 09:29:44,480 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 09:29:44,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2024-10-24 09:29:44,485 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 420 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:44,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 151 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:29:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 09:29:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2024-10-24 09:29:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:29:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2024-10-24 09:29:44,520 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 91 [2024-10-24 09:29:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2024-10-24 09:29:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-10-24 09:29:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2024-10-24 09:29:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 09:29:44,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:44,523 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:44,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:29:44,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:44,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1738708292, now seen corresponding path program 1 times [2024-10-24 09:29:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:44,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884413617] [2024-10-24 09:29:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:29:44,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [235939601] [2024-10-24 09:29:44,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:44,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:44,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:29:44,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:29:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:44,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:29:44,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 09:29:45,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:29:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884413617] [2024-10-24 09:29:45,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:29:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235939601] [2024-10-24 09:29:45,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235939601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:45,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:29:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209781417] [2024-10-24 09:29:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:45,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:29:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:29:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:29:45,209 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:45,383 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-10-24 09:29:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:29:45,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-24 09:29:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:45,387 INFO L225 Difference]: With dead ends: 286 [2024-10-24 09:29:45,390 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 09:29:45,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:29:45,392 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:45,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 236 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:29:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 09:29:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-24 09:29:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 09:29:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2024-10-24 09:29:45,439 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 92 [2024-10-24 09:29:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:45,440 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2024-10-24 09:29:45,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2024-10-24 09:29:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 09:29:45,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:45,444 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:45,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:29:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 09:29:45,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 843827865, now seen corresponding path program 1 times [2024-10-24 09:29:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824271181] [2024-10-24 09:29:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:29:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:29:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:29:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:29:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:29:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:29:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:29:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 09:29:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824271181] [2024-10-24 09:29:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824271181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:46,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:29:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101481732] [2024-10-24 09:29:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:46,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:29:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:29:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:29:46,280 INFO L87 Difference]: Start difference. First operand 159 states and 232 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:47,247 INFO L93 Difference]: Finished difference Result 344 states and 492 transitions. [2024-10-24 09:29:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:29:47,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-24 09:29:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:47,250 INFO L225 Difference]: With dead ends: 344 [2024-10-24 09:29:47,250 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 09:29:47,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:29:47,251 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 147 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:47,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 295 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 09:29:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 09:29:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2024-10-24 09:29:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 143 states have internal predecessors, (179), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 09:29:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2024-10-24 09:29:47,275 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 94 [2024-10-24 09:29:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:47,275 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2024-10-24 09:29:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:29:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2024-10-24 09:29:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 09:29:47,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:47,277 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:47,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:29:47,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 619816204, now seen corresponding path program 1 times [2024-10-24 09:29:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468377696] [2024-10-24 09:29:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:29:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225198742] [2024-10-24 09:29:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:47,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:47,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:47,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:29:47,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 09:29:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:47,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:29:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:47,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:29:47,461 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:29:47,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:29:47,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 09:29:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:47,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:29:47,741 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:29:47,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:29:47 BoogieIcfgContainer [2024-10-24 09:29:47,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:29:47,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:29:47,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:29:47,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:29:47,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:41" (3/4) ... [2024-10-24 09:29:47,746 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:29:47,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:29:47,750 INFO L158 Benchmark]: Toolchain (without parser) took 7133.16ms. Allocated memory was 184.5MB in the beginning and 234.9MB in the end (delta: 50.3MB). Free memory was 116.3MB in the beginning and 111.0MB in the end (delta: 5.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,750 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:47,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.73ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 102.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.64ms. Allocated memory is still 184.5MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,751 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,751 INFO L158 Benchmark]: RCFGBuilder took 474.66ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 79.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,751 INFO L158 Benchmark]: TraceAbstraction took 6250.45ms. Allocated memory was 184.5MB in the beginning and 234.9MB in the end (delta: 50.3MB). Free memory was 78.6MB in the beginning and 111.0MB in the end (delta: -32.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-24 09:29:47,751 INFO L158 Benchmark]: Witness Printer took 5.60ms. Allocated memory is still 234.9MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:47,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.73ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 102.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.64ms. Allocated memory is still 184.5MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.66ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 79.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6250.45ms. Allocated memory was 184.5MB in the beginning and 234.9MB in the end (delta: 50.3MB). Free memory was 78.6MB in the beginning and 111.0MB in the end (delta: -32.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 5.60ms. Allocated memory is still 234.9MB. Free memory is still 111.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 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of shiftRight at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] signed long int var_1_9 = 25; [L27] double var_1_10 = 0.75; [L28] signed long int var_1_11 = 2; [L29] signed long int var_1_12 = 32; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] double var_1_15 = 50.2; [L33] signed long int last_1_var_1_9 = 25; [L34] double last_1_var_1_10 = 0.75; [L98] isInitial = 1 [L99] FCALL initially() [L100] int k_loop; [L101] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L101] COND TRUE k_loop < 1 [L102] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L91] last_1_var_1_10 = var_1_10 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L67] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L70] var_1_8 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L71] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L75] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L77] var_1_12 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L78] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L83] var_1_14 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L84] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L86] var_1_15 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=32, var_1_8=27, var_1_9=25] [L87] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=32, var_1_8=27, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] signed long int stepLocal_0 = last_1_var_1_9 + last_1_var_1_9; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=32, var_1_8=27, var_1_9=25] [L39] COND FALSE !((var_1_2 - var_1_3) >= last_1_var_1_10) [L44] var_1_1 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=25, var_1_8=27, var_1_9=25] [L46] signed long int stepLocal_2 = var_1_1; [L47] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=25, var_1_8=27, var_1_9=25] [L48] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=25, var_1_8=27, var_1_9=25] [L48] COND FALSE !((var_1_8 >> last_1_var_1_9) > stepLocal_1) [L55] var_1_9 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=25, var_1_8=27, var_1_9=25] [L57] COND TRUE ((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12)) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_1=25, var_1_8=27, var_1_9=25] [L58] COND TRUE var_1_13 || var_1_14 [L59] var_1_10 = var_1_15 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94-L95] return ((((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9)))) && ((((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12))) ? ((var_1_13 || var_1_14) ? (var_1_10 == ((double) var_1_15)) : (var_1_10 == ((double) var_1_15))) : 1) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 307 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 7 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2467/2548 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-24 09:29:47,781 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_loopvsstraightlinecode_25-1loop_file-68.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 a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:49,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:50,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:29:50,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:50,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:50,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:50,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:50,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:50,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:50,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:50,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:50,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:50,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:50,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:50,132 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:50,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:50,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:50,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:50,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:50,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:50,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:50,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:50,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:50,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:29:50,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:29:50,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:50,137 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:29:50,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:50,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:50,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:50,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:50,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:50,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:50,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:50,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:50,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:50,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:50,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:50,141 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:29:50,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:50,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:50,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:50,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:50,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:50,142 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:29:50,142 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 -> a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e [2024-10-24 09:29:50,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:50,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:50,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:50,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:50,472 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:50,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:52,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:52,257 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:52,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:52,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ab5187b/9c48293801744e01a248a242d5f8572b/FLAG214b929d3 [2024-10-24 09:29:52,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ab5187b/9c48293801744e01a248a242d5f8572b [2024-10-24 09:29:52,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:52,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:52,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:52,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:52,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:52,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aaa700d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52, skipping insertion in model container [2024-10-24 09:29:52,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:52,548 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_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-10-24 09:29:52,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:52,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:52,630 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_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-10-24 09:29:52,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:52,680 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:52,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52 WrapperNode [2024-10-24 09:29:52,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:52,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:52,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:52,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:52,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,736 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-24 09:29:52,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:52,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:52,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:52,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:52,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,766 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-24 09:29:52,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:52,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:52,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:52,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:52,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (1/1) ... [2024-10-24 09:29:52,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:52,821 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-24 09:29:52,824 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-24 09:29:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:29:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:52,960 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:52,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:29:54,145 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 09:29:54,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:29:54,213 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:29:54,214 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:29:54,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:54 BoogieIcfgContainer [2024-10-24 09:29:54,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:29:54,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:29:54,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:29:54,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:29:54,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:29:52" (1/3) ... [2024-10-24 09:29:54,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0b83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:54, skipping insertion in model container [2024-10-24 09:29:54,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:52" (2/3) ... [2024-10-24 09:29:54,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0b83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:54, skipping insertion in model container [2024-10-24 09:29:54,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:54" (3/3) ... [2024-10-24 09:29:54,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-10-24 09:29:54,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:29:54,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:29:54,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:29:54,312 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;@5167fb5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:29:54,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:29:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 09:29:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 09:29:54,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:54,325 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:54,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:54,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1124076703, now seen corresponding path program 1 times [2024-10-24 09:29:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999840749] [2024-10-24 09:29:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:54,342 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-24 09:29:54,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:54,343 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-24 09:29:54,345 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-24 09:29:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:54,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:29:54,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-24 09:29:54,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:29:54,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999840749] [2024-10-24 09:29:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999840749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:29:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572452825] [2024-10-24 09:29:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:29:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:29:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:29:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:54,645 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 09:29:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:55,255 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2024-10-24 09:29:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:29:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-10-24 09:29:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:55,264 INFO L225 Difference]: With dead ends: 83 [2024-10-24 09:29:55,264 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 09:29:55,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-24 09:29:55,271 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:55,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:29:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 09:29:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 09:29:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 09:29:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-24 09:29:55,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 87 [2024-10-24 09:29:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-24 09:29:55,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 09:29:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-24 09:29:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 09:29:55,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:55,326 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:29:55,337 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-24 09:29:55,527 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-24 09:29:55,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1501083033, now seen corresponding path program 1 times [2024-10-24 09:29:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440310145] [2024-10-24 09:29:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:55,530 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-24 09:29:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:55,534 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-24 09:29:55,535 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-24 09:29:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:55,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:29:55,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:30:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 09:30:08,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:30:08,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:30:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440310145] [2024-10-24 09:30:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440310145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:08,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:30:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041292122] [2024-10-24 09:30:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:08,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:30:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:30:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:30:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:30:08,005 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:30:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:38,590 INFO L93 Difference]: Finished difference Result 104 states and 148 transitions. [2024-10-24 09:30:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:30:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-10-24 09:30:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:38,593 INFO L225 Difference]: With dead ends: 104 [2024-10-24 09:30:38,593 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 09:30:38,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:30:38,595 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:38,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 223 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 28.8s Time] [2024-10-24 09:30:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 09:30:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-10-24 09:30:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:30:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-10-24 09:30:38,622 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 87 [2024-10-24 09:30:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:38,624 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-10-24 09:30:38,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 09:30:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-10-24 09:30:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 09:30:38,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:38,628 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:38,642 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:30:38,828 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-24 09:30:38,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 701648453, now seen corresponding path program 1 times [2024-10-24 09:30:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:30:38,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268731360] [2024-10-24 09:30:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:38,834 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-24 09:30:38,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:30:38,836 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-24 09:30:38,837 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-24 09:30:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:39,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:30:39,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:30:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 09:30:57,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:30:57,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:30:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268731360] [2024-10-24 09:30:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268731360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 09:30:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670596843] [2024-10-24 09:30:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 09:30:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:30:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 09:30:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:30:57,949 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14)