./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_50-while_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_50-while_file-9.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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:13:02,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:13:02,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:13:02,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:13:02,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:13:02,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:13:02,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:13:02,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:13:02,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:13:02,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:13:02,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:13:02,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:13:02,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:13:02,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:13:02,597 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:13:02,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:13:02,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:13:02,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:13:02,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:13:02,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:13:02,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:13:02,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:13:02,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:13:02,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:13:02,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:13:02,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:13:02,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:13:02,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:13:02,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:13:02,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:13:02,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:13:02,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:13:02,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:13:02,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:13:02,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:13:02,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:13:02,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:13:02,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:13:02,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:13:02,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:13:02,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:13:02,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:13:02,609 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-11-20 07:13:02,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:13:02,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:13:02,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:13:02,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:13:02,906 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:13:02,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:04,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:13:04,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:13:04,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:04,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab5bb830/0c196eb9d0994afb9a34e843e431aebd/FLAG665d6a060 [2024-11-20 07:13:04,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab5bb830/0c196eb9d0994afb9a34e843e431aebd [2024-11-20 07:13:04,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:13:04,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:13:04,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:13:04,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:13:04,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:13:04,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:04,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73769d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04, skipping insertion in model container [2024-11-20 07:13:04,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:04,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:13:04,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-20 07:13:04,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:13:04,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:13:04,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-20 07:13:04,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:13:04,980 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:13:04,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04 WrapperNode [2024-11-20 07:13:04,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:13:04,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:13:04,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:13:04,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:13:04,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,045 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-20 07:13:05,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:13:05,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:13:05,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:13:05,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:13:05,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:13:05,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:13:05,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:13:05,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:13:05,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:13:05,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (1/1) ... [2024-11-20 07:13:05,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:13:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:13:05,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:13:05,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:13:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:13:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:13:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:13:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:13:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:13:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:13:05,305 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:13:05,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:13:05,719 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 07:13:05,719 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:13:05,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:13:05,733 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:13:05,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:05 BoogieIcfgContainer [2024-11-20 07:13:05,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:13:05,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:13:05,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:13:05,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:13:05,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:13:04" (1/3) ... [2024-11-20 07:13:05,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1977e438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:05, skipping insertion in model container [2024-11-20 07:13:05,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:04" (2/3) ... [2024-11-20 07:13:05,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1977e438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:05, skipping insertion in model container [2024-11-20 07:13:05,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:05" (3/3) ... [2024-11-20 07:13:05,742 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:05,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:13:05,756 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:13:05,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:13:05,813 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;@55c5da8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:13:05,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:13:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 07:13:05,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:05,828 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:05,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 255444505, now seen corresponding path program 1 times [2024-11-20 07:13:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103773296] [2024-11-20 07:13:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103773296] [2024-11-20 07:13:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103773296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:13:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789776819] [2024-11-20 07:13:06,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:13:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:13:06,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:13:06,276 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:06,308 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2024-11-20 07:13:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:13:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-20 07:13:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:06,319 INFO L225 Difference]: With dead ends: 141 [2024-11-20 07:13:06,320 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 07:13:06,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:13:06,328 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:06,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:13:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 07:13:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 07:13:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-20 07:13:06,385 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108 [2024-11-20 07:13:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:06,385 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-20 07:13:06,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-20 07:13:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 07:13:06,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:06,390 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:06,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:13:06,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -878433837, now seen corresponding path program 1 times [2024-11-20 07:13:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534822974] [2024-11-20 07:13:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534822974] [2024-11-20 07:13:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534822974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:06,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:13:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978985839] [2024-11-20 07:13:06,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:13:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:06,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:13:06,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:13:06,762 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:06,798 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2024-11-20 07:13:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:13:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-20 07:13:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:06,801 INFO L225 Difference]: With dead ends: 138 [2024-11-20 07:13:06,802 INFO L226 Difference]: Without dead ends: 71 [2024-11-20 07:13:06,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:13:06,804 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:06,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:13:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-20 07:13:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-20 07:13:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-20 07:13:06,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-20 07:13:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:06,822 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-20 07:13:06,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-20 07:13:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:06,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:06,829 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:13:06,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:06,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1398780630, now seen corresponding path program 1 times [2024-11-20 07:13:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208211954] [2024-11-20 07:13:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208211954] [2024-11-20 07:13:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208211954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:10,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 07:13:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705771435] [2024-11-20 07:13:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:10,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 07:13:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 07:13:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:13:10,979 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:13,326 INFO L93 Difference]: Finished difference Result 249 states and 360 transitions. [2024-11-20 07:13:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:13:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-20 07:13:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:13,332 INFO L225 Difference]: With dead ends: 249 [2024-11-20 07:13:13,332 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 07:13:13,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:13:13,338 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 594 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:13,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 301 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 07:13:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 07:13:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2024-11-20 07:13:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 07:13:13,363 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 07:13:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 07:13:13,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 07:13:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:13,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:13,366 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:13,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:13:13,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:13,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1875118312, now seen corresponding path program 1 times [2024-11-20 07:13:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171057639] [2024-11-20 07:13:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171057639] [2024-11-20 07:13:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171057639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:16,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:16,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:13:16,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217443823] [2024-11-20 07:13:16,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:16,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:13:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:13:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:16,358 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:17,450 INFO L93 Difference]: Finished difference Result 262 states and 384 transitions. [2024-11-20 07:13:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 07:13:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:17,454 INFO L225 Difference]: With dead ends: 262 [2024-11-20 07:13:17,457 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 07:13:17,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:13:17,459 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 134 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:17,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 358 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 07:13:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 07:13:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 97. [2024-11-20 07:13:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 07:13:17,471 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 07:13:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:17,472 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 07:13:17,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 07:13:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:17,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:17,474 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:17,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:13:17,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:17,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1207242924, now seen corresponding path program 1 times [2024-11-20 07:13:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135691725] [2024-11-20 07:13:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:17,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:20,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135691725] [2024-11-20 07:13:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135691725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 07:13:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526904041] [2024-11-20 07:13:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 07:13:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 07:13:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:13:20,294 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:22,398 INFO L93 Difference]: Finished difference Result 277 states and 402 transitions. [2024-11-20 07:13:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:13:22,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-20 07:13:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:22,400 INFO L225 Difference]: With dead ends: 277 [2024-11-20 07:13:22,400 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 07:13:22,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:13:22,402 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 438 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:22,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 366 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 07:13:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 07:13:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 102. [2024-11-20 07:13:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-20 07:13:22,416 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 109 [2024-11-20 07:13:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-20 07:13:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 07:13:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-20 07:13:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:22,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:22,420 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:22,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:13:22,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 186174570, now seen corresponding path program 1 times [2024-11-20 07:13:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851894724] [2024-11-20 07:13:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851894724] [2024-11-20 07:13:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851894724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:13:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35624863] [2024-11-20 07:13:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:13:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:13:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:24,365 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:25,655 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-11-20 07:13:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 07:13:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:25,659 INFO L225 Difference]: With dead ends: 269 [2024-11-20 07:13:25,659 INFO L226 Difference]: Without dead ends: 170 [2024-11-20 07:13:25,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:13:25,660 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:25,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 452 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 07:13:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-20 07:13:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 97. [2024-11-20 07:13:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 07:13:25,676 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 07:13:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:25,676 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 07:13:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 07:13:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:25,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:25,678 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:25,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 07:13:25,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -976078804, now seen corresponding path program 1 times [2024-11-20 07:13:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57863919] [2024-11-20 07:13:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:26,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57863919] [2024-11-20 07:13:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57863919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:13:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005398838] [2024-11-20 07:13:26,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:13:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:13:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:26,616 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:26,973 INFO L93 Difference]: Finished difference Result 255 states and 377 transitions. [2024-11-20 07:13:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:26,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 07:13:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:26,976 INFO L225 Difference]: With dead ends: 255 [2024-11-20 07:13:26,976 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 07:13:26,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:13:26,977 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:26,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 270 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:13:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 07:13:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2024-11-20 07:13:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 07:13:26,987 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 07:13:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 07:13:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 07:13:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:13:26,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:26,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:26,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 07:13:26,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:26,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1629944750, now seen corresponding path program 1 times [2024-11-20 07:13:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:26,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158449167] [2024-11-20 07:13:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:26,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158449167] [2024-11-20 07:13:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158449167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:13:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760586667] [2024-11-20 07:13:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:13:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:13:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:28,053 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:28,757 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-11-20 07:13:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 07:13:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:28,759 INFO L225 Difference]: With dead ends: 233 [2024-11-20 07:13:28,759 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 07:13:28,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:13:28,760 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:28,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 426 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:13:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 07:13:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73. [2024-11-20 07:13:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-20 07:13:28,768 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 109 [2024-11-20 07:13:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:28,769 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-20 07:13:28,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-20 07:13:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:13:28,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:28,770 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 07:13:28,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:28,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash -451875899, now seen corresponding path program 1 times [2024-11-20 07:13:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355956177] [2024-11-20 07:13:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 07:13:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355956177] [2024-11-20 07:13:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355956177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:13:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104106346] [2024-11-20 07:13:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:28,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:13:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:13:28,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:13:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 07:13:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:29,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:13:29,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:13:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-20 07:13:29,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:13:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 07:13:29,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104106346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:13:29,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:13:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-20 07:13:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185868016] [2024-11-20 07:13:29,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:13:29,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 07:13:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 07:13:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:13:29,550 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-20 07:13:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:29,743 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-20 07:13:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 07:13:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111 [2024-11-20 07:13:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:29,746 INFO L225 Difference]: With dead ends: 153 [2024-11-20 07:13:29,746 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 07:13:29,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-20 07:13:29,747 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 213 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:29,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 172 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:13:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 07:13:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-20 07:13:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-11-20 07:13:29,756 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 111 [2024-11-20 07:13:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:29,756 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-11-20 07:13:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-20 07:13:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-11-20 07:13:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:13:29,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:29,758 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:29,768 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-11-20 07:13:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:13:29,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1848946691, now seen corresponding path program 1 times [2024-11-20 07:13:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136834762] [2024-11-20 07:13:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:13:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727941040] [2024-11-20 07:13:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:13:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:13:30,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:13:30,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 07:13:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:30,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 07:13:30,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:13:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-20 07:13:30,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:13:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 07:13:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136834762] [2024-11-20 07:13:30,930 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 07:13:30,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727941040] [2024-11-20 07:13:30,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727941040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:13:30,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:13:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 07:13:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918942800] [2024-11-20 07:13:30,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:13:30,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 07:13:30,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:30,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 07:13:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-20 07:13:30,933 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 07:13:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:31,731 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-20 07:13:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 07:13:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-20 07:13:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:31,733 INFO L225 Difference]: With dead ends: 251 [2024-11-20 07:13:31,734 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 07:13:31,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-20 07:13:31,735 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 228 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:31,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 829 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:13:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 07:13:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2024-11-20 07:13:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2024-11-20 07:13:31,750 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 111 [2024-11-20 07:13:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2024-11-20 07:13:31,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 07:13:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2024-11-20 07:13:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:13:31,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:31,753 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:31,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 07:13:31,953 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,SelfDestructingSolverStorable9 [2024-11-20 07:13:31,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1417968666, now seen corresponding path program 1 times [2024-11-20 07:13:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113404774] [2024-11-20 07:13:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113404774] [2024-11-20 07:13:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113404774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:13:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609757577] [2024-11-20 07:13:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:13:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:13:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:13:32,020 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:32,062 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions. [2024-11-20 07:13:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:13:32,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 07:13:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:32,064 INFO L225 Difference]: With dead ends: 288 [2024-11-20 07:13:32,064 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 07:13:32,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:13:32,065 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:32,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:13:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 07:13:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120. [2024-11-20 07:13:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-20 07:13:32,076 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 111 [2024-11-20 07:13:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:32,077 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-20 07:13:32,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-20 07:13:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:13:32,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:32,078 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 07:13:32,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:32,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1719733946, now seen corresponding path program 1 times [2024-11-20 07:13:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:32,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864710879] [2024-11-20 07:13:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:32,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864710879] [2024-11-20 07:13:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864710879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:13:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032568266] [2024-11-20 07:13:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:32,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:13:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:13:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:32,742 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:33,243 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2024-11-20 07:13:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:13:33,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 07:13:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:33,248 INFO L225 Difference]: With dead ends: 479 [2024-11-20 07:13:33,248 INFO L226 Difference]: Without dead ends: 362 [2024-11-20 07:13:33,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:13:33,253 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 191 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 471 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:13:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-20 07:13:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 239. [2024-11-20 07:13:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 205 states have internal predecessors, (270), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 07:13:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 322 transitions. [2024-11-20 07:13:33,277 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 322 transitions. Word has length 111 [2024-11-20 07:13:33,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:33,278 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 322 transitions. [2024-11-20 07:13:33,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 322 transitions. [2024-11-20 07:13:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:13:33,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:33,279 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:33,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 07:13:33,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:33,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2142435772, now seen corresponding path program 1 times [2024-11-20 07:13:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995678653] [2024-11-20 07:13:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995678653] [2024-11-20 07:13:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995678653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:33,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:33,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:13:33,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119695314] [2024-11-20 07:13:33,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:33,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:13:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:13:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:13:33,588 INFO L87 Difference]: Start difference. First operand 239 states and 322 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:33,931 INFO L93 Difference]: Finished difference Result 695 states and 916 transitions. [2024-11-20 07:13:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:33,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 07:13:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:33,940 INFO L225 Difference]: With dead ends: 695 [2024-11-20 07:13:33,940 INFO L226 Difference]: Without dead ends: 459 [2024-11-20 07:13:33,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:33,943 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:33,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 546 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:13:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-20 07:13:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 246. [2024-11-20 07:13:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 212 states have internal predecessors, (280), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 07:13:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2024-11-20 07:13:33,979 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 111 [2024-11-20 07:13:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2024-11-20 07:13:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2024-11-20 07:13:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 07:13:33,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:33,981 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:33,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 07:13:33,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:33,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1485993431, now seen corresponding path program 1 times [2024-11-20 07:13:33,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:33,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286923328] [2024-11-20 07:13:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286923328] [2024-11-20 07:13:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286923328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:36,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 07:13:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391040009] [2024-11-20 07:13:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:36,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 07:13:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:36,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 07:13:36,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-20 07:13:36,726 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:39,655 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions. [2024-11-20 07:13:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 07:13:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-20 07:13:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:39,659 INFO L225 Difference]: With dead ends: 562 [2024-11-20 07:13:39,659 INFO L226 Difference]: Without dead ends: 319 [2024-11-20 07:13:39,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-20 07:13:39,661 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 381 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:39,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 758 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 07:13:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-20 07:13:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2024-11-20 07:13:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 242 states have internal predecessors, (321), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 07:13:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2024-11-20 07:13:39,684 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 112 [2024-11-20 07:13:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:39,684 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2024-11-20 07:13:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2024-11-20 07:13:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 07:13:39,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:39,686 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 07:13:39,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1787758711, now seen corresponding path program 1 times [2024-11-20 07:13:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852711375] [2024-11-20 07:13:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:13:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:13:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:13:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:13:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:13:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:13:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:13:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:13:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:13:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:13:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:13:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:13:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:13:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:13:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:13:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:13:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852711375] [2024-11-20 07:13:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852711375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:13:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500502870] [2024-11-20 07:13:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:13:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:13:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:13:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:13:39,978 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:40,406 INFO L93 Difference]: Finished difference Result 813 states and 1094 transitions. [2024-11-20 07:13:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:13:40,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-20 07:13:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:40,410 INFO L225 Difference]: With dead ends: 813 [2024-11-20 07:13:40,410 INFO L226 Difference]: Without dead ends: 540 [2024-11-20 07:13:40,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:13:40,412 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 111 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:40,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 638 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:13:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-20 07:13:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 448. [2024-11-20 07:13:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 379 states have (on average 1.2955145118733509) internal successors, (491), 381 states have internal predecessors, (491), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 07:13:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 595 transitions. [2024-11-20 07:13:40,477 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 595 transitions. Word has length 112 [2024-11-20 07:13:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 595 transitions. [2024-11-20 07:13:40,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 595 transitions. [2024-11-20 07:13:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 07:13:40,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:40,479 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:40,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 07:13:40,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:40,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1573618992, now seen corresponding path program 1 times [2024-11-20 07:13:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:13:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928242635] [2024-11-20 07:13:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:13:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:13:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504135508] [2024-11-20 07:13:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:13:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:13:40,523 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-11-20 07:13:40,524 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-11-20 07:13:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:13:41,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:13:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:13:41,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:13:41,502 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:13:41,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:13:41,513 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-11-20 07:13:41,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:13:41,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:41,807 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:13:41,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:13:41 BoogieIcfgContainer [2024-11-20 07:13:41,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:13:41,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:13:41,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:13:41,811 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:13:41,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:05" (3/4) ... [2024-11-20 07:13:41,814 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:13:41,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:13:41,816 INFO L158 Benchmark]: Toolchain (without parser) took 37231.09ms. Allocated memory was 155.2MB in the beginning and 312.5MB in the end (delta: 157.3MB). Free memory was 99.4MB in the beginning and 229.6MB in the end (delta: -130.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,816 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:13:41,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.85ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 83.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.83ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 80.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,817 INFO L158 Benchmark]: Boogie Preprocessor took 61.98ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 77.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,818 INFO L158 Benchmark]: RCFGBuilder took 624.52ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 77.2MB in the beginning and 179.0MB in the end (delta: -101.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,819 INFO L158 Benchmark]: TraceAbstraction took 36074.45ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 177.9MB in the beginning and 230.6MB in the end (delta: -52.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,819 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 312.5MB. Free memory was 230.6MB in the beginning and 229.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:13:41,820 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.20ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.85ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 83.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.83ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 80.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.98ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 77.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.52ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 77.2MB in the beginning and 179.0MB in the end (delta: -101.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36074.45ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 177.9MB in the beginning and 230.6MB in the end (delta: -52.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 312.5MB. Free memory was 230.6MB in the beginning and 229.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2869 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 6078 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4488 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1590 mSDtfsCounter, 4526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1046 GetRequests, 903 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=15, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1016 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1964 ConstructedInterpolants, 0 QuantifiedInterpolants, 10485 SizeOfPredicates, 9 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 7374/7560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 07:13:41,938 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_50-while_file-9.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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:13:44,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:13:44,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:13:44,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:13:44,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:13:44,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:13:44,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:13:44,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:13:44,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:13:44,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:13:44,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:13:44,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:13:44,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:13:44,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:13:44,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:13:44,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:13:44,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:13:44,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:13:44,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:13:44,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:13:44,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:13:44,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:13:44,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:13:44,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:13:44,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:13:44,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:13:44,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:13:44,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:13:44,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:13:44,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:13:44,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:13:44,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:13:44,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:13:44,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:13:44,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:13:44,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:13:44,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:13:44,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:13:44,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:13:44,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:13:44,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:13:44,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:13:44,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:13:44,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:13:44,154 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-11-20 07:13:44,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:13:44,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:13:44,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:13:44,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:13:44,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:13:44,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:46,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:13:46,345 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:13:46,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:46,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476230655/1383ca0c88ae4b2aae861f2e32d71394/FLAG92c5d0392 [2024-11-20 07:13:46,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476230655/1383ca0c88ae4b2aae861f2e32d71394 [2024-11-20 07:13:46,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:13:46,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:13:46,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:13:46,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:13:46,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:13:46,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785b4ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46, skipping insertion in model container [2024-11-20 07:13:46,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:13:46,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-20 07:13:46,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:13:46,741 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:13:46,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-20 07:13:46,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:13:46,800 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:13:46,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46 WrapperNode [2024-11-20 07:13:46,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:13:46,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:13:46,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:13:46,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:13:46,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,852 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 07:13:46,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:13:46,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:13:46,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:13:46,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:13:46,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,892 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:13:46,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:13:46,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:13:46,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:13:46,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:13:46,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (1/1) ... [2024-11-20 07:13:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:13:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:13:46,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:13:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:13:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:13:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:13:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:13:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:13:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:13:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:13:47,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:13:47,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:13:47,601 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 07:13:47,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:13:47,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:13:47,620 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:13:47,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:47 BoogieIcfgContainer [2024-11-20 07:13:47,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:13:47,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:13:47,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:13:47,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:13:47,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:13:46" (1/3) ... [2024-11-20 07:13:47,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108d2fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:47, skipping insertion in model container [2024-11-20 07:13:47,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:13:46" (2/3) ... [2024-11-20 07:13:47,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108d2fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:13:47, skipping insertion in model container [2024-11-20 07:13:47,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:13:47" (3/3) ... [2024-11-20 07:13:47,634 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-20 07:13:47,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:13:47,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:13:47,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:13:47,753 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;@3300c1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:13:47,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:13:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 07:13:47,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:47,771 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:47,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1232252901, now seen corresponding path program 1 times [2024-11-20 07:13:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:13:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596895642] [2024-11-20 07:13:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:47,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:13:47,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:13:47,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:13:47,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 07:13:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:48,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:13:48,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:13:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 07:13:48,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:13:48,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:13:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596895642] [2024-11-20 07:13:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596895642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:13:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:13:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:13:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449838257] [2024-11-20 07:13:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:13:48,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:13:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:13:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:13:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:13:48,108 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:13:48,138 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-20 07:13:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:13:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-20 07:13:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:13:48,150 INFO L225 Difference]: With dead ends: 103 [2024-11-20 07:13:48,151 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 07:13:48,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:13:48,159 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:13:48,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:13:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 07:13:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 07:13:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 07:13:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-20 07:13:48,226 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2024-11-20 07:13:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:13:48,229 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-20 07:13:48,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 07:13:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-20 07:13:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 07:13:48,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:13:48,235 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:13:48,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 07:13:48,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:13:48,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:13:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:13:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1657719433, now seen corresponding path program 1 times [2024-11-20 07:13:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:13:48,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516171152] [2024-11-20 07:13:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:13:48,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:13:48,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:13:48,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:13:48,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 07:13:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:13:48,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 07:13:48,680 INFO L278 TraceCheckSpWp]: Computing forward predicates...