./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:05:03,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:05:03,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:05:03,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:05:03,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:05:03,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:05:03,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:05:03,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:05:03,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:05:03,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:05:03,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:05:03,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:05:03,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:05:03,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:05:03,186 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:05:03,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:05:03,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:05:03,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:05:03,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:05:03,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:05:03,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:05:03,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:05:03,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:05:03,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:05:03,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:05:03,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:05:03,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:05:03,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:05:03,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:05:03,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:05:03,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:05:03,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:05:03,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:05:03,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:05:03,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:05:03,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:05:03,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:05:03,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:05:03,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:05:03,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:05:03,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:05:03,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:05:03,202 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 -> c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 [2024-10-24 12:05:03,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:05:03,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:05:03,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:05:03,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:05:03,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:05:03,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-24 12:05:04,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:05:05,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:05:05,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-24 12:05:05,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b6a30d1/b16b943eee654de2863a431a3b14c661/FLAGc1d820afc [2024-10-24 12:05:05,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b6a30d1/b16b943eee654de2863a431a3b14c661 [2024-10-24 12:05:05,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:05:05,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:05:05,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:05:05,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:05:05,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:05:05,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74aba917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05, skipping insertion in model container [2024-10-24 12:05:05,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:05:05,418 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-10-24 12:05:05,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:05:05,489 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:05:05,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-10-24 12:05:05,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:05:05,563 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:05:05,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05 WrapperNode [2024-10-24 12:05:05,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:05:05,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:05:05,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:05:05,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:05:05,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,637 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2024-10-24 12:05:05,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:05:05,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:05:05,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:05:05,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:05:05,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,709 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-24 12:05:05,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:05:05,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:05:05,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:05:05,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:05:05,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (1/1) ... [2024-10-24 12:05:05,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:05:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:05,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:05:05,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:05:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:05:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:05:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:05:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:05:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:05:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:05:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:05:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:05:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:05:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:05:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:05:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:05:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:05:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:05:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:05:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:05:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:05:06,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:05:06,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:05:06,611 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-24 12:05:06,611 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:05:06,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:05:06,655 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:05:06,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:06 BoogieIcfgContainer [2024-10-24 12:05:06,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:05:06,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:05:06,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:05:06,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:05:06,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:05:05" (1/3) ... [2024-10-24 12:05:06,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d46249b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:06, skipping insertion in model container [2024-10-24 12:05:06,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:05" (2/3) ... [2024-10-24 12:05:06,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d46249b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:06, skipping insertion in model container [2024-10-24 12:05:06,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:06" (3/3) ... [2024-10-24 12:05:06,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-24 12:05:06,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:05:06,682 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:05:06,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:05:06,751 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;@3f650b2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:05:06,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:05:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 12:05:06,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:06,772 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:06,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -336066129, now seen corresponding path program 1 times [2024-10-24 12:05:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:06,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293928984] [2024-10-24 12:05:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293928984] [2024-10-24 12:05:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293928984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:07,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:07,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:05:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430039064] [2024-10-24 12:05:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:07,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:05:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:05:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:05:07,319 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 12:05:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:07,369 INFO L93 Difference]: Finished difference Result 199 states and 315 transitions. [2024-10-24 12:05:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:05:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-24 12:05:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:07,385 INFO L225 Difference]: With dead ends: 199 [2024-10-24 12:05:07,386 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 12:05:07,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:05:07,392 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:07,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:05:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 12:05:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 12:05:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-10-24 12:05:07,472 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 129 [2024-10-24 12:05:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-10-24 12:05:07,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 12:05:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-10-24 12:05:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 12:05:07,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:07,480 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:07,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:05:07,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:07,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash -179489779, now seen corresponding path program 1 times [2024-10-24 12:05:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761708854] [2024-10-24 12:05:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761708854] [2024-10-24 12:05:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761708854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:05:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518575237] [2024-10-24 12:05:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:05:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:05:08,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:05:08,061 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:08,127 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-10-24 12:05:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:05:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-24 12:05:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:08,134 INFO L225 Difference]: With dead ends: 199 [2024-10-24 12:05:08,134 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:05:08,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-10-24 12:05:08,137 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:08,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:05:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:05:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 12:05:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-10-24 12:05:08,155 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 129 [2024-10-24 12:05:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-10-24 12:05:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-10-24 12:05:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:08,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:08,160 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:05:08,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 849501947, now seen corresponding path program 1 times [2024-10-24 12:05:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2703379] [2024-10-24 12:05:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2703379] [2024-10-24 12:05:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2703379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:08,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:05:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090767762] [2024-10-24 12:05:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:08,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:05:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:05:08,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:05:08,577 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:08,657 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2024-10-24 12:05:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:05:08,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 12:05:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:08,665 INFO L225 Difference]: With dead ends: 204 [2024-10-24 12:05:08,665 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 12:05:08,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 12:05:08,667 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:08,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 407 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:05:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 12:05:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-24 12:05:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-24 12:05:08,688 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 131 [2024-10-24 12:05:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:08,688 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-24 12:05:08,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-24 12:05:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:08,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:08,694 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:08,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:05:08,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:08,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 40155321, now seen corresponding path program 1 times [2024-10-24 12:05:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517635030] [2024-10-24 12:05:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517635030] [2024-10-24 12:05:08,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517635030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:08,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:08,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:05:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559138835] [2024-10-24 12:05:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:08,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:05:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:08,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:05:08,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:05:08,882 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:08,934 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-10-24 12:05:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:05:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 12:05:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:08,940 INFO L225 Difference]: With dead ends: 208 [2024-10-24 12:05:08,940 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 12:05:08,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 12:05:08,946 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:08,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:05:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 12:05:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-24 12:05:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-24 12:05:08,957 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2024-10-24 12:05:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:08,958 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-24 12:05:08,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-24 12:05:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:08,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:08,962 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:08,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:05:08,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 97413623, now seen corresponding path program 1 times [2024-10-24 12:05:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15743713] [2024-10-24 12:05:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15743713] [2024-10-24 12:05:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15743713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:05:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630645206] [2024-10-24 12:05:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:05:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:05:09,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:05:09,182 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:09,228 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-24 12:05:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:05:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 12:05:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:09,230 INFO L225 Difference]: With dead ends: 212 [2024-10-24 12:05:09,231 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 12:05:09,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 12:05:09,232 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:09,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:05:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 12:05:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 12:05:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-24 12:05:09,241 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2024-10-24 12:05:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-24 12:05:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-24 12:05:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:09,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:09,244 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:09,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:05:09,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 97473205, now seen corresponding path program 1 times [2024-10-24 12:05:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:09,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022001380] [2024-10-24 12:05:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:05:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:10,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022001380] [2024-10-24 12:05:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022001380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:10,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:10,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:05:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510760983] [2024-10-24 12:05:10,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:10,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:05:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:05:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:05:10,153 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:10,513 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-24 12:05:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:05:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 12:05:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:10,515 INFO L225 Difference]: With dead ends: 254 [2024-10-24 12:05:10,515 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 12:05:10,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:05:10,516 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 309 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:10,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 329 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:05:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 12:05:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2024-10-24 12:05:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 12:05:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-24 12:05:10,537 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 131 [2024-10-24 12:05:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:10,538 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-24 12:05:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:05:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-24 12:05:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:10,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:10,541 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:05:10,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -288289332, now seen corresponding path program 1 times [2024-10-24 12:05:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635061334] [2024-10-24 12:05:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 12:05:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635061334] [2024-10-24 12:05:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635061334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020115688] [2024-10-24 12:05:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:13,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:13,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:13,267 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-10-24 12:05:13,268 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-10-24 12:05:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:13,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 12:05:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:05:17,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:18,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,635 INFO L349 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2024-10-24 12:05:18,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 39 [2024-10-24 12:05:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,688 INFO L349 Elim1Store]: treesize reduction 167, result has 0.6 percent of original size [2024-10-24 12:05:18,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 13 [2024-10-24 12:05:18,815 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-24 12:05:18,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-24 12:05:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:18,896 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:05:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-10-24 12:05:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 183 proven. 73 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 12:05:18,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:05:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020115688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:31,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:05:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-10-24 12:05:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823508419] [2024-10-24 12:05:31,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:05:31,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 12:05:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 12:05:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=864, Unknown=2, NotChecked=0, Total=992 [2024-10-24 12:05:31,307 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-24 12:05:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:33,647 INFO L93 Difference]: Finished difference Result 331 states and 467 transitions. [2024-10-24 12:05:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 12:05:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) Word has length 131 [2024-10-24 12:05:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:33,650 INFO L225 Difference]: With dead ends: 331 [2024-10-24 12:05:33,650 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 12:05:33,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=308, Invalid=1412, Unknown=2, NotChecked=0, Total=1722 [2024-10-24 12:05:33,652 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 568 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:33,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1012 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 12:05:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 12:05:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2024-10-24 12:05:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 175 states have internal predecessors, (227), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 12:05:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 305 transitions. [2024-10-24 12:05:33,678 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 305 transitions. Word has length 131 [2024-10-24 12:05:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:33,679 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 305 transitions. [2024-10-24 12:05:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-24 12:05:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-10-24 12:05:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:33,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:33,681 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:33,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:05:33,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:33,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:33,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2093727666, now seen corresponding path program 1 times [2024-10-24 12:05:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484530065] [2024-10-24 12:05:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 12:05:35,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484530065] [2024-10-24 12:05:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484530065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058723699] [2024-10-24 12:05:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:35,508 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-10-24 12:05:35,509 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-10-24 12:05:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:35,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 12:05:35,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:37,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:05:37,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:38,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:38,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:38,648 INFO L349 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2024-10-24 12:05:38,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-10-24 12:05:38,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,696 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-10-24 12:05:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-24 12:05:38,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,768 INFO L349 Elim1Store]: treesize reduction 99, result has 22.7 percent of original size [2024-10-24 12:05:38,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2024-10-24 12:05:38,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:38,810 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-10-24 12:05:38,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 12:05:38,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:05:38,902 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 Int) (v_ArrVal_581 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (< (mod (+ 255 (select (select (let ((.cse0 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_581) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_579))) (store .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_580))) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset)) 256) 255) (not (= (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_579 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_579)))) is different from false [2024-10-24 12:05:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058723699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:38,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:05:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-24 12:05:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312207918] [2024-10-24 12:05:38,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:05:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 12:05:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 12:05:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2024-10-24 12:05:38,920 INFO L87 Difference]: Start difference. First operand 216 states and 305 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-24 12:05:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:39,607 INFO L93 Difference]: Finished difference Result 416 states and 583 transitions. [2024-10-24 12:05:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:05:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 131 [2024-10-24 12:05:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:39,611 INFO L225 Difference]: With dead ends: 416 [2024-10-24 12:05:39,612 INFO L226 Difference]: Without dead ends: 225 [2024-10-24 12:05:39,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=377, Unknown=1, NotChecked=42, Total=552 [2024-10-24 12:05:39,613 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 199 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:39,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 494 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:05:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-24 12:05:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-24 12:05:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.297752808988764) internal successors, (231), 180 states have internal predecessors, (231), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 12:05:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 309 transitions. [2024-10-24 12:05:39,639 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 309 transitions. Word has length 131 [2024-10-24 12:05:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:39,639 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 309 transitions. [2024-10-24 12:05:39,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-24 12:05:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2024-10-24 12:05:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 12:05:39,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:39,641 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:39,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:05:39,845 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,SelfDestructingSolverStorable7 [2024-10-24 12:05:39,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:39,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1246480123, now seen corresponding path program 1 times [2024-10-24 12:05:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629344185] [2024-10-24 12:05:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:05:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:05:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 12:05:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629344185] [2024-10-24 12:05:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629344185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343144891] [2024-10-24 12:05:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:41,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:41,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:41,760 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-10-24 12:05:41,762 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-10-24 12:05:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:41,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-24 12:05:41,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:44,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:05:44,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:45,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:45,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:46,098 INFO L349 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2024-10-24 12:05:46,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 99 [2024-10-24 12:05:46,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,267 INFO L349 Elim1Store]: treesize reduction 204, result has 21.2 percent of original size [2024-10-24 12:05:46,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 205 treesize of output 306 [2024-10-24 12:05:46,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,404 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-10-24 12:05:46,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 101 [2024-10-24 12:05:46,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:46,554 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-10-24 12:05:46,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 79 [2024-10-24 12:05:47,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,597 INFO L349 Elim1Store]: treesize reduction 154, result has 21.8 percent of original size [2024-10-24 12:05:47,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 205 treesize of output 249 [2024-10-24 12:05:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,657 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-10-24 12:05:47,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 38 [2024-10-24 12:05:47,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,754 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-10-24 12:05:47,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 38 [2024-10-24 12:05:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:47,798 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-24 12:05:47,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 17 [2024-10-24 12:05:48,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,519 INFO L349 Elim1Store]: treesize reduction 259, result has 15.9 percent of original size [2024-10-24 12:05:48,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 205 treesize of output 253 [2024-10-24 12:05:48,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-10-24 12:05:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:48,923 INFO L349 Elim1Store]: treesize reduction 116, result has 25.2 percent of original size [2024-10-24 12:05:48,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 109 treesize of output 110 [2024-10-24 12:05:49,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,339 INFO L349 Elim1Store]: treesize reduction 349, result has 14.7 percent of original size [2024-10-24 12:05:49,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 319 [2024-10-24 12:05:49,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,397 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-10-24 12:05:49,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 78 [2024-10-24 12:05:49,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:49,905 INFO L349 Elim1Store]: treesize reduction 168, result has 6.1 percent of original size [2024-10-24 12:05:49,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 101 [2024-10-24 12:05:50,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:50,168 INFO L349 Elim1Store]: treesize reduction 210, result has 21.6 percent of original size [2024-10-24 12:05:50,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 237 treesize of output 241 [2024-10-24 12:05:51,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 314 [2024-10-24 12:05:52,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:52,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:52,232 INFO L349 Elim1Store]: treesize reduction 140, result has 21.8 percent of original size [2024-10-24 12:05:52,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 98 treesize of output 102 [2024-10-24 12:05:52,893 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-24 12:05:52,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 11 [2024-10-24 12:05:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 93 [2024-10-24 12:05:52,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:52,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,074 INFO L349 Elim1Store]: treesize reduction 286, result has 13.9 percent of original size [2024-10-24 12:05:53,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 214 treesize of output 246 [2024-10-24 12:05:53,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:05:53,204 INFO L349 Elim1Store]: treesize reduction 98, result has 4.9 percent of original size [2024-10-24 12:05:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 49 [2024-10-24 12:05:53,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,252 INFO L349 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2024-10-24 12:05:53,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 56 [2024-10-24 12:05:53,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-24 12:05:53,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,627 INFO L349 Elim1Store]: treesize reduction 174, result has 23.3 percent of original size [2024-10-24 12:05:53,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 127 treesize of output 198 [2024-10-24 12:05:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:05:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2024-10-24 12:05:53,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:53,842 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 12:05:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 17 [2024-10-24 12:05:54,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:54,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:54,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:55,022 INFO L349 Elim1Store]: treesize reduction 442, result has 0.2 percent of original size [2024-10-24 12:05:55,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 152 treesize of output 272 [2024-10-24 12:05:55,430 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-24 12:05:55,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-24 12:05:55,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:55,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:55,505 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:05:55,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-10-24 12:05:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 12:05:55,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:06:00,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (and (forall ((v_ArrVal_703 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (not (= v_ArrVal_703 (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse0 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_703 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (forall ((v_ArrVal_701 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_701) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_703))) (store .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse3 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_705 Int)) (< 0 (mod (select (select (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_705))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= 0 (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256))))))) (forall ((v_ArrVal_703 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_701) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_703))) (store .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse6 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_705 Int)) (< 0 (mod (select (select (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_705))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= 0 (mod (select (select .cse5 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256)))))) (not (= v_ArrVal_703 (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse0 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_703 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))))) is different from false [2024-10-24 12:06:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343144891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:06:00,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:06:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-10-24 12:06:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919506740] [2024-10-24 12:06:00,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:06:00,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 12:06:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 12:06:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=761, Unknown=1, NotChecked=56, Total=930 [2024-10-24 12:06:00,188 INFO L87 Difference]: Start difference. First operand 223 states and 309 transitions. Second operand has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-24 12:06:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:02,378 INFO L93 Difference]: Finished difference Result 493 states and 682 transitions. [2024-10-24 12:06:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 12:06:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 131 [2024-10-24 12:06:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:02,382 INFO L225 Difference]: With dead ends: 493 [2024-10-24 12:06:02,382 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 12:06:02,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=259, Invalid=1304, Unknown=1, NotChecked=76, Total=1640 [2024-10-24 12:06:02,384 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 655 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:02,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1317 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 12:06:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 12:06:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 288. [2024-10-24 12:06:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 235 states have internal predecessors, (301), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 399 transitions. [2024-10-24 12:06:02,417 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 399 transitions. Word has length 131 [2024-10-24 12:06:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 399 transitions. [2024-10-24 12:06:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-24 12:06:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 399 transitions. [2024-10-24 12:06:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 12:06:02,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:02,420 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:02,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:06:02,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:06:02,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:02,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1352265374, now seen corresponding path program 1 times [2024-10-24 12:06:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3286803] [2024-10-24 12:06:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3286803] [2024-10-24 12:06:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3286803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:06:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394873315] [2024-10-24 12:06:02,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:02,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:06:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:06:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:06:02,867 INFO L87 Difference]: Start difference. First operand 288 states and 399 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:03,090 INFO L93 Difference]: Finished difference Result 559 states and 773 transitions. [2024-10-24 12:06:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:06:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-24 12:06:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:03,093 INFO L225 Difference]: With dead ends: 559 [2024-10-24 12:06:03,093 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 12:06:03,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:06:03,095 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 54 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:03,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 561 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:06:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 12:06:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2024-10-24 12:06:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.294871794871795) internal successors, (303), 237 states have internal predecessors, (303), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 401 transitions. [2024-10-24 12:06:03,122 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 401 transitions. Word has length 132 [2024-10-24 12:06:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:03,122 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 401 transitions. [2024-10-24 12:06:03,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 401 transitions. [2024-10-24 12:06:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 12:06:03,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:03,125 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:06:03,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1738027911, now seen corresponding path program 1 times [2024-10-24 12:06:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129178080] [2024-10-24 12:06:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129178080] [2024-10-24 12:06:03,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129178080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:03,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:03,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:06:03,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626955975] [2024-10-24 12:06:03,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:03,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:06:03,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:03,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:06:03,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:06:03,802 INFO L87 Difference]: Start difference. First operand 290 states and 401 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:04,256 INFO L93 Difference]: Finished difference Result 553 states and 766 transitions. [2024-10-24 12:06:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:06:04,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-24 12:06:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:04,259 INFO L225 Difference]: With dead ends: 553 [2024-10-24 12:06:04,259 INFO L226 Difference]: Without dead ends: 288 [2024-10-24 12:06:04,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:06:04,265 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 228 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:04,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 318 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:06:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-24 12:06:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-24 12:06:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 235 states have internal predecessors, (298), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2024-10-24 12:06:04,294 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 132 [2024-10-24 12:06:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:04,294 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2024-10-24 12:06:04,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2024-10-24 12:06:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 12:06:04,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:04,296 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:06:04,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:04,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 869009472, now seen corresponding path program 1 times [2024-10-24 12:06:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579553743] [2024-10-24 12:06:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:05,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:05,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579553743] [2024-10-24 12:06:05,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579553743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:05,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:06:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755793538] [2024-10-24 12:06:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:05,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:06:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:06:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:06:05,029 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:05,426 INFO L93 Difference]: Finished difference Result 553 states and 759 transitions. [2024-10-24 12:06:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:06:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 12:06:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:05,429 INFO L225 Difference]: With dead ends: 553 [2024-10-24 12:06:05,429 INFO L226 Difference]: Without dead ends: 290 [2024-10-24 12:06:05,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:06:05,433 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 144 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 500 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:06:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-24 12:06:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2024-10-24 12:06:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2801724137931034) internal successors, (297), 235 states have internal predecessors, (297), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-10-24 12:06:05,473 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 133 [2024-10-24 12:06:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-10-24 12:06:05,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-10-24 12:06:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 12:06:05,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:05,476 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:06:05,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:05,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash -899089241, now seen corresponding path program 1 times [2024-10-24 12:06:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:05,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534389682] [2024-10-24 12:06:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534389682] [2024-10-24 12:06:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534389682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:06:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386438699] [2024-10-24 12:06:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:06:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:06:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:06:07,113 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 12:06:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:07,831 INFO L93 Difference]: Finished difference Result 701 states and 958 transitions. [2024-10-24 12:06:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:06:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-24 12:06:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:07,835 INFO L225 Difference]: With dead ends: 701 [2024-10-24 12:06:07,835 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 12:06:07,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:06:07,837 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 417 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:07,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 450 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:06:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 12:06:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 337. [2024-10-24 12:06:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 284 states have internal predecessors, (360), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 458 transitions. [2024-10-24 12:06:07,885 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 458 transitions. Word has length 134 [2024-10-24 12:06:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 458 transitions. [2024-10-24 12:06:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 12:06:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 458 transitions. [2024-10-24 12:06:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 12:06:07,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:07,887 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:06:07,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 661277115, now seen corresponding path program 1 times [2024-10-24 12:06:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487471010] [2024-10-24 12:06:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487471010] [2024-10-24 12:06:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487471010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:06:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217888473] [2024-10-24 12:06:08,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:08,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:06:08,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:06:08,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:06:08,469 INFO L87 Difference]: Start difference. First operand 337 states and 458 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:08,862 INFO L93 Difference]: Finished difference Result 631 states and 855 transitions. [2024-10-24 12:06:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:06:08,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 12:06:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:08,865 INFO L225 Difference]: With dead ends: 631 [2024-10-24 12:06:08,865 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 12:06:08,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:06:08,867 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:08,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 364 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:06:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 12:06:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-10-24 12:06:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2567049808429118) internal successors, (328), 264 states have internal predecessors, (328), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 426 transitions. [2024-10-24 12:06:08,905 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 426 transitions. Word has length 134 [2024-10-24 12:06:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:08,905 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 426 transitions. [2024-10-24 12:06:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 426 transitions. [2024-10-24 12:06:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 12:06:08,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:08,907 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:08,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:06:08,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash 707658009, now seen corresponding path program 1 times [2024-10-24 12:06:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568939719] [2024-10-24 12:06:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568939719] [2024-10-24 12:06:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568939719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:09,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:06:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981062755] [2024-10-24 12:06:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:06:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:06:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:06:09,620 INFO L87 Difference]: Start difference. First operand 317 states and 426 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:10,159 INFO L93 Difference]: Finished difference Result 609 states and 818 transitions. [2024-10-24 12:06:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:06:10,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 12:06:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:10,161 INFO L225 Difference]: With dead ends: 609 [2024-10-24 12:06:10,161 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 12:06:10,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:06:10,163 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 192 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:10,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 364 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:06:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 12:06:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-24 12:06:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2490421455938698) internal successors, (326), 264 states have internal predecessors, (326), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2024-10-24 12:06:10,203 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 424 transitions. Word has length 135 [2024-10-24 12:06:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:10,204 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 424 transitions. [2024-10-24 12:06:10,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 424 transitions. [2024-10-24 12:06:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 12:06:10,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:10,207 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:10,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:06:10,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:10,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1728726363, now seen corresponding path program 1 times [2024-10-24 12:06:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648364960] [2024-10-24 12:06:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648364960] [2024-10-24 12:06:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648364960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:06:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802973536] [2024-10-24 12:06:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:11,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:06:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:06:11,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:06:11,664 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:12,574 INFO L93 Difference]: Finished difference Result 665 states and 885 transitions. [2024-10-24 12:06:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:06:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 12:06:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:12,577 INFO L225 Difference]: With dead ends: 665 [2024-10-24 12:06:12,578 INFO L226 Difference]: Without dead ends: 373 [2024-10-24 12:06:12,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:06:12,581 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:12,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 871 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:06:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-24 12:06:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 333. [2024-10-24 12:06:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 277 states have (on average 1.2346570397111913) internal successors, (342), 280 states have internal predecessors, (342), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 440 transitions. [2024-10-24 12:06:12,633 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 440 transitions. Word has length 135 [2024-10-24 12:06:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:12,635 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 440 transitions. [2024-10-24 12:06:12,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 440 transitions. [2024-10-24 12:06:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 12:06:12,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:12,637 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:12,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:06:12,637 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:12,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 911077913, now seen corresponding path program 1 times [2024-10-24 12:06:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459413921] [2024-10-24 12:06:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:06:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:06:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:06:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:06:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:06:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:06:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:06:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:06:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:06:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:06:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:06:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:06:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:06:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:06:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:06:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:06:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:06:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:06:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 12:06:13,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:06:13,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459413921] [2024-10-24 12:06:13,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459413921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:06:13,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:06:13,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:06:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800172998] [2024-10-24 12:06:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:06:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:06:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:06:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:06:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:06:13,136 INFO L87 Difference]: Start difference. First operand 333 states and 440 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:06:13,567 INFO L93 Difference]: Finished difference Result 625 states and 828 transitions. [2024-10-24 12:06:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:06:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 12:06:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:06:13,571 INFO L225 Difference]: With dead ends: 625 [2024-10-24 12:06:13,571 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 12:06:13,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:06:13,575 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 94 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:06:13,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:06:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 12:06:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-24 12:06:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2337164750957854) internal successors, (322), 264 states have internal predecessors, (322), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 12:06:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2024-10-24 12:06:13,628 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 135 [2024-10-24 12:06:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:06:13,629 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2024-10-24 12:06:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 12:06:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2024-10-24 12:06:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 12:06:13,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:06:13,630 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:06:13,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 12:06:13,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:06:13,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:06:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1373723726, now seen corresponding path program 1 times [2024-10-24 12:06:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:06:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741202066] [2024-10-24 12:06:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:06:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:06:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat