./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.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 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:31:03,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:31:03,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:31:03,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:31:03,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:31:03,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:31:03,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:31:03,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:31:03,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:31:03,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:31:03,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:31:03,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:31:03,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:31:03,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:31:03,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:31:03,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:31:03,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:31:03,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:31:03,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:31:03,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:31:03,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:31:03,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:31:03,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:31:03,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:31:03,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:31:03,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:31:03,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:31:03,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:31:03,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:31:03,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:31:03,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:31:03,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:31:03,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:31:03,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:31:03,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:31:03,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:31:03,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:31:03,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:31:03,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:31:03,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:31:03,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:31:03,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:31:03,470 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 -> 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 [2024-11-10 08:31:03,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:31:03,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:31:03,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:31:03,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:31:03,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:31:03,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2024-11-10 08:31:05,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:31:05,529 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:31:05,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2024-11-10 08:31:05,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8e14210/812f5172e49247a48fd07bccdff6fcda/FLAG4b340b7cb [2024-11-10 08:31:05,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8e14210/812f5172e49247a48fd07bccdff6fcda [2024-11-10 08:31:05,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:31:05,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:31:05,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:31:05,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:31:05,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:31:05,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13507d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05, skipping insertion in model container [2024-11-10 08:31:05,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:31:05,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i[915,928] [2024-11-10 08:31:05,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:31:05,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:31:05,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i[915,928] [2024-11-10 08:31:05,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:31:05,911 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:31:05,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05 WrapperNode [2024-11-10 08:31:05,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:31:05,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:31:05,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:31:05,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:31:05,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,976 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-10 08:31:05,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:31:05,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:31:05,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:31:05,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:31:05,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:05,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:31:06,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:31:06,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:31:06,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:31:06,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:31:06,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (1/1) ... [2024-11-10 08:31:06,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:31:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:06,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:31:06,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:31:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:31:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:31:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:31:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:31:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:31:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:31:06,252 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:31:06,258 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:31:06,526 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc property_#t~bitwise10#1;havoc property_#t~short11#1; [2024-11-10 08:31:06,555 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 08:31:06,555 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:31:06,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:31:06,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:31:06,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:31:06 BoogieIcfgContainer [2024-11-10 08:31:06,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:31:06,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:31:06,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:31:06,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:31:06,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:31:05" (1/3) ... [2024-11-10 08:31:06,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bfa033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:31:06, skipping insertion in model container [2024-11-10 08:31:06,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:31:05" (2/3) ... [2024-11-10 08:31:06,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bfa033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:31:06, skipping insertion in model container [2024-11-10 08:31:06,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:31:06" (3/3) ... [2024-11-10 08:31:06,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-22.i [2024-11-10 08:31:06,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:31:06,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:31:06,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:31:06,692 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;@4d4ad907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:31:06,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:31:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:31:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 08:31:06,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:06,710 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:06,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 57551535, now seen corresponding path program 1 times [2024-11-10 08:31:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333263185] [2024-11-10 08:31:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:07,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333263185] [2024-11-10 08:31:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333263185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:31:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549589247] [2024-11-10 08:31:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:07,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:31:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:31:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:31:07,093 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:31:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:07,121 INFO L93 Difference]: Finished difference Result 92 states and 140 transitions. [2024-11-10 08:31:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:31:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-11-10 08:31:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:07,131 INFO L225 Difference]: With dead ends: 92 [2024-11-10 08:31:07,131 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 08:31:07,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:31:07,140 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:07,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:31:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 08:31:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 08:31:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:31:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-11-10 08:31:07,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 60 [2024-11-10 08:31:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:07,211 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-10 08:31:07,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:31:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2024-11-10 08:31:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 08:31:07,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:07,219 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:07,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:31:07,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash -792618965, now seen corresponding path program 1 times [2024-11-10 08:31:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425038568] [2024-11-10 08:31:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425038568] [2024-11-10 08:31:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425038568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:08,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:31:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860893457] [2024-11-10 08:31:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:31:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:31:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:31:08,016 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:08,294 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2024-11-10 08:31:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:31:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-10 08:31:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:08,297 INFO L225 Difference]: With dead ends: 150 [2024-11-10 08:31:08,297 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 08:31:08,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:31:08,300 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 110 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:08,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 170 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 08:31:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2024-11-10 08:31:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 58 states have internal predecessors, (72), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:31:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-11-10 08:31:08,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 60 [2024-11-10 08:31:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:08,318 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-11-10 08:31:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2024-11-10 08:31:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 08:31:08,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:08,320 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:31:08,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:08,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1254550762, now seen corresponding path program 1 times [2024-11-10 08:31:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926303808] [2024-11-10 08:31:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926303808] [2024-11-10 08:31:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926303808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:08,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:31:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111029387] [2024-11-10 08:31:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:31:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:31:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:31:08,712 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:08,871 INFO L93 Difference]: Finished difference Result 143 states and 191 transitions. [2024-11-10 08:31:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:31:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-10 08:31:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:08,875 INFO L225 Difference]: With dead ends: 143 [2024-11-10 08:31:08,875 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 08:31:08,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11-10 08:31:08,877 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:08,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 153 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:31:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 08:31:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2024-11-10 08:31:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:31:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2024-11-10 08:31:08,896 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 61 [2024-11-10 08:31:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:08,897 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2024-11-10 08:31:08,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2024-11-10 08:31:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 08:31:08,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:08,898 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:31:08,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash -387979748, now seen corresponding path program 1 times [2024-11-10 08:31:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863382028] [2024-11-10 08:31:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863382028] [2024-11-10 08:31:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863382028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:09,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:09,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:31:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705808799] [2024-11-10 08:31:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:31:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:31:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:31:09,236 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:09,471 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2024-11-10 08:31:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:31:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-10 08:31:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:09,473 INFO L225 Difference]: With dead ends: 206 [2024-11-10 08:31:09,474 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 08:31:09,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:31:09,478 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 106 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:09,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 227 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 08:31:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2024-11-10 08:31:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:31:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-10 08:31:09,508 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 61 [2024-11-10 08:31:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:09,509 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-10 08:31:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-10 08:31:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 08:31:09,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:09,512 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:09,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:31:09,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash -893538373, now seen corresponding path program 1 times [2024-11-10 08:31:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383046624] [2024-11-10 08:31:09,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383046624] [2024-11-10 08:31:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383046624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:09,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:31:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62007046] [2024-11-10 08:31:09,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:31:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:31:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:09,582 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:09,614 INFO L93 Difference]: Finished difference Result 194 states and 257 transitions. [2024-11-10 08:31:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:31:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-10 08:31:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:09,616 INFO L225 Difference]: With dead ends: 194 [2024-11-10 08:31:09,616 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 08:31:09,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:09,620 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:09,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:31:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 08:31:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 125. [2024-11-10 08:31:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.24) internal successors, (124), 100 states have internal predecessors, (124), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:31:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-10 08:31:09,654 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 61 [2024-11-10 08:31:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-10 08:31:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-10 08:31:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 08:31:09,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:09,656 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:31:09,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:09,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1595636923, now seen corresponding path program 1 times [2024-11-10 08:31:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67004560] [2024-11-10 08:31:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:11,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67004560] [2024-11-10 08:31:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67004560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:11,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:11,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:31:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008158882] [2024-11-10 08:31:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:11,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:31:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:31:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:31:11,052 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:11,334 INFO L93 Difference]: Finished difference Result 357 states and 468 transitions. [2024-11-10 08:31:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:31:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2024-11-10 08:31:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:11,338 INFO L225 Difference]: With dead ends: 357 [2024-11-10 08:31:11,338 INFO L226 Difference]: Without dead ends: 255 [2024-11-10 08:31:11,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:31:11,342 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 211 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:11,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 325 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-10 08:31:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 116. [2024-11-10 08:31:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 91 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:31:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2024-11-10 08:31:11,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 62 [2024-11-10 08:31:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2024-11-10 08:31:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2024-11-10 08:31:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 08:31:11,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:11,398 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:31:11,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:11,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1984400745, now seen corresponding path program 1 times [2024-11-10 08:31:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288771022] [2024-11-10 08:31:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288771022] [2024-11-10 08:31:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288771022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:31:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747462826] [2024-11-10 08:31:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:11,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:31:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:31:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:11,503 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:11,554 INFO L93 Difference]: Finished difference Result 288 states and 381 transitions. [2024-11-10 08:31:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:31:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2024-11-10 08:31:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:11,557 INFO L225 Difference]: With dead ends: 288 [2024-11-10 08:31:11,557 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 08:31:11,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:11,561 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:11,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:31:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 08:31:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-10 08:31:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.205298013245033) internal successors, (182), 151 states have internal predecessors, (182), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 08:31:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2024-11-10 08:31:11,588 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 62 [2024-11-10 08:31:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:11,589 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2024-11-10 08:31:11,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2024-11-10 08:31:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 08:31:11,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:11,592 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:11,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:31:11,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:11,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1066285672, now seen corresponding path program 1 times [2024-11-10 08:31:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242396231] [2024-11-10 08:31:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:12,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242396231] [2024-11-10 08:31:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242396231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:12,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:31:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237219168] [2024-11-10 08:31:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:12,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:31:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:31:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:31:12,922 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:31:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:13,308 INFO L93 Difference]: Finished difference Result 411 states and 528 transitions. [2024-11-10 08:31:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:31:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-11-10 08:31:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:13,311 INFO L225 Difference]: With dead ends: 411 [2024-11-10 08:31:13,311 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 08:31:13,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:31:13,317 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 267 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:13,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 518 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 08:31:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 247. [2024-11-10 08:31:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 198 states have internal predecessors, (242), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 08:31:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2024-11-10 08:31:13,348 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 63 [2024-11-10 08:31:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:13,348 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2024-11-10 08:31:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:31:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2024-11-10 08:31:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 08:31:13,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:13,350 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:13,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:31:13,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1359688679, now seen corresponding path program 1 times [2024-11-10 08:31:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269873162] [2024-11-10 08:31:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:13,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269873162] [2024-11-10 08:31:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269873162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:13,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:13,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:31:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15974906] [2024-11-10 08:31:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:13,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:31:13,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:31:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:13,413 INFO L87 Difference]: Start difference. First operand 247 states and 326 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:13,454 INFO L93 Difference]: Finished difference Result 387 states and 509 transitions. [2024-11-10 08:31:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:31:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2024-11-10 08:31:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:13,457 INFO L225 Difference]: With dead ends: 387 [2024-11-10 08:31:13,457 INFO L226 Difference]: Without dead ends: 163 [2024-11-10 08:31:13,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:31:13,460 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:13,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:31:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-10 08:31:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2024-11-10 08:31:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 119 states have internal predecessors, (138), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 08:31:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 194 transitions. [2024-11-10 08:31:13,476 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 194 transitions. Word has length 63 [2024-11-10 08:31:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 194 transitions. [2024-11-10 08:31:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2024-11-10 08:31:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 08:31:13,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:13,477 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:31:13,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:13,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -886784451, now seen corresponding path program 1 times [2024-11-10 08:31:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:13,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438801339] [2024-11-10 08:31:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438801339] [2024-11-10 08:31:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438801339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:31:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825211824] [2024-11-10 08:31:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:31:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:31:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:31:14,461 INFO L87 Difference]: Start difference. First operand 152 states and 194 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:15,139 INFO L93 Difference]: Finished difference Result 239 states and 300 transitions. [2024-11-10 08:31:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:31:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2024-11-10 08:31:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:15,142 INFO L225 Difference]: With dead ends: 239 [2024-11-10 08:31:15,142 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 08:31:15,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-10 08:31:15,144 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 214 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:15,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 448 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:31:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 08:31:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 168. [2024-11-10 08:31:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.162962962962963) internal successors, (157), 135 states have internal predecessors, (157), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 08:31:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2024-11-10 08:31:15,159 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 65 [2024-11-10 08:31:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:15,160 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2024-11-10 08:31:15,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2024-11-10 08:31:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 08:31:15,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:15,161 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:31:15,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2103576822, now seen corresponding path program 1 times [2024-11-10 08:31:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239592008] [2024-11-10 08:31:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:31:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239592008] [2024-11-10 08:31:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239592008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:31:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527082706] [2024-11-10 08:31:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:31:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:31:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:31:15,802 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:16,092 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2024-11-10 08:31:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:31:16,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2024-11-10 08:31:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:16,095 INFO L225 Difference]: With dead ends: 177 [2024-11-10 08:31:16,095 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 08:31:16,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:31:16,096 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:16,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 466 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 08:31:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-11-10 08:31:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.1594202898550725) internal successors, (160), 138 states have internal predecessors, (160), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 08:31:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 216 transitions. [2024-11-10 08:31:16,116 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 216 transitions. Word has length 66 [2024-11-10 08:31:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:16,117 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 216 transitions. [2024-11-10 08:31:16,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 216 transitions. [2024-11-10 08:31:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:31:16,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:16,120 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:16,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 08:31:16,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:16,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 990101959, now seen corresponding path program 1 times [2024-11-10 08:31:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905052353] [2024-11-10 08:31:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:31:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905052353] [2024-11-10 08:31:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905052353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796130702] [2024-11-10 08:31:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:16,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:16,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:16,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:31:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:17,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 08:31:17,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 216 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-10 08:31:17,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:31:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:31:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796130702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:31:21,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:31:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-10 08:31:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176608352] [2024-11-10 08:31:21,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:31:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 08:31:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 08:31:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-10 08:31:21,677 INFO L87 Difference]: Start difference. First operand 171 states and 216 transitions. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-10 08:31:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:27,220 INFO L93 Difference]: Finished difference Result 916 states and 1113 transitions. [2024-11-10 08:31:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 08:31:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 121 [2024-11-10 08:31:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:27,226 INFO L225 Difference]: With dead ends: 916 [2024-11-10 08:31:27,226 INFO L226 Difference]: Without dead ends: 820 [2024-11-10 08:31:27,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3027 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1469, Invalid=6721, Unknown=0, NotChecked=0, Total=8190 [2024-11-10 08:31:27,231 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1181 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:27,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1581 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 08:31:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-10 08:31:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 392. [2024-11-10 08:31:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 303 states have internal predecessors, (351), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 505 transitions. [2024-11-10 08:31:27,284 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 505 transitions. Word has length 121 [2024-11-10 08:31:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:27,285 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 505 transitions. [2024-11-10 08:31:27,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-10 08:31:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 505 transitions. [2024-11-10 08:31:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:31:27,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:27,287 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:27,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 08:31:27,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 08:31:27,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1824776966, now seen corresponding path program 1 times [2024-11-10 08:31:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418974748] [2024-11-10 08:31:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:31:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418974748] [2024-11-10 08:31:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418974748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811962691] [2024-11-10 08:31:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:28,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:31:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:29,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 08:31:29,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:29,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:31:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811962691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:31:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-11-10 08:31:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472181612] [2024-11-10 08:31:29,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:29,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:31:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:31:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:31:29,789 INFO L87 Difference]: Start difference. First operand 392 states and 505 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:29,955 INFO L93 Difference]: Finished difference Result 756 states and 971 transitions. [2024-11-10 08:31:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:31:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-10 08:31:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:29,960 INFO L225 Difference]: With dead ends: 756 [2024-11-10 08:31:29,960 INFO L226 Difference]: Without dead ends: 516 [2024-11-10 08:31:29,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:31:29,963 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:29,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 186 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:31:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-10 08:31:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 417. [2024-11-10 08:31:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 328 states have (on average 1.1615853658536586) internal successors, (381), 328 states have internal predecessors, (381), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2024-11-10 08:31:30,005 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 122 [2024-11-10 08:31:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2024-11-10 08:31:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2024-11-10 08:31:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:31:30,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:30,009 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:30,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 08:31:30,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-10 08:31:30,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:30,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 930841764, now seen corresponding path program 1 times [2024-11-10 08:31:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362149349] [2024-11-10 08:31:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362149349] [2024-11-10 08:31:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362149349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:31,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:31:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025728056] [2024-11-10 08:31:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:31,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:31:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:31:31,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:31:31,165 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:31,416 INFO L93 Difference]: Finished difference Result 774 states and 989 transitions. [2024-11-10 08:31:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:31:31,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-10 08:31:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:31,421 INFO L225 Difference]: With dead ends: 774 [2024-11-10 08:31:31,421 INFO L226 Difference]: Without dead ends: 516 [2024-11-10 08:31:31,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:31:31,423 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:31,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 246 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-10 08:31:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 412. [2024-11-10 08:31:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 323 states have (on average 1.1578947368421053) internal successors, (374), 323 states have internal predecessors, (374), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 528 transitions. [2024-11-10 08:31:31,463 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 528 transitions. Word has length 123 [2024-11-10 08:31:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:31,463 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 528 transitions. [2024-11-10 08:31:31,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 528 transitions. [2024-11-10 08:31:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:31:31,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:31,466 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:31,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 08:31:31,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:31,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1804321837, now seen corresponding path program 1 times [2024-11-10 08:31:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201766558] [2024-11-10 08:31:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:31:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:31:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:31:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:31:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:31:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:31:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:31:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201766558] [2024-11-10 08:31:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201766558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:31:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291993194] [2024-11-10 08:31:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:31:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:31:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:31:32,124 INFO L87 Difference]: Start difference. First operand 412 states and 528 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:32,298 INFO L93 Difference]: Finished difference Result 665 states and 846 transitions. [2024-11-10 08:31:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:31:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-10 08:31:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:32,302 INFO L225 Difference]: With dead ends: 665 [2024-11-10 08:31:32,303 INFO L226 Difference]: Without dead ends: 500 [2024-11-10 08:31:32,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:31:32,304 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 80 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 199 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:31:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-10 08:31:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 422. [2024-11-10 08:31:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 333 states have (on average 1.1531531531531531) internal successors, (384), 333 states have internal predecessors, (384), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 538 transitions. [2024-11-10 08:31:32,342 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 538 transitions. Word has length 123 [2024-11-10 08:31:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:32,343 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 538 transitions. [2024-11-10 08:31:32,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2024-11-10 08:31:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 08:31:32,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:32,345 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:32,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 08:31:32,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:32,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:32,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1742398574, now seen corresponding path program 1 times [2024-11-10 08:31:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845854152] [2024-11-10 08:31:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:31:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:31:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:31:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:31:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:31:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:31:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:31:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:31:33,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845854152] [2024-11-10 08:31:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845854152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301992657] [2024-11-10 08:31:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:33,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:33,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:33,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:33,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 08:31:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:33,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:31:33,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:34,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:31:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301992657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:31:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 13 [2024-11-10 08:31:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067729271] [2024-11-10 08:31:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:31:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:31:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:31:34,810 INFO L87 Difference]: Start difference. First operand 422 states and 538 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:34,988 INFO L93 Difference]: Finished difference Result 664 states and 838 transitions. [2024-11-10 08:31:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:31:34,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 124 [2024-11-10 08:31:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:34,993 INFO L225 Difference]: With dead ends: 664 [2024-11-10 08:31:34,994 INFO L226 Difference]: Without dead ends: 497 [2024-11-10 08:31:34,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:31:34,995 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:34,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:31:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-10 08:31:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 422. [2024-11-10 08:31:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 333 states have (on average 1.15015015015015) internal successors, (383), 333 states have internal predecessors, (383), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 537 transitions. [2024-11-10 08:31:35,055 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 537 transitions. Word has length 124 [2024-11-10 08:31:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:35,055 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 537 transitions. [2024-11-10 08:31:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-11-10 08:31:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 08:31:35,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:35,057 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:35,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 08:31:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:35,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:35,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1800195176, now seen corresponding path program 1 times [2024-11-10 08:31:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470259223] [2024-11-10 08:31:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:35,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470259223] [2024-11-10 08:31:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470259223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:35,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:31:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23172146] [2024-11-10 08:31:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:35,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:31:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:31:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:31:35,949 INFO L87 Difference]: Start difference. First operand 422 states and 537 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:36,380 INFO L93 Difference]: Finished difference Result 633 states and 802 transitions. [2024-11-10 08:31:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:31:36,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 125 [2024-11-10 08:31:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:36,385 INFO L225 Difference]: With dead ends: 633 [2024-11-10 08:31:36,385 INFO L226 Difference]: Without dead ends: 630 [2024-11-10 08:31:36,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:31:36,386 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 72 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:36,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 518 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-10 08:31:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 472. [2024-11-10 08:31:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 383 states have (on average 1.1462140992167102) internal successors, (439), 383 states have internal predecessors, (439), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 593 transitions. [2024-11-10 08:31:36,428 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 593 transitions. Word has length 125 [2024-11-10 08:31:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:36,432 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 593 transitions. [2024-11-10 08:31:36,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 593 transitions. [2024-11-10 08:31:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 08:31:36,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:36,435 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:36,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 08:31:36,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:36,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1364925013, now seen corresponding path program 1 times [2024-11-10 08:31:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:36,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434320980] [2024-11-10 08:31:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:31:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:31:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:31:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:31:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:31:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:31:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:31:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:31:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434320980] [2024-11-10 08:31:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434320980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822917970] [2024-11-10 08:31:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:37,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:37,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:37,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 08:31:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:37,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 08:31:37,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 127 proven. 165 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-10 08:31:37,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:31:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 22 proven. 47 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 08:31:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822917970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:31:38,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:31:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 23 [2024-11-10 08:31:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766331971] [2024-11-10 08:31:38,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:31:38,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 08:31:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 08:31:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-10 08:31:38,236 INFO L87 Difference]: Start difference. First operand 472 states and 593 transitions. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) [2024-11-10 08:31:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:43,304 INFO L93 Difference]: Finished difference Result 1461 states and 1712 transitions. [2024-11-10 08:31:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-11-10 08:31:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) Word has length 125 [2024-11-10 08:31:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:43,314 INFO L225 Difference]: With dead ends: 1461 [2024-11-10 08:31:43,314 INFO L226 Difference]: Without dead ends: 1257 [2024-11-10 08:31:43,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8764 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3602, Invalid=18154, Unknown=0, NotChecked=0, Total=21756 [2024-11-10 08:31:43,323 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1575 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:43,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 928 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 08:31:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-10 08:31:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 632. [2024-11-10 08:31:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 499 states have (on average 1.1182364729458918) internal successors, (558), 499 states have internal predecessors, (558), 91 states have call successors, (91), 41 states have call predecessors, (91), 41 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-10 08:31:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 740 transitions. [2024-11-10 08:31:43,436 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 740 transitions. Word has length 125 [2024-11-10 08:31:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:43,437 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 740 transitions. [2024-11-10 08:31:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) [2024-11-10 08:31:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 740 transitions. [2024-11-10 08:31:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 08:31:43,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:43,439 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:43,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 08:31:43,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 08:31:43,644 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:43,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -666400369, now seen corresponding path program 1 times [2024-11-10 08:31:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007670443] [2024-11-10 08:31:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:31:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:31:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:31:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:31:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:31:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:31:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:31:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-10 08:31:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007670443] [2024-11-10 08:31:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007670443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:31:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499317852] [2024-11-10 08:31:44,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:44,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:31:44,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:31:44,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:31:44,278 INFO L87 Difference]: Start difference. First operand 632 states and 740 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:44,501 INFO L93 Difference]: Finished difference Result 1048 states and 1228 transitions. [2024-11-10 08:31:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:31:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 125 [2024-11-10 08:31:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:44,505 INFO L225 Difference]: With dead ends: 1048 [2024-11-10 08:31:44,506 INFO L226 Difference]: Without dead ends: 656 [2024-11-10 08:31:44,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:31:44,509 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 56 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:44,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 158 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:31:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-10 08:31:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 614. [2024-11-10 08:31:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 481 states have (on average 1.1081081081081081) internal successors, (533), 481 states have internal predecessors, (533), 91 states have call successors, (91), 41 states have call predecessors, (91), 41 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-10 08:31:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 715 transitions. [2024-11-10 08:31:44,611 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 715 transitions. Word has length 125 [2024-11-10 08:31:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:44,612 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 715 transitions. [2024-11-10 08:31:44,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 715 transitions. [2024-11-10 08:31:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 08:31:44,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:44,614 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 08:31:44,614 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 432884862, now seen corresponding path program 1 times [2024-11-10 08:31:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363536157] [2024-11-10 08:31:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-11-10 08:31:46,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:46,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363536157] [2024-11-10 08:31:46,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363536157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:46,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030053770] [2024-11-10 08:31:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:46,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:46,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 08:31:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:47,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 08:31:47,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-10 08:31:47,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:31:47,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030053770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:31:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 23 [2024-11-10 08:31:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641012690] [2024-11-10 08:31:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:31:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:31:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-10 08:31:47,291 INFO L87 Difference]: Start difference. First operand 614 states and 715 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:47,593 INFO L93 Difference]: Finished difference Result 880 states and 1019 transitions. [2024-11-10 08:31:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:31:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 126 [2024-11-10 08:31:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:47,598 INFO L225 Difference]: With dead ends: 880 [2024-11-10 08:31:47,599 INFO L226 Difference]: Without dead ends: 877 [2024-11-10 08:31:47,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-11-10 08:31:47,600 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 91 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:47,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 496 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-10 08:31:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 640. [2024-11-10 08:31:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 507 states have (on average 1.1045364891518739) internal successors, (560), 507 states have internal predecessors, (560), 91 states have call successors, (91), 41 states have call predecessors, (91), 41 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-10 08:31:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 742 transitions. [2024-11-10 08:31:47,694 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 742 transitions. Word has length 126 [2024-11-10 08:31:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:47,694 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 742 transitions. [2024-11-10 08:31:47,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 742 transitions. [2024-11-10 08:31:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 08:31:47,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:47,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:47,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 08:31:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:47,901 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:47,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 561967581, now seen corresponding path program 1 times [2024-11-10 08:31:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803088534] [2024-11-10 08:31:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:31:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:31:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:31:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:31:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:31:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:31:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:31:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-10 08:31:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803088534] [2024-11-10 08:31:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803088534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:31:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054850867] [2024-11-10 08:31:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:31:49,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:31:49,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 08:31:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:49,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 08:31:49,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:31:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-10 08:31:51,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:31:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054850867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:31:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2024-11-10 08:31:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157858373] [2024-11-10 08:31:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 08:31:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 08:31:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-10 08:31:51,432 INFO L87 Difference]: Start difference. First operand 640 states and 742 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:51,818 INFO L93 Difference]: Finished difference Result 1146 states and 1330 transitions. [2024-11-10 08:31:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 08:31:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 126 [2024-11-10 08:31:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:51,826 INFO L225 Difference]: With dead ends: 1146 [2024-11-10 08:31:51,826 INFO L226 Difference]: Without dead ends: 801 [2024-11-10 08:31:51,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-10 08:31:51,829 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 63 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:51,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 622 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:31:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-10 08:31:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 529. [2024-11-10 08:31:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.105515587529976) internal successors, (461), 417 states have internal predecessors, (461), 77 states have call successors, (77), 34 states have call predecessors, (77), 34 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-10 08:31:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 615 transitions. [2024-11-10 08:31:51,917 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 615 transitions. Word has length 126 [2024-11-10 08:31:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:51,917 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 615 transitions. [2024-11-10 08:31:51,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 615 transitions. [2024-11-10 08:31:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 08:31:51,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:31:51,919 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:51,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 08:31:52,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:31:52,120 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:31:52,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:31:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1150902388, now seen corresponding path program 1 times [2024-11-10 08:31:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:31:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182852131] [2024-11-10 08:31:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:31:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:31:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:31:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:31:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:31:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:31:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:31:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:31:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:31:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:31:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:31:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:31:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:31:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:31:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:31:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:31:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:31:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-10 08:31:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:31:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182852131] [2024-11-10 08:31:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182852131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:31:52,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:31:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:31:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388111398] [2024-11-10 08:31:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:31:52,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:31:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:31:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:31:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:31:52,797 INFO L87 Difference]: Start difference. First operand 529 states and 615 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:31:53,349 INFO L93 Difference]: Finished difference Result 786 states and 920 transitions. [2024-11-10 08:31:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:31:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 127 [2024-11-10 08:31:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:31:53,351 INFO L225 Difference]: With dead ends: 786 [2024-11-10 08:31:53,351 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:31:53,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-10 08:31:53,353 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 104 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:31:53,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 481 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:31:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:31:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:31:53,354 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-11-10 08:31:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:31:53,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2024-11-10 08:31:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:31:53,355 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:31:53,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:31:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:31:53,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:31:53,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:31:53,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 08:31:53,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:31:53,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.