./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-76.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-76.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 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:02:35,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:02:35,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:02:35,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:02:35,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:02:35,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:02:35,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:02:35,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:02:35,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:02:35,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:02:35,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:02:35,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:02:35,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:02:35,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:02:35,931 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:02:35,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:02:35,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:02:35,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:02:35,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:02:35,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:02:35,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:02:35,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:02:35,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:02:35,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:02:35,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:02:35,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:02:35,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:02:35,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:02:35,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:02:35,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:02:35,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:02:35,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:02:35,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:02:35,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:02:35,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:02:35,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:02:35,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:02:35,941 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 -> 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 [2024-10-24 12:02:36,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:02:36,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:02:36,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:02:36,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:02:36,166 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:02:36,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2024-10-24 12:02:37,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:02:37,564 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:02:37,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2024-10-24 12:02:37,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8ec227f/65cad51074dc4668ae0a70dbd072adac/FLAGb0c95f1aa [2024-10-24 12:02:37,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8ec227f/65cad51074dc4668ae0a70dbd072adac [2024-10-24 12:02:37,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:02:37,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:02:37,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:02:37,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:02:37,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:02:37,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:37,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7092ac0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37, skipping insertion in model container [2024-10-24 12:02:37,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:37,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:02:37,766 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-76.i[917,930] [2024-10-24 12:02:37,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:02:37,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:02:37,886 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-76.i[917,930] [2024-10-24 12:02:37,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:02:37,947 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:02:37,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37 WrapperNode [2024-10-24 12:02:37,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:02:37,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:02:37,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:02:37,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:02:37,954 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:02:37" (1/1) ... [2024-10-24 12:02:37,962 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:02:37" (1/1) ... [2024-10-24 12:02:37,994 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-10-24 12:02:37,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:02:37,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:02:37,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:02:37,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:02:38,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,029 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2024-10-24 12:02:38,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:02:38,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:02:38,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:02:38,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:02:38,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (1/1) ... [2024-10-24 12:02:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:02:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:02:38,090 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:02:38,093 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:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:02:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:02:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:02:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:02:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:02:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:02:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:02:38,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:02:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:02:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:02:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:02:38,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:02:38,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:02:38,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:02:38,557 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-24 12:02:38,557 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:02:38,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:02:38,584 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:02:38,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:02:38 BoogieIcfgContainer [2024-10-24 12:02:38,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:02:38,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:02:38,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:02:38,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:02:38,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:02:37" (1/3) ... [2024-10-24 12:02:38,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8dfe02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:02:38, skipping insertion in model container [2024-10-24 12:02:38,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:02:37" (2/3) ... [2024-10-24 12:02:38,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8dfe02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:02:38, skipping insertion in model container [2024-10-24 12:02:38,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:02:38" (3/3) ... [2024-10-24 12:02:38,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2024-10-24 12:02:38,605 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:02:38,605 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:02:38,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:02:38,662 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;@2a00cd44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:02:38,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:02:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:02:38,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:38,676 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:38,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:38,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2024-10-24 12:02:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603131609] [2024-10-24 12:02:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:38,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603131609] [2024-10-24 12:02:39,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603131609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:39,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:02:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278024771] [2024-10-24 12:02:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:39,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:02:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:02:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:02:39,048 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:39,085 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2024-10-24 12:02:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:02:39,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-24 12:02:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:39,093 INFO L225 Difference]: With dead ends: 183 [2024-10-24 12:02:39,093 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 12:02:39,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:02:39,100 INFO L432 NwaCegarLoop]: 124 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, 124 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:02:39,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 12:02:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 12:02:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-24 12:02:39,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-10-24 12:02:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:39,132 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-24 12:02:39,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-24 12:02:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:02:39,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:39,135 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:02:39,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2024-10-24 12:02:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624906328] [2024-10-24 12:02:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624906328] [2024-10-24 12:02:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624906328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:02:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637466081] [2024-10-24 12:02:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:39,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:02:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:02:39,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:39,446 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:39,472 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2024-10-24 12:02:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:02:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-24 12:02:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:39,474 INFO L225 Difference]: With dead ends: 177 [2024-10-24 12:02:39,475 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 12:02:39,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:39,478 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:39,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 12:02:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 12:02:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-10-24 12:02:39,492 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2024-10-24 12:02:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-10-24 12:02:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-10-24 12:02:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 12:02:39,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:39,495 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:02:39,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2024-10-24 12:02:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882772213] [2024-10-24 12:02:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882772213] [2024-10-24 12:02:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882772213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:02:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879840226] [2024-10-24 12:02:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:02:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:40,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:02:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:02:40,774 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:41,144 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2024-10-24 12:02:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2024-10-24 12:02:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:41,146 INFO L225 Difference]: With dead ends: 225 [2024-10-24 12:02:41,146 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 12:02:41,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:02:41,147 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 243 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:41,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 369 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:02:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 12:02:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2024-10-24 12:02:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-24 12:02:41,163 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 115 [2024-10-24 12:02:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:41,163 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-24 12:02:41,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-24 12:02:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 12:02:41,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:41,168 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:02:41,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2024-10-24 12:02:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359929113] [2024-10-24 12:02:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359929113] [2024-10-24 12:02:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359929113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:02:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579480596] [2024-10-24 12:02:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:02:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:02:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:41,391 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:41,410 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-10-24 12:02:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:02:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2024-10-24 12:02:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:41,413 INFO L225 Difference]: With dead ends: 204 [2024-10-24 12:02:41,413 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 12:02:41,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:41,416 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:41,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 12:02:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 12:02:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-10-24 12:02:41,433 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 115 [2024-10-24 12:02:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:41,433 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-10-24 12:02:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-10-24 12:02:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 12:02:41,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:41,435 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:02:41,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:41,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1995083643, now seen corresponding path program 1 times [2024-10-24 12:02:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:41,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762034480] [2024-10-24 12:02:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762034480] [2024-10-24 12:02:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762034480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:02:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924765496] [2024-10-24 12:02:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:02:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:02:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:02:41,780 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:41,977 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2024-10-24 12:02:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 12:02:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:41,979 INFO L225 Difference]: With dead ends: 198 [2024-10-24 12:02:41,979 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 12:02:41,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:02:41,981 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 99 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:41,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 310 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:02:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 12:02:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 12:02:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-10-24 12:02:41,998 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 117 [2024-10-24 12:02:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-10-24 12:02:41,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-10-24 12:02:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 12:02:42,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:42,000 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:02:42,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:42,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2024-10-24 12:02:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187788337] [2024-10-24 12:02:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:42,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187788337] [2024-10-24 12:02:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187788337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:42,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:02:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247616898] [2024-10-24 12:02:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:42,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:02:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:02:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:42,128 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:42,149 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2024-10-24 12:02:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:02:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 12:02:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:42,150 INFO L225 Difference]: With dead ends: 197 [2024-10-24 12:02:42,151 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 12:02:42,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:42,151 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:42,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 12:02:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 12:02:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-24 12:02:42,160 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 117 [2024-10-24 12:02:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:42,160 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-24 12:02:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-24 12:02:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 12:02:42,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:42,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:02:42,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1080589313, now seen corresponding path program 1 times [2024-10-24 12:02:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672099666] [2024-10-24 12:02:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672099666] [2024-10-24 12:02:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672099666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:02:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242223133] [2024-10-24 12:02:42,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:42,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:02:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:02:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:42,226 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:42,246 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2024-10-24 12:02:42,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:02:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-24 12:02:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:42,247 INFO L225 Difference]: With dead ends: 199 [2024-10-24 12:02:42,247 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:02:42,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:02:42,248 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:42,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:02:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 12:02:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-10-24 12:02:42,256 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 119 [2024-10-24 12:02:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:42,256 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-10-24 12:02:42,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-10-24 12:02:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 12:02:42,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:42,257 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:02:42,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 493783299, now seen corresponding path program 1 times [2024-10-24 12:02:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496343809] [2024-10-24 12:02:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496343809] [2024-10-24 12:02:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496343809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:43,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:02:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118350102] [2024-10-24 12:02:43,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:43,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:02:43,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:02:43,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:02:43,015 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:43,499 INFO L93 Difference]: Finished difference Result 234 states and 322 transitions. [2024-10-24 12:02:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:02:43,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-24 12:02:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:43,500 INFO L225 Difference]: With dead ends: 234 [2024-10-24 12:02:43,500 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 12:02:43,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:02:43,501 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 230 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:43,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 476 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:02:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 12:02:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2024-10-24 12:02:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-24 12:02:43,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 119 [2024-10-24 12:02:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:43,517 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-24 12:02:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-24 12:02:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 12:02:43,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:43,518 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:02:43,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2024-10-24 12:02:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894124264] [2024-10-24 12:02:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:43,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894124264] [2024-10-24 12:02:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894124264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:02:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744828481] [2024-10-24 12:02:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:43,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:02:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:02:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:02:43,673 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:43,717 INFO L93 Difference]: Finished difference Result 203 states and 280 transitions. [2024-10-24 12:02:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-24 12:02:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:43,718 INFO L225 Difference]: With dead ends: 203 [2024-10-24 12:02:43,720 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 12:02:43,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:02:43,720 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:43,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:02:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 12:02:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 12:02:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2024-10-24 12:02:43,730 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 119 [2024-10-24 12:02:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:43,731 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2024-10-24 12:02:43,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2024-10-24 12:02:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 12:02:43,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:43,732 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:43,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:02:43,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1950694842, now seen corresponding path program 1 times [2024-10-24 12:02:43,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:43,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679996923] [2024-10-24 12:02:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679996923] [2024-10-24 12:02:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679996923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 12:02:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089147241] [2024-10-24 12:02:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:44,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 12:02:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 12:02:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:02:44,934 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:45,270 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-10-24 12:02:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:02:45,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-10-24 12:02:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:45,272 INFO L225 Difference]: With dead ends: 208 [2024-10-24 12:02:45,272 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 12:02:45,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-10-24 12:02:45,273 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 157 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:45,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 253 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:02:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 12:02:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-10-24 12:02:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-10-24 12:02:45,281 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 121 [2024-10-24 12:02:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:45,281 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-10-24 12:02:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-10-24 12:02:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 12:02:45,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:45,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:02:45,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2024-10-24 12:02:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072893775] [2024-10-24 12:02:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072893775] [2024-10-24 12:02:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072893775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:45,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:45,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:02:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044789973] [2024-10-24 12:02:45,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:45,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:02:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:02:45,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:02:45,545 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:45,766 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2024-10-24 12:02:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:45,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-10-24 12:02:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:45,767 INFO L225 Difference]: With dead ends: 227 [2024-10-24 12:02:45,767 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 12:02:45,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:02:45,768 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 123 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:45,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 314 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:02:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 12:02:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 106. [2024-10-24 12:02:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2024-10-24 12:02:45,776 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 121 [2024-10-24 12:02:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2024-10-24 12:02:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2024-10-24 12:02:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 12:02:45,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:45,778 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:02:45,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2024-10-24 12:02:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:45,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929624384] [2024-10-24 12:02:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:46,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929624384] [2024-10-24 12:02:46,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929624384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:46,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:46,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:02:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531787100] [2024-10-24 12:02:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:02:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:02:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:02:46,520 INFO L87 Difference]: Start difference. First operand 106 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:46,846 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2024-10-24 12:02:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:02:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2024-10-24 12:02:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:46,849 INFO L225 Difference]: With dead ends: 258 [2024-10-24 12:02:46,849 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 12:02:46,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:02:46,850 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:46,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 516 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:02:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 12:02:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2024-10-24 12:02:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 115 states have internal predecessors, (145), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2024-10-24 12:02:46,859 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 123 [2024-10-24 12:02:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:46,859 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2024-10-24 12:02:46,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2024-10-24 12:02:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 12:02:46,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:46,860 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:02:46,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 671553404, now seen corresponding path program 1 times [2024-10-24 12:02:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635047860] [2024-10-24 12:02:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:46,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635047860] [2024-10-24 12:02:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635047860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:47,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:02:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886597123] [2024-10-24 12:02:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:47,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:02:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:02:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:02:47,370 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:47,703 INFO L93 Difference]: Finished difference Result 290 states and 384 transitions. [2024-10-24 12:02:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-10-24 12:02:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:47,706 INFO L225 Difference]: With dead ends: 290 [2024-10-24 12:02:47,706 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 12:02:47,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:02:47,706 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 206 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:47,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 385 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:02:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 12:02:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2024-10-24 12:02:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 121 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2024-10-24 12:02:47,719 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 124 [2024-10-24 12:02:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:47,719 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2024-10-24 12:02:47,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2024-10-24 12:02:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 12:02:47,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:47,720 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:47,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:02:47,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash -772063983, now seen corresponding path program 1 times [2024-10-24 12:02:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448387623] [2024-10-24 12:02:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:48,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448387623] [2024-10-24 12:02:48,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448387623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:48,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:48,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 12:02:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525601255] [2024-10-24 12:02:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 12:02:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:48,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 12:02:48,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:02:48,464 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:02:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:48,950 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2024-10-24 12:02:48,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:02:48,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2024-10-24 12:02:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:48,952 INFO L225 Difference]: With dead ends: 190 [2024-10-24 12:02:48,952 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 12:02:48,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-24 12:02:48,953 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 370 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:48,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 414 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:02:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 12:02:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2024-10-24 12:02:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 159 states have internal predecessors, (193), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 223 transitions. [2024-10-24 12:02:48,975 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 223 transitions. Word has length 125 [2024-10-24 12:02:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:48,975 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 223 transitions. [2024-10-24 12:02:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:02:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 223 transitions. [2024-10-24 12:02:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 12:02:48,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:48,977 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:02:48,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1452136592, now seen corresponding path program 1 times [2024-10-24 12:02:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002115638] [2024-10-24 12:02:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002115638] [2024-10-24 12:02:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002115638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:02:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752135384] [2024-10-24 12:02:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:49,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:02:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:02:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:02:49,430 INFO L87 Difference]: Start difference. First operand 176 states and 223 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:49,722 INFO L93 Difference]: Finished difference Result 370 states and 470 transitions. [2024-10-24 12:02:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:02:49,722 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2024-10-24 12:02:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:49,723 INFO L225 Difference]: With dead ends: 370 [2024-10-24 12:02:49,723 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 12:02:49,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:02:49,724 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:49,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 284 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:02:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 12:02:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 176. [2024-10-24 12:02:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.20125786163522) internal successors, (191), 159 states have internal predecessors, (191), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2024-10-24 12:02:49,735 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 125 [2024-10-24 12:02:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:49,735 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2024-10-24 12:02:49,735 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2024-10-24 12:02:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 12:02:49,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:49,736 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:49,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:02:49,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1836143434, now seen corresponding path program 1 times [2024-10-24 12:02:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598940660] [2024-10-24 12:02:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598940660] [2024-10-24 12:02:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598940660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:02:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105647088] [2024-10-24 12:02:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:50,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:02:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:02:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:02:50,116 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:50,585 INFO L93 Difference]: Finished difference Result 426 states and 533 transitions. [2024-10-24 12:02:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 12:02:50,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-24 12:02:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:50,587 INFO L225 Difference]: With dead ends: 426 [2024-10-24 12:02:50,588 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 12:02:50,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:02:50,588 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 140 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:50,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 733 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:02:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 12:02:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2024-10-24 12:02:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 197 states have (on average 1.1979695431472082) internal successors, (236), 197 states have internal predecessors, (236), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 266 transitions. [2024-10-24 12:02:50,603 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 266 transitions. Word has length 126 [2024-10-24 12:02:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:50,604 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 266 transitions. [2024-10-24 12:02:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 12:02:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 266 transitions. [2024-10-24 12:02:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 12:02:50,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:50,605 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:02:50,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:50,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 87084600, now seen corresponding path program 1 times [2024-10-24 12:02:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129245941] [2024-10-24 12:02:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:02:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129245941] [2024-10-24 12:02:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129245941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:02:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:02:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:02:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497878899] [2024-10-24 12:02:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:02:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:02:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:02:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:02:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:02:50,752 INFO L87 Difference]: Start difference. First operand 214 states and 266 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:02:50,862 INFO L93 Difference]: Finished difference Result 447 states and 557 transitions. [2024-10-24 12:02:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:02:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-24 12:02:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:02:50,864 INFO L225 Difference]: With dead ends: 447 [2024-10-24 12:02:50,864 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 12:02:50,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:02:50,865 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:02:50,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 365 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:02:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 12:02:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 176. [2024-10-24 12:02:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.1949685534591195) internal successors, (190), 159 states have internal predecessors, (190), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 12:02:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2024-10-24 12:02:50,876 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 126 [2024-10-24 12:02:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:02:50,877 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2024-10-24 12:02:50,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:02:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2024-10-24 12:02:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 12:02:50,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:02:50,878 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 12:02:50,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:02:50,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:02:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -393966798, now seen corresponding path program 1 times [2024-10-24 12:02:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:02:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165532446] [2024-10-24 12:02:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:02:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:02:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:02:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:02:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:02:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:02:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:02:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:02:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:02:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:02:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:02:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:02:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:02:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:02:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:02:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:02:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 12:02:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:02:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165532446] [2024-10-24 12:02:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165532446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:02:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216636822] [2024-10-24 12:02:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:02:51,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:02:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:02:51,517 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:02:51,518 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:02:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:02:51,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-24 12:02:51,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:02:52,370 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:02:52,821 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:02:53,055 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:02:53,349 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:02:53,660 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:02:53,954 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:02:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,193 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 20 [2024-10-24 12:02:54,313 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-24 12:02:54,313 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 92 treesize of output 83 [2024-10-24 12:02:54,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,411 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 92 [2024-10-24 12:02:54,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2024-10-24 12:02:54,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,638 INFO L349 Elim1Store]: treesize reduction 110, result has 19.7 percent of original size [2024-10-24 12:02:54,638 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 110 [2024-10-24 12:02:54,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:54,775 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2024-10-24 12:02:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 74 [2024-10-24 12:02:55,982 INFO L349 Elim1Store]: treesize reduction 116, result has 37.3 percent of original size [2024-10-24 12:02:55,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 339 treesize of output 328 [2024-10-24 12:02:58,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,396 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-24 12:02:58,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 45 [2024-10-24 12:02:58,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,719 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2024-10-24 12:02:58,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 82 [2024-10-24 12:02:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,856 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-24 12:02:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 55 [2024-10-24 12:02:58,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:58,918 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-24 12:02:58,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2024-10-24 12:02:59,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,022 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-24 12:02:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-10-24 12:02:59,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:02:59,117 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-24 12:02:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 57 [2024-10-24 12:03:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 162 proven. 125 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-10-24 12:03:00,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:03:01,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_869 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_6_Pointer~0.base v_ArrVal_869))) (or (not (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset 1)))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) (mod (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256)))) (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (not (= (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (select v_ArrVal_869 c_~WrapperStruct00_var_1_6_Pointer~0.offset)) v_ArrVal_869))))) is different from false [2024-10-24 12:03:05,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_11_Pointer~0.offset Int) (v_ArrVal_869 (Array Int Int)) (~WrapperStruct00_var_1_11_Pointer~0.base Int)) (let ((.cse1 (mod (+ (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.offset .cse1)))) (let ((.cse0 (store .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base v_ArrVal_869))) (or (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (< 127 .cse1) (not (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset 1)))) (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) (mod (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256)))) (not (= v_ArrVal_869 (store (select .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (select v_ArrVal_869 c_~WrapperStruct00_var_1_6_Pointer~0.offset))))))))) (forall ((~WrapperStruct00_var_1_11_Pointer~0.offset Int) (v_ArrVal_869 (Array Int Int)) (~WrapperStruct00_var_1_11_Pointer~0.base Int)) (let ((.cse5 (mod (+ (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse8 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (- 256) .cse5))))) (let ((.cse7 (store .cse8 c_~WrapperStruct00_var_1_6_Pointer~0.base v_ArrVal_869))) (or (< .cse5 128) (not (let ((.cse6 (store .cse7 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset 1)))) (= (mod (select (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) (mod (select (select .cse6 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256)))) (= (mod (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (not (= v_ArrVal_869 (store (select .cse8 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (select v_ArrVal_869 c_~WrapperStruct00_var_1_6_Pointer~0.offset))))))))))) is different from false [2024-10-24 12:03:10,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))))) (let ((.cse5 (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_11_Pointer~0.offset Int) (v_ArrVal_869 (Array Int Int)) (~WrapperStruct00_var_1_11_Pointer~0.base Int)) (let ((.cse3 (mod (+ (select (select .cse4 ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse2 (store .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_8_Pointer~0.offset .cse3)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_6_Pointer~0.base v_ArrVal_869))) (or (not (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset 1)))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) (mod (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256)))) (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (not (= v_ArrVal_869 (store (select .cse2 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (select v_ArrVal_869 c_~WrapperStruct00_var_1_6_Pointer~0.offset)))) (< 127 .cse3)))))) (forall ((~WrapperStruct00_var_1_11_Pointer~0.offset Int) (v_ArrVal_869 (Array Int Int)) (~WrapperStruct00_var_1_11_Pointer~0.base Int)) (let ((.cse9 (mod (+ (select (select .cse4 ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse6 (store .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (- 256) .cse9))))) (let ((.cse7 (store .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base v_ArrVal_869))) (or (not (= v_ArrVal_869 (store (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (select v_ArrVal_869 c_~WrapperStruct00_var_1_6_Pointer~0.offset)))) (= (mod (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (not (let ((.cse8 (store .cse7 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset 1)))) (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) (mod (select (select .cse8 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256)))) (< .cse9 128))))))))) is different from false [2024-10-24 12:03:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216636822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:03:10,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:03:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-24 12:03:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241910] [2024-10-24 12:03:10,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:03:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 12:03:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 12:03:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=614, Unknown=3, NotChecked=156, Total=870 [2024-10-24 12:03:10,543 INFO L87 Difference]: Start difference. First operand 176 states and 220 transitions. Second operand has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 21 states have internal predecessors, (104), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-24 12:03:16,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:20,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:27,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:32,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:37,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:43,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:52,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:52,550 INFO L93 Difference]: Finished difference Result 435 states and 534 transitions. [2024-10-24 12:03:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 12:03:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 21 states have internal predecessors, (104), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 127 [2024-10-24 12:03:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:52,552 INFO L225 Difference]: With dead ends: 435 [2024-10-24 12:03:52,552 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 12:03:52,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=534, Invalid=2231, Unknown=3, NotChecked=312, Total=3080 [2024-10-24 12:03:52,554 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 385 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 152 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:52,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 559 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1313 Invalid, 7 Unknown, 0 Unchecked, 34.5s Time] [2024-10-24 12:03:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 12:03:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2024-10-24 12:03:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.127388535031847) internal successors, (177), 158 states have internal predecessors, (177), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 12:03:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-10-24 12:03:52,600 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 127 [2024-10-24 12:03:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:52,601 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-10-24 12:03:52,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 21 states have internal predecessors, (104), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-24 12:03:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-10-24 12:03:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 12:03:52,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:52,603 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:52,619 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:03:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 12:03:52,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash -213349927, now seen corresponding path program 1 times [2024-10-24 12:03:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456159033] [2024-10-24 12:03:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:03:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:03:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:03:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:03:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:03:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:03:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:03:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:03:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:03:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456159033] [2024-10-24 12:03:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456159033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:53,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:03:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721862926] [2024-10-24 12:03:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:53,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:03:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:03:53,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:03:53,134 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:53,637 INFO L93 Difference]: Finished difference Result 301 states and 368 transitions. [2024-10-24 12:03:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:03:53,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-10-24 12:03:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:53,640 INFO L225 Difference]: With dead ends: 301 [2024-10-24 12:03:53,640 INFO L226 Difference]: Without dead ends: 152 [2024-10-24 12:03:53,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:03:53,641 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:53,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 320 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:03:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-24 12:03:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-24 12:03:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 116 states have (on average 1.1120689655172413) internal successors, (129), 117 states have internal predecessors, (129), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 12:03:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2024-10-24 12:03:53,676 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 127 [2024-10-24 12:03:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:53,676 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2024-10-24 12:03:53,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2024-10-24 12:03:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 12:03:53,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:53,677 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 12:03:53,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 383481696, now seen corresponding path program 1 times [2024-10-24 12:03:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127952041] [2024-10-24 12:03:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:03:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:03:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:03:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:03:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:03:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:03:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:03:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:03:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:03:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127952041] [2024-10-24 12:03:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127952041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:53,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:03:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788172921] [2024-10-24 12:03:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:53,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:03:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:03:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:03:53,766 INFO L87 Difference]: Start difference. First operand 152 states and 189 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:53,877 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2024-10-24 12:03:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:03:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 12:03:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:53,879 INFO L225 Difference]: With dead ends: 261 [2024-10-24 12:03:53,880 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 12:03:53,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:03:53,881 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:53,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:03:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 12:03:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-24 12:03:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.1111111111111112) internal successors, (130), 118 states have internal predecessors, (130), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 12:03:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-24 12:03:53,916 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 128 [2024-10-24 12:03:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:53,916 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-24 12:03:53,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-24 12:03:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 12:03:53,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:53,917 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 12:03:53,917 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2136478238, now seen corresponding path program 1 times [2024-10-24 12:03:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:53,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076592708] [2024-10-24 12:03:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:03:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:03:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:03:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:03:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:03:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:03:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:03:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:03:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:03:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076592708] [2024-10-24 12:03:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076592708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:54,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:54,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:03:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815276362] [2024-10-24 12:03:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:03:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:54,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:03:54,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:03:54,282 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:54,782 INFO L93 Difference]: Finished difference Result 251 states and 306 transitions. [2024-10-24 12:03:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:03:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 12:03:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:54,784 INFO L225 Difference]: With dead ends: 251 [2024-10-24 12:03:54,785 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 12:03:54,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:03:54,787 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:54,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 254 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:03:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 12:03:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 12:03:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:03:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 12:03:54,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2024-10-24 12:03:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 12:03:54,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 12:03:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 12:03:54,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 12:03:54,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 12:03:54,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 12:03:54,796 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:03:54,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 12:04:01,675 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 274 DAG size of output: 276 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)