./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -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 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:57:34,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:57:34,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:57:34,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:57:34,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:57:35,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:57:35,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:57:35,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:57:35,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:57:35,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:57:35,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:57:35,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:57:35,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:57:35,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:57:35,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:57:35,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:57:35,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:57:35,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:57:35,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:57:35,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:57:35,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:57:35,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:57:35,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:57:35,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:57:35,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:57:35,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:57:35,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:57:35,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:57:35,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:57:35,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:57:35,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:57:35,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:57:35,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:57:35,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:57:35,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:57:35,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:57:35,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:57:35,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:57:35,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:57:35,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:57:35,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:57:35,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:57:35,038 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 -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-09 21:57:35,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:57:35,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:57:35,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:57:35,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:57:35,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:57:35,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-09 21:57:36,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:57:36,920 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:57:36,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-09 21:57:36,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a74c7c1b/7aa2614680a64cab9816ac5ef2ed5cf8/FLAGc018e2776 [2024-11-09 21:57:36,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a74c7c1b/7aa2614680a64cab9816ac5ef2ed5cf8 [2024-11-09 21:57:36,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:57:36,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:57:36,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:57:36,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:57:36,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:57:36,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:36" (1/1) ... [2024-11-09 21:57:36,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e9534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:36, skipping insertion in model container [2024-11-09 21:57:36,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:36" (1/1) ... [2024-11-09 21:57:36,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:57:37,124 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 21:57:37,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:57:37,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:57:37,176 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 21:57:37,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:57:37,211 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:57:37,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37 WrapperNode [2024-11-09 21:57:37,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:57:37,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:57:37,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:57:37,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:57:37,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,259 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2024-11-09 21:57:37,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:57:37,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:57:37,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:57:37,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:57:37,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,289 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-09 21:57:37,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:57:37,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:57:37,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:57:37,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:57:37,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (1/1) ... [2024-11-09 21:57:37,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:57:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:37,356 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-09 21:57:37,358 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-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:57:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:57:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 21:57:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 21:57:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-09 21:57:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-09 21:57:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-09 21:57:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-09 21:57:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:57:37,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:57:37,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:57:37,743 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: call ULTIMATE.dealloc(check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset);havoc check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset; [2024-11-09 21:57:37,788 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-09 21:57:37,788 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:57:37,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:57:37,800 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:57:37,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:57:37 BoogieIcfgContainer [2024-11-09 21:57:37,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:57:37,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:57:37,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:57:37,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:57:37,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:57:36" (1/3) ... [2024-11-09 21:57:37,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dfc43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:37, skipping insertion in model container [2024-11-09 21:57:37,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:37" (2/3) ... [2024-11-09 21:57:37,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dfc43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:37, skipping insertion in model container [2024-11-09 21:57:37,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:57:37" (3/3) ... [2024-11-09 21:57:37,810 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-09 21:57:37,830 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:57:37,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:57:37,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:57:37,895 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;@59912187, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:57:37,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:57:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 21:57:37,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:37,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-09 21:57:37,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:37,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 517961787, now seen corresponding path program 1 times [2024-11-09 21:57:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743775427] [2024-11-09 21:57:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743775427] [2024-11-09 21:57:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743775427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:57:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558211848] [2024-11-09 21:57:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:57:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:57:38,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:57:38,433 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:38,490 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2024-11-09 21:57:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:57:38,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 21:57:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:38,499 INFO L225 Difference]: With dead ends: 116 [2024-11-09 21:57:38,499 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 21:57:38,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:57:38,504 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:38,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 21:57:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 21:57:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-11-09 21:57:38,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 28 [2024-11-09 21:57:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:38,540 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-11-09 21:57:38,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-11-09 21:57:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 21:57:38,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:38,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-09 21:57:38,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:57:38,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 383948281, now seen corresponding path program 1 times [2024-11-09 21:57:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:38,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818563062] [2024-11-09 21:57:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818563062] [2024-11-09 21:57:38,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818563062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:38,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:38,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:57:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076594504] [2024-11-09 21:57:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:38,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:57:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:57:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:38,601 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:38,621 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2024-11-09 21:57:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:57:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 21:57:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:38,622 INFO L225 Difference]: With dead ends: 65 [2024-11-09 21:57:38,622 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 21:57:38,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:38,624 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:38,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 21:57:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 21:57:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2024-11-09 21:57:38,637 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 28 [2024-11-09 21:57:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2024-11-09 21:57:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2024-11-09 21:57:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 21:57:38,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:38,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-09 21:57:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:57:38,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:38,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:38,641 INFO L85 PathProgramCache]: Analyzing trace with hash 385795323, now seen corresponding path program 1 times [2024-11-09 21:57:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:38,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584774382] [2024-11-09 21:57:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:38,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584774382] [2024-11-09 21:57:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584774382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:38,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887828758] [2024-11-09 21:57:38,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:38,794 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:38,816 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-11-09 21:57:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 21:57:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:38,819 INFO L225 Difference]: With dead ends: 65 [2024-11-09 21:57:38,819 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 21:57:38,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 21:57:38,821 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:38,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 21:57:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 21:57:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-09 21:57:38,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 28 [2024-11-09 21:57:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-09 21:57:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-09 21:57:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 21:57:38,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:38,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:57:38,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:38,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2122735168, now seen corresponding path program 1 times [2024-11-09 21:57:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569826896] [2024-11-09 21:57:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569826896] [2024-11-09 21:57:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569826896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:38,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:38,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:57:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288588511] [2024-11-09 21:57:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:57:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:57:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:38,919 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:38,935 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2024-11-09 21:57:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:57:38,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 21:57:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:38,937 INFO L225 Difference]: With dead ends: 74 [2024-11-09 21:57:38,937 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 21:57:38,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:38,938 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:38,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 21:57:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-11-09 21:57:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2024-11-09 21:57:38,945 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 32 [2024-11-09 21:57:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:38,946 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2024-11-09 21:57:38,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2024-11-09 21:57:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 21:57:38,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:38,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:38,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 21:57:38,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1320456317, now seen corresponding path program 1 times [2024-11-09 21:57:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559592473] [2024-11-09 21:57:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559592473] [2024-11-09 21:57:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559592473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206046040] [2024-11-09 21:57:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,043 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,074 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-11-09 21:57:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-09 21:57:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,076 INFO L225 Difference]: With dead ends: 79 [2024-11-09 21:57:39,076 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 21:57:39,077 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2024-11-09 21:57:39,092 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 34 [2024-11-09 21:57:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-09 21:57:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2024-11-09 21:57:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 21:57:39,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 21:57:39,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 849436476, now seen corresponding path program 1 times [2024-11-09 21:57:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712567703] [2024-11-09 21:57:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:57:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712567703] [2024-11-09 21:57:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712567703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537958076] [2024-11-09 21:57:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,220 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:57:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,251 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-09 21:57:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,251 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-09 21:57:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,252 INFO L225 Difference]: With dead ends: 87 [2024-11-09 21:57:39,253 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-09 21:57:39,255 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-09 21:57:39,266 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 40 [2024-11-09 21:57:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-09 21:57:39,267 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:57:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-09 21:57:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 21:57:39,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 21:57:39,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1474759636, now seen corresponding path program 1 times [2024-11-09 21:57:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046583604] [2024-11-09 21:57:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 21:57:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 21:57:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:57:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046583604] [2024-11-09 21:57:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046583604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789009468] [2024-11-09 21:57:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,360 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 21:57:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,389 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-09 21:57:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-09 21:57:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,391 INFO L225 Difference]: With dead ends: 91 [2024-11-09 21:57:39,391 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-09 21:57:39,392 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-11-09 21:57:39,398 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 46 [2024-11-09 21:57:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,398 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-09 21:57:39,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 21:57:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2024-11-09 21:57:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 21:57:39,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,400 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 21:57:39,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1482362699, now seen corresponding path program 1 times [2024-11-09 21:57:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200847090] [2024-11-09 21:57:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 21:57:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200847090] [2024-11-09 21:57:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200847090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877377877] [2024-11-09 21:57:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,496 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 21:57:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,521 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2024-11-09 21:57:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-09 21:57:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,523 INFO L225 Difference]: With dead ends: 95 [2024-11-09 21:57:39,523 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-09 21:57:39,524 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-11-09 21:57:39,535 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 52 [2024-11-09 21:57:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-09 21:57:39,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 21:57:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-11-09 21:57:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 21:57:39,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 21:57:39,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -78452325, now seen corresponding path program 1 times [2024-11-09 21:57:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863082434] [2024-11-09 21:57:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 21:57:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 21:57:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 21:57:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 21:57:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 21:57:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863082434] [2024-11-09 21:57:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863082434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032722017] [2024-11-09 21:57:39,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,647 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 21:57:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,670 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-11-09 21:57:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-09 21:57:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,671 INFO L225 Difference]: With dead ends: 105 [2024-11-09 21:57:39,673 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 21:57:39,674 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2024-11-09 21:57:39,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 58 [2024-11-09 21:57:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,685 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2024-11-09 21:57:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 21:57:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2024-11-09 21:57:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 21:57:39,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,686 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 21:57:39,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash 476801232, now seen corresponding path program 1 times [2024-11-09 21:57:39,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539763228] [2024-11-09 21:57:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 21:57:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:57:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 21:57:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 21:57:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 21:57:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 21:57:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539763228] [2024-11-09 21:57:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539763228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498688589] [2024-11-09 21:57:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,762 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 21:57:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,783 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-09 21:57:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2024-11-09 21:57:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,784 INFO L225 Difference]: With dead ends: 109 [2024-11-09 21:57:39,784 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-09 21:57:39,786 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 21:57:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 21:57:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-11-09 21:57:39,792 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 64 [2024-11-09 21:57:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,792 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-11-09 21:57:39,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 21:57:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-11-09 21:57:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 21:57:39,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,795 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 21:57:39,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1409282844, now seen corresponding path program 1 times [2024-11-09 21:57:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676184059] [2024-11-09 21:57:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:57:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 21:57:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 21:57:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 21:57:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 21:57:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 21:57:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 21:57:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676184059] [2024-11-09 21:57:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676184059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345815845] [2024-11-09 21:57:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:39,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:39,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:39,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:39,912 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 21:57:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:39,934 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2024-11-09 21:57:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-09 21:57:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:39,936 INFO L225 Difference]: With dead ends: 113 [2024-11-09 21:57:39,936 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 21:57:39,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-09 21:57:39,936 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:39,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 21:57:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-09 21:57:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-09 21:57:39,948 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 70 [2024-11-09 21:57:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-09 21:57:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 21:57:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-09 21:57:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 21:57:39,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:39,949 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:39,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 21:57:39,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash -289012199, now seen corresponding path program 1 times [2024-11-09 21:57:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028543071] [2024-11-09 21:57:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:57:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028543071] [2024-11-09 21:57:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028543071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:40,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:40,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866103691] [2024-11-09 21:57:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:40,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:40,060 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-09 21:57:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:40,079 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-09 21:57:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 76 [2024-11-09 21:57:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:40,080 INFO L225 Difference]: With dead ends: 64 [2024-11-09 21:57:40,080 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 21:57:40,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-09 21:57:40,081 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:40,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 21:57:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 21:57:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-09 21:57:40,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 76 [2024-11-09 21:57:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:40,086 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-09 21:57:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-09 21:57:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-09 21:57:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 21:57:40,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:40,087 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 21:57:40,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1242154959, now seen corresponding path program 1 times [2024-11-09 21:57:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:40,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427953595] [2024-11-09 21:57:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:57:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427953595] [2024-11-09 21:57:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427953595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790866577] [2024-11-09 21:57:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:40,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:40,171 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-09 21:57:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:40,205 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-09 21:57:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:40,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-09 21:57:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:40,207 INFO L225 Difference]: With dead ends: 78 [2024-11-09 21:57:40,207 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 21:57:40,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:40,207 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:40,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 172 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 21:57:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-09 21:57:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-09 21:57:40,212 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 79 [2024-11-09 21:57:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-09 21:57:40,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-09 21:57:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-09 21:57:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 21:57:40,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:40,213 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 21:57:40,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 859798554, now seen corresponding path program 1 times [2024-11-09 21:57:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733342464] [2024-11-09 21:57:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 21:57:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733342464] [2024-11-09 21:57:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733342464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49547810] [2024-11-09 21:57:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:40,306 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-09 21:57:40,308 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-09 21:57:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:40,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 21:57:40,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:57:40,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:57:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49547810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:40,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-09 21:57:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234172561] [2024-11-09 21:57:40,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 21:57:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 21:57:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 21:57:40,602 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-09 21:57:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:40,731 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2024-11-09 21:57:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 21:57:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 82 [2024-11-09 21:57:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:40,732 INFO L225 Difference]: With dead ends: 113 [2024-11-09 21:57:40,733 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 21:57:40,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-09 21:57:40,734 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:40,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 403 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 21:57:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-09 21:57:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-09 21:57:40,740 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 82 [2024-11-09 21:57:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-09 21:57:40,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-09 21:57:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-09 21:57:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 21:57:40,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:40,757 INFO L215 NwaCegarLoop]: trace histogram [12, 9, 9, 6, 6, 6, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:40,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 21:57:40,961 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,SelfDestructingSolverStorable13 [2024-11-09 21:57:40,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:40,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash 897712498, now seen corresponding path program 2 times [2024-11-09 21:57:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396212731] [2024-11-09 21:57:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 96 proven. 26 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 21:57:41,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396212731] [2024-11-09 21:57:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396212731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:41,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933193138] [2024-11-09 21:57:41,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:57:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:41,153 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-09 21:57:41,154 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-09 21:57:41,304 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:57:41,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:41,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 21:57:41,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 96 proven. 26 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 21:57:41,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 96 proven. 26 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 21:57:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933193138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:41,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-09 21:57:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834499546] [2024-11-09 21:57:41,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 21:57:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 21:57:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2024-11-09 21:57:41,492 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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-09 21:57:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:41,629 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-09 21:57:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 21:57:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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 116 [2024-11-09 21:57:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:41,630 INFO L225 Difference]: With dead ends: 146 [2024-11-09 21:57:41,630 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 21:57:41,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2024-11-09 21:57:41,631 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:41,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 460 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 21:57:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-11-09 21:57:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-09 21:57:41,636 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 116 [2024-11-09 21:57:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:41,636 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-09 21:57:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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-09 21:57:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-09 21:57:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 21:57:41,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:41,638 INFO L215 NwaCegarLoop]: trace histogram [17, 14, 14, 6, 6, 6, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:41,656 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-09 21:57:41,838 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,SelfDestructingSolverStorable14 [2024-11-09 21:57:41,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -955106071, now seen corresponding path program 3 times [2024-11-09 21:57:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300761517] [2024-11-09 21:57:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-09 21:57:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300761517] [2024-11-09 21:57:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300761517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508161971] [2024-11-09 21:57:42,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 21:57:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:42,005 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-09 21:57:42,006 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-09 21:57:42,153 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 21:57:42,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:42,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 21:57:42,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-09 21:57:42,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-09 21:57:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508161971] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:42,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:57:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2024-11-09 21:57:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27687040] [2024-11-09 21:57:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:57:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:57:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:57:42,290 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-09 21:57:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:42,333 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2024-11-09 21:57:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:57:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 131 [2024-11-09 21:57:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:42,334 INFO L225 Difference]: With dead ends: 124 [2024-11-09 21:57:42,334 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 21:57:42,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 21:57:42,335 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:42,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 21:57:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 21:57:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 105 states have (on average 1.0666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-11-09 21:57:42,342 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 131 [2024-11-09 21:57:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:42,342 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-11-09 21:57:42,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-09 21:57:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-11-09 21:57:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 21:57:42,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:42,344 INFO L215 NwaCegarLoop]: trace histogram [19, 15, 15, 6, 6, 6, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:42,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 21:57:42,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:42,549 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:42,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -278261715, now seen corresponding path program 4 times [2024-11-09 21:57:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561972217] [2024-11-09 21:57:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 322 proven. 67 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 21:57:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561972217] [2024-11-09 21:57:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561972217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213479815] [2024-11-09 21:57:42,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 21:57:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:42,792 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-09 21:57:42,794 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-09 21:57:42,926 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 21:57:42,927 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:42,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 21:57:42,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 250 proven. 191 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 21:57:43,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 270 proven. 171 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 21:57:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213479815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:43,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2024-11-09 21:57:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008977176] [2024-11-09 21:57:43,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 21:57:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 21:57:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-09 21:57:43,469 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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-09 21:57:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:43,938 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2024-11-09 21:57:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 21:57:43,938 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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 139 [2024-11-09 21:57:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:43,940 INFO L225 Difference]: With dead ends: 227 [2024-11-09 21:57:43,940 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 21:57:43,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 272 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 21:57:43,942 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 68 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:43,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 395 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:57:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 21:57:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 151. [2024-11-09 21:57:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2024-11-09 21:57:43,950 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 139 [2024-11-09 21:57:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2024-11-09 21:57:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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-09 21:57:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2024-11-09 21:57:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 21:57:43,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:43,952 INFO L215 NwaCegarLoop]: trace histogram [28, 23, 23, 6, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:43,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 21:57:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 21:57:44,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:44,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2146071738, now seen corresponding path program 5 times [2024-11-09 21:57:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625424560] [2024-11-09 21:57:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 21:57:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 21:57:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 21:57:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 21:57:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 424 proven. 37 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-09 21:57:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625424560] [2024-11-09 21:57:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625424560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575805388] [2024-11-09 21:57:44,364 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 21:57:44,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:44,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:44,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 21:57:44,558 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2024-11-09 21:57:44,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:44,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 21:57:44,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 487 proven. 414 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-09 21:57:44,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 515 proven. 386 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-09 21:57:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575805388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:44,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 19 [2024-11-09 21:57:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975571325] [2024-11-09 21:57:44,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 21:57:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 21:57:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-09 21:57:44,926 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-09 21:57:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:45,218 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2024-11-09 21:57:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 21:57:45,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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 168 [2024-11-09 21:57:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:45,221 INFO L225 Difference]: With dead ends: 258 [2024-11-09 21:57:45,221 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 21:57:45,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 337 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 21:57:45,224 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:45,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 535 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:57:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 21:57:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-09 21:57:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 159 states have internal predecessors, (169), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 21:57:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2024-11-09 21:57:45,235 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 168 [2024-11-09 21:57:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2024-11-09 21:57:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-09 21:57:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2024-11-09 21:57:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-09 21:57:45,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:45,237 INFO L215 NwaCegarLoop]: trace histogram [35, 28, 28, 8, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:57:45,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 21:57:45,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 21:57:45,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:45,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1459828527, now seen corresponding path program 6 times [2024-11-09 21:57:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071679267] [2024-11-09 21:57:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:57:45,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 21:57:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:57:45,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 21:57:45,724 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 21:57:45,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 21:57:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 21:57:45,730 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:45,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 21:57:45,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:57:45 BoogieIcfgContainer [2024-11-09 21:57:45,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 21:57:45,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 21:57:45,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 21:57:45,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 21:57:45,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:57:37" (3/4) ... [2024-11-09 21:57:45,823 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 21:57:45,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 21:57:45,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 21:57:45,902 INFO L158 Benchmark]: Toolchain (without parser) took 8961.16ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 123.4MB in the beginning and 117.9MB in the end (delta: 5.6MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,902 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:57:45,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.54ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 109.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.38ms. Allocated memory is still 180.4MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,903 INFO L158 Benchmark]: Boogie Preprocessor took 48.68ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 105.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,904 INFO L158 Benchmark]: IcfgBuilder took 488.72ms. Allocated memory is still 180.4MB. Free memory was 105.1MB in the beginning and 85.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,904 INFO L158 Benchmark]: TraceAbstraction took 8017.47ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 84.6MB in the beginning and 124.2MB in the end (delta: -39.6MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,905 INFO L158 Benchmark]: Witness Printer took 80.11ms. Allocated memory is still 299.9MB. Free memory was 124.2MB in the beginning and 117.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 21:57:45,909 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.54ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 109.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.38ms. Allocated memory is still 180.4MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.68ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 105.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 488.72ms. Allocated memory is still 180.4MB. Free memory was 105.1MB in the beginning and 85.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8017.47ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 84.6MB in the beginning and 124.2MB in the end (delta: -39.6MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. * Witness Printer took 80.11ms. Allocated memory is still 299.9MB. Free memory was 124.2MB in the beginning and 117.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={10:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0] [L38] i++ VAL [d={10:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1] [L38] i++ VAL [d={10:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2] [L38] i++ VAL [d={10:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3] [L38] i++ VAL [d={10:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4] [L38] i++ VAL [d={10:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5] [L38] i++ VAL [d={10:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={10:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 19, TraceHistogramMax: 35, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 4492 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3292 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 578 IncrementalHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1200 mSDtfsCounter, 578 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1599 GetRequests, 1417 SyntacticMatches, 19 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=18, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2100 NumberOfCodeBlocks, 2021 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2515 ConstructedInterpolants, 0 QuantifiedInterpolants, 3656 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1724 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 6095/7455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 21:57:45,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE