./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_variablewrapping_wrapper-sp_file-62.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 02f4d89ad8ae68bf7980f37a0875d8dc9742c5b53631541ef266f31c83f1917f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:19:43,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:19:43,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:19:43,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:19:43,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:19:43,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:19:43,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:19:43,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:19:43,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:19:43,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:19:43,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:19:43,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:19:43,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:19:43,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:19:43,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:19:43,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:19:43,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:19:43,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:19:43,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:19:43,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:19:43,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:19:43,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:19:43,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:19:43,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:19:43,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:19:43,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:19:43,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:19:43,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:19:43,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:19:43,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:19:43,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:19:43,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:19:43,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:43,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:19:43,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:19:43,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:19:43,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:19:43,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:19:43,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:19:43,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:19:43,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:19:43,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:19:43,488 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 -> 02f4d89ad8ae68bf7980f37a0875d8dc9742c5b53631541ef266f31c83f1917f [2024-11-19 01:19:43,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:19:43,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:19:43,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:19:43,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:19:43,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:19:43,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-19 01:19:44,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:19:45,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:19:45,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-19 01:19:45,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311c6484c/014ba224b68f46aea6f88ff9610039a8/FLAG1506984b2 [2024-11-19 01:19:45,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311c6484c/014ba224b68f46aea6f88ff9610039a8 [2024-11-19 01:19:45,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:19:45,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:19:45,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:45,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:19:45,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:19:45,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37188372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45, skipping insertion in model container [2024-11-19 01:19:45,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:19:45,732 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_variablewrapping_wrapper-sp_file-62.i[917,930] [2024-11-19 01:19:45,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:45,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:19:45,810 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_variablewrapping_wrapper-sp_file-62.i[917,930] [2024-11-19 01:19:45,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:45,852 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:19:45,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45 WrapperNode [2024-11-19 01:19:45,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:45,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:45,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:19:45,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:19:45,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,902 INFO L138 Inliner]: procedures = 27, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 333 [2024-11-19 01:19:45,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:45,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:19:45,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:19:45,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:19:45,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,933 INFO L175 MemorySlicer]: Split 88 memory accesses to 2 slices as follows [2, 86]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-19 01:19:45,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:19:45,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:19:45,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:19:45,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:19:45,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (1/1) ... [2024-11-19 01:19:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:45,986 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-19 01:19:45,990 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-19 01:19:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:19:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:19:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:19:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:19:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:19:46,133 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:19:46,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:19:46,436 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-19 01:19:46,436 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:19:46,455 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:19:46,455 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:19:46,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:46 BoogieIcfgContainer [2024-11-19 01:19:46,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:19:46,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:19:46,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:19:46,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:19:46,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:19:45" (1/3) ... [2024-11-19 01:19:46,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:46, skipping insertion in model container [2024-11-19 01:19:46,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:45" (2/3) ... [2024-11-19 01:19:46,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:46, skipping insertion in model container [2024-11-19 01:19:46,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:46" (3/3) ... [2024-11-19 01:19:46,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-62.i [2024-11-19 01:19:46,479 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:19:46,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:19:46,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:19:46,527 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;@668962ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:19:46,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:19:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 01:19:46,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:46,538 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:46,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -256564704, now seen corresponding path program 1 times [2024-11-19 01:19:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700947135] [2024-11-19 01:19:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:19:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700947135] [2024-11-19 01:19:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700947135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096249549] [2024-11-19 01:19:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:46,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:46,780 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-19 01:19:46,781 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-19 01:19:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:46,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:19:46,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:19:46,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096249549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:19:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:19:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447759893] [2024-11-19 01:19:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:46,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:19:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:19:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:19:46,981 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:19:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:47,004 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2024-11-19 01:19:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:19:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-11-19 01:19:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:47,012 INFO L225 Difference]: With dead ends: 139 [2024-11-19 01:19:47,012 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 01:19:47,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-19 01:19:47,019 INFO L432 NwaCegarLoop]: 97 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, 97 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-19 01:19:47,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 01:19:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 01:19:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-11-19 01:19:47,057 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2024-11-19 01:19:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-11-19 01:19:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:19:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-11-19 01:19:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 01:19:47,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:47,060 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:47,073 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-19 01:19:47,264 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,SelfDestructingSolverStorable0 [2024-11-19 01:19:47,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1770871312, now seen corresponding path program 1 times [2024-11-19 01:19:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040231086] [2024-11-19 01:19:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:47,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040231086] [2024-11-19 01:19:47,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040231086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:47,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718621374] [2024-11-19 01:19:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:47,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:47,520 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:47,558 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2024-11-19 01:19:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-19 01:19:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:47,560 INFO L225 Difference]: With dead ends: 138 [2024-11-19 01:19:47,560 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 01:19:47,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:47,561 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:47,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 01:19:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-19 01:19:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-19 01:19:47,570 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2024-11-19 01:19:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:47,572 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-19 01:19:47,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-19 01:19:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 01:19:47,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:47,575 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:47,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:19:47,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:47,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash -749088622, now seen corresponding path program 1 times [2024-11-19 01:19:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981842125] [2024-11-19 01:19:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981842125] [2024-11-19 01:19:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981842125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47758004] [2024-11-19 01:19:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:47,699 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:47,727 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-19 01:19:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-19 01:19:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:47,730 INFO L225 Difference]: With dead ends: 142 [2024-11-19 01:19:47,730 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 01:19:47,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:47,732 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:47,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 01:19:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-19 01:19:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-19 01:19:47,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2024-11-19 01:19:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-19 01:19:47,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-19 01:19:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 01:19:47,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:47,749 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:19:47,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:47,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash -747241580, now seen corresponding path program 1 times [2024-11-19 01:19:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143909080] [2024-11-19 01:19:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143909080] [2024-11-19 01:19:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143909080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:48,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:19:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956618432] [2024-11-19 01:19:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:19:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:19:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:48,260 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:48,443 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2024-11-19 01:19:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:48,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-19 01:19:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:48,445 INFO L225 Difference]: With dead ends: 181 [2024-11-19 01:19:48,445 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:19:48,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:48,446 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 223 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:48,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 195 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:19:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2024-11-19 01:19:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-19 01:19:48,457 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 73 [2024-11-19 01:19:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:48,458 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-19 01:19:48,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-19 01:19:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 01:19:48,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:48,459 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:19:48,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -991247921, now seen corresponding path program 1 times [2024-11-19 01:19:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382234066] [2024-11-19 01:19:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382234066] [2024-11-19 01:19:48,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382234066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:48,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:48,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:19:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081571633] [2024-11-19 01:19:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:48,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:19:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:19:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:48,827 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:49,062 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2024-11-19 01:19:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-19 01:19:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:49,063 INFO L225 Difference]: With dead ends: 192 [2024-11-19 01:19:49,064 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 01:19:49,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:19:49,065 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 202 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:49,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 653 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 01:19:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2024-11-19 01:19:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-19 01:19:49,072 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 75 [2024-11-19 01:19:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:49,072 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-19 01:19:49,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-19 01:19:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 01:19:49,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:49,074 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:49,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:19:49,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:49,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash -387496087, now seen corresponding path program 1 times [2024-11-19 01:19:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205224110] [2024-11-19 01:19:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205224110] [2024-11-19 01:19:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205224110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:19:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550699299] [2024-11-19 01:19:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:19:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:19:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:19:49,782 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:19:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:50,016 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2024-11-19 01:19:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-19 01:19:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:50,017 INFO L225 Difference]: With dead ends: 169 [2024-11-19 01:19:50,017 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 01:19:50,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:19:50,018 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:50,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 288 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 01:19:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-19 01:19:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2024-11-19 01:19:50,025 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2024-11-19 01:19:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2024-11-19 01:19:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:19:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2024-11-19 01:19:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 01:19:50,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:50,028 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:50,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:19:50,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 184374234, now seen corresponding path program 1 times [2024-11-19 01:19:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:50,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275013284] [2024-11-19 01:19:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 01:19:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275013284] [2024-11-19 01:19:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275013284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946470229] [2024-11-19 01:19:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:50,147 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-19 01:19:50,148 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-19 01:19:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:50,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:19:50,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:50,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946470229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:19:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:19:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244840903] [2024-11-19 01:19:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:50,283 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:50,305 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2024-11-19 01:19:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:50,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-19 01:19:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:50,306 INFO L225 Difference]: With dead ends: 166 [2024-11-19 01:19:50,307 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 01:19:50,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:50,308 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:50,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 01:19:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 01:19:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-11-19 01:19:50,322 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 77 [2024-11-19 01:19:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:50,323 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-11-19 01:19:50,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-19 01:19:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 01:19:50,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:50,325 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:50,341 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-19 01:19:50,525 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,SelfDestructingSolverStorable6 [2024-11-19 01:19:50,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:50,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 376483499, now seen corresponding path program 1 times [2024-11-19 01:19:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627573647] [2024-11-19 01:19:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627573647] [2024-11-19 01:19:51,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627573647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:51,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:51,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:19:51,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665680941] [2024-11-19 01:19:51,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:51,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:19:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:19:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:51,632 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 01:19:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:51,994 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2024-11-19 01:19:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2024-11-19 01:19:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:52,016 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:19:52,016 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 01:19:52,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:19:52,018 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 261 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:52,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 284 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 01:19:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2024-11-19 01:19:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2024-11-19 01:19:52,034 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2024-11-19 01:19:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2024-11-19 01:19:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 01:19:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2024-11-19 01:19:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 01:19:52,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:52,037 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:19:52,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:52,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1126787172, now seen corresponding path program 1 times [2024-11-19 01:19:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435460757] [2024-11-19 01:19:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435460757] [2024-11-19 01:19:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435460757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:19:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382474408] [2024-11-19 01:19:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:52,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:19:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:19:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:19:52,394 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:52,645 INFO L93 Difference]: Finished difference Result 213 states and 286 transitions. [2024-11-19 01:19:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-19 01:19:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:52,647 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:19:52,647 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 01:19:52,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:19:52,648 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 124 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:52,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 448 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 01:19:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 89. [2024-11-19 01:19:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-11-19 01:19:52,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 77 [2024-11-19 01:19:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:52,662 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-11-19 01:19:52,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-11-19 01:19:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 01:19:52,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:52,662 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:52,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:19:52,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash -736098379, now seen corresponding path program 1 times [2024-11-19 01:19:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:52,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431297080] [2024-11-19 01:19:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431297080] [2024-11-19 01:19:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431297080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:52,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:19:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453000306] [2024-11-19 01:19:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:19:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:19:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:52,957 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:53,178 INFO L93 Difference]: Finished difference Result 216 states and 290 transitions. [2024-11-19 01:19:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:19:53,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-19 01:19:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:53,180 INFO L225 Difference]: With dead ends: 216 [2024-11-19 01:19:53,180 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 01:19:53,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:53,181 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 118 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:53,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 341 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 01:19:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2024-11-19 01:19:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-11-19 01:19:53,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 77 [2024-11-19 01:19:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:53,192 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-11-19 01:19:53,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-11-19 01:19:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 01:19:53,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:53,193 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:53,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:19:53,193 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1071179512, now seen corresponding path program 1 times [2024-11-19 01:19:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207534724] [2024-11-19 01:19:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 01:19:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207534724] [2024-11-19 01:19:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207534724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723802798] [2024-11-19 01:19:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:53,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:53,285 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-19 01:19:53,286 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-19 01:19:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:53,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:19:53,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:53,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:19:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2024-11-19 01:19:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:53,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723802798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:19:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-19 01:19:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207638668] [2024-11-19 01:19:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:53,499 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:53,612 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2024-11-19 01:19:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-19 01:19:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:53,615 INFO L225 Difference]: With dead ends: 223 [2024-11-19 01:19:53,615 INFO L226 Difference]: Without dead ends: 134 [2024-11-19 01:19:53,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:19:53,615 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:53,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 263 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:19:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-19 01:19:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2024-11-19 01:19:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 97 states have internal predecessors, (124), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:19:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-11-19 01:19:53,624 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 79 [2024-11-19 01:19:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:53,624 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-11-19 01:19:53,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 01:19:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-11-19 01:19:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 01:19:53,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:53,626 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:19:53,642 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-19 01:19:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:53,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 818027873, now seen corresponding path program 1 times [2024-11-19 01:19:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303963746] [2024-11-19 01:19:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 01:19:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303963746] [2024-11-19 01:19:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303963746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406176261] [2024-11-19 01:19:54,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:54,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:54,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:54,696 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-19 01:19:54,697 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-19 01:19:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:54,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-19 01:19:54,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:55,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:19:56,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 01:19:56,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 01:19:57,074 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-19 01:19:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-19 01:19:57,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 79 [2024-11-19 01:19:57,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 110 [2024-11-19 01:19:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 55 [2024-11-19 01:19:57,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 162 [2024-11-19 01:19:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:57,697 INFO L349 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2024-11-19 01:19:57,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 338 treesize of output 337 [2024-11-19 01:19:58,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:58,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:19:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:20:15,289 WARN L286 SmtUtils]: Spent 16.35s on a formula simplification. DAG size of input: 1619 DAG size of output: 1253 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-19 01:20:15,290 INFO L349 Elim1Store]: treesize reduction 864, result has 74.1 percent of original size [2024-11-19 01:20:15,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 27 select indices, 27 select index equivalence classes, 6 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 372 case distinctions, treesize of input 649 treesize of output 2810