./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_operatoramount_amount10_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:01:14,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:01:15,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:01:15,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:01:15,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:01:15,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:01:15,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:01:15,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:01:15,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:01:15,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:01:15,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:01:15,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:01:15,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:01:15,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:01:15,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:01:15,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:01:15,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:01:15,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:01:15,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:01:15,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:01:15,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:01:15,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:01:15,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:01:15,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:01:15,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:01:15,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:01:15,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:01:15,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:01:15,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:01:15,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:01:15,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:01:15,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:01:15,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:15,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:01:15,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:01:15,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:01:15,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:01:15,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:01:15,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:01:15,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:01:15,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:01:15,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:01:15,123 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-13 05:01:15,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:01:15,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:01:15,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:01:15,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:01:15,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:01:15,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:16,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:01:17,158 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:01:17,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:17,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19f051a/75cf638bba9f4f51b1738d9fe34fddb5/FLAG6deada120 [2024-10-13 05:01:17,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19f051a/75cf638bba9f4f51b1738d9fe34fddb5 [2024-10-13 05:01:17,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:01:17,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:01:17,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:17,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:01:17,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:01:17,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66137c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17, skipping insertion in model container [2024-10-13 05:01:17,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:01:17,425 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-10-13 05:01:17,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:17,486 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:01:17,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-10-13 05:01:17,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:17,533 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:01:17,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17 WrapperNode [2024-10-13 05:01:17,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:17,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:17,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:01:17,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:01:17,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,583 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 05:01:17,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:17,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:01:17,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:01:17,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:01:17,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,619 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:01:17,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:01:17,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:01:17,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:01:17,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:01:17,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (1/1) ... [2024-10-13 05:01:17,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:01:17,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:01:17,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:01:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:01:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:01:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:01:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:01:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:01:17,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:01:17,786 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:01:17,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:01:17,999 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:01:17,999 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:01:18,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:01:18,038 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:01:18,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:18 BoogieIcfgContainer [2024-10-13 05:01:18,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:01:18,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:01:18,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:01:18,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:01:18,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:01:17" (1/3) ... [2024-10-13 05:01:18,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7503ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:18, skipping insertion in model container [2024-10-13 05:01:18,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:17" (2/3) ... [2024-10-13 05:01:18,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7503ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:18, skipping insertion in model container [2024-10-13 05:01:18,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:18" (3/3) ... [2024-10-13 05:01:18,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:18,079 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:01:18,080 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:01:18,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:01:18,158 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;@65b5899b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:01:18,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:01:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:01:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:01:18,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:18,172 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:18,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1377890462, now seen corresponding path program 1 times [2024-10-13 05:01:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992803769] [2024-10-13 05:01:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:18,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992803769] [2024-10-13 05:01:18,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992803769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:01:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846078965] [2024-10-13 05:01:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:18,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:01:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:01:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:18,508 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:01:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:18,546 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-10-13 05:01:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:01:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-13 05:01:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:18,555 INFO L225 Difference]: With dead ends: 87 [2024-10-13 05:01:18,556 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 05:01:18,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:18,563 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:18,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 05:01:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 05:01:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:01:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-10-13 05:01:18,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 77 [2024-10-13 05:01:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:18,604 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-10-13 05:01:18,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:01:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-10-13 05:01:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:01:18,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:18,608 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:01:18,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash 255276898, now seen corresponding path program 1 times [2024-10-13 05:01:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:18,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794617937] [2024-10-13 05:01:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794617937] [2024-10-13 05:01:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794617937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:01:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400727252] [2024-10-13 05:01:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:19,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:01:19,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:19,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:01:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:01:19,329 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:19,561 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2024-10-13 05:01:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:01:19,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-13 05:01:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:19,563 INFO L225 Difference]: With dead ends: 104 [2024-10-13 05:01:19,564 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 05:01:19,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:19,565 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:19,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:01:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 05:01:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2024-10-13 05:01:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:01:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-13 05:01:19,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 77 [2024-10-13 05:01:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:19,577 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-13 05:01:19,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-13 05:01:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:01:19,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:19,579 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:01:19,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 935335268, now seen corresponding path program 1 times [2024-10-13 05:01:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434861482] [2024-10-13 05:01:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:19,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434861482] [2024-10-13 05:01:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434861482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:01:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296098889] [2024-10-13 05:01:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:01:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:01:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:19,807 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:19,875 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2024-10-13 05:01:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:01:19,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-13 05:01:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:19,880 INFO L225 Difference]: With dead ends: 143 [2024-10-13 05:01:19,882 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 05:01:19,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:19,884 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:19,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 05:01:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-13 05:01:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:01:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2024-10-13 05:01:19,912 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 77 [2024-10-13 05:01:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:19,912 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2024-10-13 05:01:19,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2024-10-13 05:01:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:01:19,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:19,915 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:19,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:01:19,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:19,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash -135947097, now seen corresponding path program 1 times [2024-10-13 05:01:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132487201] [2024-10-13 05:01:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132487201] [2024-10-13 05:01:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132487201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:01:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751479251] [2024-10-13 05:01:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:20,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:01:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:01:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:01:20,831 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:21,436 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2024-10-13 05:01:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:01:21,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-13 05:01:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:21,441 INFO L225 Difference]: With dead ends: 148 [2024-10-13 05:01:21,441 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 05:01:21,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:01:21,444 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 118 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:21,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 295 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:01:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 05:01:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2024-10-13 05:01:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:01:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 169 transitions. [2024-10-13 05:01:21,485 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 169 transitions. Word has length 79 [2024-10-13 05:01:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:21,485 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 169 transitions. [2024-10-13 05:01:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2024-10-13 05:01:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:01:21,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:21,489 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:21,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:01:21,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash -945293723, now seen corresponding path program 1 times [2024-10-13 05:01:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061618659] [2024-10-13 05:01:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:22,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061618659] [2024-10-13 05:01:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061618659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:01:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195692319] [2024-10-13 05:01:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:01:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:01:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:01:22,251 INFO L87 Difference]: Start difference. First operand 122 states and 169 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:22,981 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-10-13 05:01:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:01:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-13 05:01:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:22,985 INFO L225 Difference]: With dead ends: 159 [2024-10-13 05:01:22,987 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 05:01:22,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:01:22,989 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 76 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:22,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 482 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:01:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 05:01:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2024-10-13 05:01:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:01:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2024-10-13 05:01:23,018 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 79 [2024-10-13 05:01:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:23,019 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2024-10-13 05:01:23,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-10-13 05:01:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 05:01:23,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:23,025 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:01:23,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:23,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 806892677, now seen corresponding path program 1 times [2024-10-13 05:01:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41445088] [2024-10-13 05:01:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41445088] [2024-10-13 05:01:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41445088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:01:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516401613] [2024-10-13 05:01:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:01:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:01:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:23,098 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:23,152 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2024-10-13 05:01:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:01:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-13 05:01:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:23,157 INFO L225 Difference]: With dead ends: 259 [2024-10-13 05:01:23,157 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 05:01:23,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:23,161 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:23,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 05:01:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-10-13 05:01:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:01:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-13 05:01:23,205 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 80 [2024-10-13 05:01:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:23,206 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-13 05:01:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-13 05:01:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 05:01:23,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:23,210 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:23,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:01:23,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:23,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1243156778, now seen corresponding path program 1 times [2024-10-13 05:01:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297228524] [2024-10-13 05:01:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:23,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297228524] [2024-10-13 05:01:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297228524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:01:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994861205] [2024-10-13 05:01:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:23,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:01:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:01:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:23,286 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:23,333 INFO L93 Difference]: Finished difference Result 298 states and 413 transitions. [2024-10-13 05:01:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:01:23,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-13 05:01:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:23,336 INFO L225 Difference]: With dead ends: 298 [2024-10-13 05:01:23,336 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 05:01:23,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:23,337 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:23,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 05:01:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-13 05:01:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.176991150442478) internal successors, (133), 115 states have internal predecessors, (133), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:01:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 229 transitions. [2024-10-13 05:01:23,373 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 229 transitions. Word has length 80 [2024-10-13 05:01:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:23,374 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 229 transitions. [2024-10-13 05:01:23,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 229 transitions. [2024-10-13 05:01:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 05:01:23,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:23,375 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:01:23,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 854969490, now seen corresponding path program 1 times [2024-10-13 05:01:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:23,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248426814] [2024-10-13 05:01:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248426814] [2024-10-13 05:01:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248426814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:23,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:01:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679513713] [2024-10-13 05:01:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:23,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:01:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:23,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:01:23,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:01:23,529 INFO L87 Difference]: Start difference. First operand 167 states and 229 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:23,593 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2024-10-13 05:01:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:01:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-13 05:01:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:23,596 INFO L225 Difference]: With dead ends: 335 [2024-10-13 05:01:23,597 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 05:01:23,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:23,598 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:23,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 05:01:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-13 05:01:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 115 states have internal predecessors, (130), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:01:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2024-10-13 05:01:23,621 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 80 [2024-10-13 05:01:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:23,621 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2024-10-13 05:01:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2024-10-13 05:01:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 05:01:23,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:23,622 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:23,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:01:23,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 163072564, now seen corresponding path program 1 times [2024-10-13 05:01:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623827177] [2024-10-13 05:01:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623827177] [2024-10-13 05:01:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623827177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:01:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749044777] [2024-10-13 05:01:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:01:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:01:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:23,768 INFO L87 Difference]: Start difference. First operand 167 states and 226 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:23,841 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2024-10-13 05:01:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:01:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-13 05:01:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:23,844 INFO L225 Difference]: With dead ends: 290 [2024-10-13 05:01:23,845 INFO L226 Difference]: Without dead ends: 288 [2024-10-13 05:01:23,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:01:23,846 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:23,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-13 05:01:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-10-13 05:01:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 190 states have (on average 1.1) internal successors, (209), 197 states have internal predecessors, (209), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:01:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2024-10-13 05:01:23,902 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 81 [2024-10-13 05:01:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:23,903 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2024-10-13 05:01:23,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2024-10-13 05:01:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 05:01:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:23,904 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:23,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:01:23,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 843130934, now seen corresponding path program 1 times [2024-10-13 05:01:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:23,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680215062] [2024-10-13 05:01:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680215062] [2024-10-13 05:01:24,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680215062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:24,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:24,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:01:24,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877118222] [2024-10-13 05:01:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:24,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:01:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:01:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:01:24,601 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:25,268 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2024-10-13 05:01:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:01:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-13 05:01:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:25,272 INFO L225 Difference]: With dead ends: 562 [2024-10-13 05:01:25,273 INFO L226 Difference]: Without dead ends: 344 [2024-10-13 05:01:25,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:01:25,275 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:25,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 432 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:01:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-13 05:01:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2024-10-13 05:01:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 198 states have (on average 1.101010101010101) internal successors, (218), 205 states have internal predecessors, (218), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:01:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2024-10-13 05:01:25,328 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 81 [2024-10-13 05:01:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2024-10-13 05:01:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2024-10-13 05:01:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:01:25,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:25,330 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:25,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:01:25,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 464813267, now seen corresponding path program 1 times [2024-10-13 05:01:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384177136] [2024-10-13 05:01:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:01:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:01:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:01:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:01:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:01:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:25,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384177136] [2024-10-13 05:01:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384177136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:01:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463862356] [2024-10-13 05:01:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:01:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:01:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:25,391 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:25,484 INFO L93 Difference]: Finished difference Result 616 states and 815 transitions. [2024-10-13 05:01:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:01:25,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-13 05:01:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:25,489 INFO L225 Difference]: With dead ends: 616 [2024-10-13 05:01:25,490 INFO L226 Difference]: Without dead ends: 390 [2024-10-13 05:01:25,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:01:25,491 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:25,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 97 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-13 05:01:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 322. [2024-10-13 05:01:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 213 states have (on average 1.0892018779342723) internal successors, (232), 222 states have internal predecessors, (232), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 05:01:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 424 transitions. [2024-10-13 05:01:25,557 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 424 transitions. Word has length 83 [2024-10-13 05:01:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:25,557 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 424 transitions. [2024-10-13 05:01:25,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 424 transitions. [2024-10-13 05:01:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:01:25,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:25,559 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:25,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:01:25,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1638749302, now seen corresponding path program 1 times [2024-10-13 05:01:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031841539] [2024-10-13 05:01:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:01:25,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:01:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:01:25,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:01:25,638 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:01:25,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:01:25,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:01:25,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:25,721 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:01:25,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:01:25 BoogieIcfgContainer [2024-10-13 05:01:25,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:01:25,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:01:25,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:01:25,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:01:25,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:18" (3/4) ... [2024-10-13 05:01:25,729 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:01:25,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:01:25,730 INFO L158 Benchmark]: Toolchain (without parser) took 8534.63ms. Allocated memory was 148.9MB in the beginning and 237.0MB in the end (delta: 88.1MB). Free memory was 94.5MB in the beginning and 122.6MB in the end (delta: -28.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,731 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:01:25,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.39ms. Allocated memory is still 148.9MB. Free memory was 94.5MB in the beginning and 81.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.43ms. Allocated memory is still 148.9MB. Free memory was 81.5MB in the beginning and 79.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,731 INFO L158 Benchmark]: Boogie Preprocessor took 47.13ms. Allocated memory is still 148.9MB. Free memory was 79.3MB in the beginning and 77.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,732 INFO L158 Benchmark]: RCFGBuilder took 406.12ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 61.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,732 INFO L158 Benchmark]: TraceAbstraction took 7683.40ms. Allocated memory was 148.9MB in the beginning and 237.0MB in the end (delta: 88.1MB). Free memory was 60.6MB in the beginning and 123.6MB in the end (delta: -63.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,732 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 237.0MB. Free memory was 123.6MB in the beginning and 122.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:25,734 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.19ms. Allocated memory is still 148.9MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.39ms. Allocated memory is still 148.9MB. Free memory was 94.5MB in the beginning and 81.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.43ms. Allocated memory is still 148.9MB. Free memory was 81.5MB in the beginning and 79.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.13ms. Allocated memory is still 148.9MB. Free memory was 79.3MB in the beginning and 77.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.12ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 61.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7683.40ms. Allocated memory was 148.9MB in the beginning and 237.0MB in the end (delta: 88.1MB). Free memory was 60.6MB in the beginning and 123.6MB in the end (delta: -63.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 237.0MB. Free memory was 123.6MB in the beginning and 122.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 bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 2318 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1555 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 763 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=11, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 200 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 959 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 2766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:01:25,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:01:27,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:01:28,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:01:28,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:01:28,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:01:28,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:01:28,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:01:28,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:01:28,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:01:28,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:01:28,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:01:28,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:01:28,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:01:28,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:01:28,073 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:01:28,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:01:28,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:01:28,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:01:28,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:01:28,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:01:28,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:01:28,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:01:28,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:01:28,080 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:01:28,081 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:01:28,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:01:28,081 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:01:28,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:01:28,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:01:28,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:01:28,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:01:28,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:01:28,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:01:28,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:01:28,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:28,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:01:28,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:01:28,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:01:28,084 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:01:28,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:01:28,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:01:28,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:01:28,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:01:28,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:01:28,087 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:01:28,087 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-13 05:01:28,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:01:28,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:01:28,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:01:28,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:01:28,489 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:01:28,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:30,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:01:30,349 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:01:30,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:30,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d684f984/fa6d16b829c24e5e80a9e26ba378d3aa/FLAG11b3d0df6 [2024-10-13 05:01:30,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d684f984/fa6d16b829c24e5e80a9e26ba378d3aa [2024-10-13 05:01:30,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:01:30,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:01:30,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:30,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:01:30,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:01:30,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:30" (1/1) ... [2024-10-13 05:01:30,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a490874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:30, skipping insertion in model container [2024-10-13 05:01:30,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:30" (1/1) ... [2024-10-13 05:01:30,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:01:30,973 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-10-13 05:01:31,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:31,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:01:31,047 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-10-13 05:01:31,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:31,085 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:01:31,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31 WrapperNode [2024-10-13 05:01:31,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:31,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:31,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:01:31,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:01:31,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,127 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-10-13 05:01:31,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:31,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:01:31,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:01:31,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:01:31,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,157 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:01:31,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:01:31,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:01:31,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:01:31,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:01:31,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (1/1) ... [2024-10-13 05:01:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:01:31,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:01:31,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:01:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:01:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:01:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:01:31,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:01:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:01:31,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:01:31,365 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:01:31,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:01:31,580 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 05:01:31,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:01:31,645 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:01:31,647 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:01:31,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:31 BoogieIcfgContainer [2024-10-13 05:01:31,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:01:31,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:01:31,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:01:31,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:01:31,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:01:30" (1/3) ... [2024-10-13 05:01:31,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee57942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:31, skipping insertion in model container [2024-10-13 05:01:31,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:31" (2/3) ... [2024-10-13 05:01:31,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee57942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:31, skipping insertion in model container [2024-10-13 05:01:31,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:31" (3/3) ... [2024-10-13 05:01:31,658 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-13 05:01:31,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:01:31,673 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:01:31,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:01:31,757 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;@28fa83af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:01:31,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:01:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:01:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 05:01:31,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:31,774 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:31,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash -238086645, now seen corresponding path program 1 times [2024-10-13 05:01:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913082243] [2024-10-13 05:01:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:31,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:31,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:31,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:01:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:31,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:01:31,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-13 05:01:31,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:01:31,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913082243] [2024-10-13 05:01:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913082243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:01:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806351113] [2024-10-13 05:01:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:31,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:01:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:01:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:31,991 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:32,030 INFO L93 Difference]: Finished difference Result 65 states and 110 transitions. [2024-10-13 05:01:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:01:32,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-13 05:01:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:32,042 INFO L225 Difference]: With dead ends: 65 [2024-10-13 05:01:32,043 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 05:01:32,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:32,048 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:32,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 05:01:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 05:01:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:01:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-13 05:01:32,088 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 74 [2024-10-13 05:01:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:32,089 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-13 05:01:32,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-13 05:01:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 05:01:32,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:32,093 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:32,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:01:32,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:32,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2086146549, now seen corresponding path program 1 times [2024-10-13 05:01:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194234689] [2024-10-13 05:01:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:32,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:32,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:32,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:01:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:32,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:01:32,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:35,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:01:35,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194234689] [2024-10-13 05:01:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194234689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:01:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809906441] [2024-10-13 05:01:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:35,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:01:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:01:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:35,391 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:35,579 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2024-10-13 05:01:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:01:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-13 05:01:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:35,582 INFO L225 Difference]: With dead ends: 72 [2024-10-13 05:01:35,582 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 05:01:35,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:01:35,584 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:35,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:01:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 05:01:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-13 05:01:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:01:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-13 05:01:35,611 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 74 [2024-10-13 05:01:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:35,612 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-13 05:01:35,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-13 05:01:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 05:01:35,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:35,616 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:35,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 05:01:35,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:35,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:35,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2086086967, now seen corresponding path program 1 times [2024-10-13 05:01:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064788583] [2024-10-13 05:01:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:35,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:35,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:35,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 05:01:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:35,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 05:01:35,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 05:01:38,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:01:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:39,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064788583] [2024-10-13 05:01:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064788583] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:01:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:01:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-13 05:01:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601707380] [2024-10-13 05:01:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:01:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:01:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:01:39,697 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:40,434 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-10-13 05:01:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:01:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-13 05:01:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:40,437 INFO L225 Difference]: With dead ends: 83 [2024-10-13 05:01:40,438 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 05:01:40,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:01:40,439 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:40,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:01:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 05:01:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2024-10-13 05:01:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:01:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2024-10-13 05:01:40,461 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 74 [2024-10-13 05:01:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2024-10-13 05:01:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2024-10-13 05:01:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 05:01:40,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:40,465 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:40,469 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 (4)] Ended with exit code 0 [2024-10-13 05:01:40,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:40,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2028888247, now seen corresponding path program 1 times [2024-10-13 05:01:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:40,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509865207] [2024-10-13 05:01:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:40,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:40,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:40,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:40,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 05:01:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:01:40,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:01:41,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:01:41,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509865207] [2024-10-13 05:01:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509865207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:41,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:01:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833601323] [2024-10-13 05:01:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:41,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:01:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:01:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:41,557 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:41,615 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2024-10-13 05:01:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:01:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-13 05:01:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:41,617 INFO L225 Difference]: With dead ends: 57 [2024-10-13 05:01:41,617 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 05:01:41,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:01:41,619 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:41,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 05:01:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-13 05:01:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:01:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-13 05:01:41,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 74 [2024-10-13 05:01:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:41,632 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-13 05:01:41,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-13 05:01:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 05:01:41,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:41,634 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:41,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 05:01:41,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:41,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:41,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2028828665, now seen corresponding path program 1 times [2024-10-13 05:01:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910361192] [2024-10-13 05:01:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:41,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:41,842 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 (6)] Waiting until timeout for monitored process [2024-10-13 05:01:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:41,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:01:41,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 05:01:42,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:01:42,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910361192] [2024-10-13 05:01:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910361192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:01:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1719733440] [2024-10-13 05:01:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:01:42,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:01:42,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:01:42,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 05:01:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:42,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:01:42,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 05:01:42,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:01:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1719733440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:01:42,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:01:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-13 05:01:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197102257] [2024-10-13 05:01:42,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:01:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:01:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:01:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:01:42,527 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:01:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:42,725 INFO L93 Difference]: Finished difference Result 153 states and 208 transitions. [2024-10-13 05:01:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:01:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-10-13 05:01:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:42,729 INFO L225 Difference]: With dead ends: 153 [2024-10-13 05:01:42,729 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 05:01:42,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:01:42,732 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:42,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:01:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 05:01:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-10-13 05:01:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 58 states have internal predecessors, (61), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 05:01:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-10-13 05:01:42,755 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 74 [2024-10-13 05:01:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-10-13 05:01:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:01:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-10-13 05:01:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 05:01:42,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:42,757 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:01:42,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-13 05:01:42,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 05:01:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:43,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1940362940, now seen corresponding path program 1 times [2024-10-13 05:01:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:01:43,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001646838] [2024-10-13 05:01:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:43,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:01:43,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:01:43,165 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 (8)] Waiting until timeout for monitored process [2024-10-13 05:01:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:43,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:01:43,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:01:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 728 proven. 195 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-13 05:01:45,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:01:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-13 05:01:48,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:01:48,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001646838] [2024-10-13 05:01:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001646838] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:01:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:01:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-13 05:01:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147226827] [2024-10-13 05:01:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:01:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:01:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:01:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:01:48,879 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:50,376 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2024-10-13 05:01:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:01:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 147 [2024-10-13 05:01:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:50,378 INFO L225 Difference]: With dead ends: 100 [2024-10-13 05:01:50,379 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:01:50,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-13 05:01:50,380 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:50,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:01:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:01:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:01:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 05:01:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:01:50,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2024-10-13 05:01:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:50,384 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:01:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:01:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:01:50,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:01:50,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:01:50,394 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 (8)] Ended with exit code 0 [2024-10-13 05:01:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:01:50,592 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 05:01:50,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:01:52,283 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:01:52,290 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-13 05:01:52,293 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-13 05:01:52,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:01:52 BoogieIcfgContainer [2024-10-13 05:01:52,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:01:52,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:01:52,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:01:52,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:01:52,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:31" (3/4) ... [2024-10-13 05:01:52,304 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:01:52,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:01:52,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 05:01:52,312 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 05:01:52,312 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:01:52,312 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:01:52,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:01:52,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:01:52,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:01:52,408 INFO L158 Benchmark]: Toolchain (without parser) took 21672.00ms. Allocated memory was 56.6MB in the beginning and 415.2MB in the end (delta: 358.6MB). Free memory was 30.1MB in the beginning and 151.1MB in the end (delta: -121.1MB). Peak memory consumption was 237.5MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,408 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:01:52,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.95ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 29.9MB in the beginning and 59.7MB in the end (delta: -29.8MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.74ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 57.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,409 INFO L158 Benchmark]: Boogie Preprocessor took 60.05ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 55.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,409 INFO L158 Benchmark]: RCFGBuilder took 458.96ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 38.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,410 INFO L158 Benchmark]: TraceAbstraction took 20650.49ms. Allocated memory was 83.9MB in the beginning and 415.2MB in the end (delta: 331.4MB). Free memory was 38.4MB in the beginning and 156.4MB in the end (delta: -118.0MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,410 INFO L158 Benchmark]: Witness Printer took 106.01ms. Allocated memory is still 415.2MB. Free memory was 156.4MB in the beginning and 151.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:01:52,412 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.29ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.95ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 29.9MB in the beginning and 59.7MB in the end (delta: -29.8MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.74ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 57.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.05ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 55.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.96ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 38.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20650.49ms. Allocated memory was 83.9MB in the beginning and 415.2MB in the end (delta: 331.4MB). Free memory was 38.4MB in the beginning and 156.4MB in the end (delta: -118.0MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. * Witness Printer took 106.01ms. Allocated memory is still 415.2MB. Free memory was 156.4MB in the beginning and 151.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 732 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 274 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 825 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 803 ConstructedInterpolants, 80 QuantifiedInterpolants, 5410 SizeOfPredicates, 49 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3855/4104 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((var_1_1 != 1) || (0 != cond)) RESULT: Ultimate proved your program to be correct! [2024-10-13 05:01:52,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE