./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 14:02:56,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:56,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:02:56,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:56,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:56,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:56,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:56,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:56,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:56,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:56,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:56,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:56,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:56,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:56,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:56,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:56,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:56,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:56,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:02:56,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:56,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:56,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:56,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:56,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:56,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:56,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:56,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:56,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:56,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:56,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:56,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:56,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:56,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:56,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:56,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:56,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:56,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:02:56,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:02:56,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:56,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:56,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:56,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:56,536 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-clean/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-clean/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-11 14:02:56,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:56,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:56,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:56,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:56,767 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:56,768 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-11 14:02:58,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:58,298 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:58,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2024-10-11 14:02:58,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e495f0ee0/b2613f7fad2b455c9fb281cf92000064/FLAG2fba7b667 [2024-10-11 14:02:58,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e495f0ee0/b2613f7fad2b455c9fb281cf92000064 [2024-10-11 14:02:58,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:58,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:58,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:58,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:58,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:58,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3407a6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58, skipping insertion in model container [2024-10-11 14:02:58,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:58,489 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-11 14:02:58,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:58,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:58,571 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-11 14:02:58,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:58,639 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:58,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58 WrapperNode [2024-10-11 14:02:58,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:58,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:58,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:58,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:58,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,691 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-10-11 14:02:58,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:58,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:58,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:58,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:58,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,724 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-11 14:02:58,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:58,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:58,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:58,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:58,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (1/1) ... [2024-10-11 14:02:58,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:58,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:02:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:02:58,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:58,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:02:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:02:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:02:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:02:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:02:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:02:58,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:02:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:02:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:02:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:02:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:58,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:02:58,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:02:58,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:58,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:58,971 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:58,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:02:59,272 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-11 14:02:59,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:02:59,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:02:59,298 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:02:59,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:59 BoogieIcfgContainer [2024-10-11 14:02:59,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:02:59,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:02:59,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:02:59,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:02:59,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:58" (1/3) ... [2024-10-11 14:02:59,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4b644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:59, skipping insertion in model container [2024-10-11 14:02:59,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:58" (2/3) ... [2024-10-11 14:02:59,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4b644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:59, skipping insertion in model container [2024-10-11 14:02:59,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:59" (3/3) ... [2024-10-11 14:02:59,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2024-10-11 14:02:59,320 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:02:59,321 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:02:59,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:02:59,372 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;@5b934293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:02:59,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:02:59,376 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-11 14:02:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:02:59,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:59,384 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-11 14:02:59,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2024-10-11 14:02:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:59,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618375927] [2024-10-11 14:02:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:02:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:02:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:02:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:02:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:02:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:02:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:02:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:02:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,669 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-11 14:02:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618375927] [2024-10-11 14:02:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618375927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:59,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:02:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601259284] [2024-10-11 14:02:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:59,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:02:59,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:59,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:02:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:59,705 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-11 14:02:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:59,737 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2024-10-11 14:02:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:02:59,740 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-11 14:02:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:59,746 INFO L225 Difference]: With dead ends: 183 [2024-10-11 14:02:59,746 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 14:02:59,750 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-11 14:02:59,753 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-11 14:02:59,754 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-11 14:02:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 14:02:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 14:02:59,817 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-11 14:02:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-11 14:02:59,820 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-10-11 14:02:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:59,820 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-11 14:02:59,821 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-11 14:02:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-11 14:02:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:02:59,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:59,831 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-11 14:02:59,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:02:59,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:59,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2024-10-11 14:02:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299339833] [2024-10-11 14:02:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,357 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-11 14:03:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299339833] [2024-10-11 14:03:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299339833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:03:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248310682] [2024-10-11 14:03:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:03:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:03:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:03:00,367 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-11 14:03:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:00,418 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2024-10-11 14:03:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:03:00,419 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-11 14:03:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:00,420 INFO L225 Difference]: With dead ends: 177 [2024-10-11 14:03:00,420 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 14:03:00,421 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-11 14:03:00,422 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-11 14:03:00,423 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-11 14:03:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 14:03:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 14:03:00,440 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-11 14:03:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-10-11 14:03:00,445 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2024-10-11 14:03:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:00,448 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-10-11 14:03:00,448 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-11 14:03:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-10-11 14:03:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 14:03:00,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:00,454 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-11 14:03:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:03:00,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2024-10-11 14:03:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168471603] [2024-10-11 14:03:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,781 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-11 14:03:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168471603] [2024-10-11 14:03:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168471603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:01,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:01,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:03:01,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854355643] [2024-10-11 14:03:01,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:01,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:03:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:03:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:03:01,785 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-11 14:03:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:02,153 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2024-10-11 14:03:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:02,153 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-11 14:03:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:02,156 INFO L225 Difference]: With dead ends: 225 [2024-10-11 14:03:02,156 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 14:03:02,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:03:02,158 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-11 14:03:02,158 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-11 14:03:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 14:03:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2024-10-11 14:03:02,175 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-11 14:03:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-11 14:03:02,176 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 115 [2024-10-11 14:03:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:02,178 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-11 14:03:02,178 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-11 14:03:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-11 14:03:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 14:03:02,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:02,180 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-11 14:03:02,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:03:02,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:02,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2024-10-11 14:03:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386839681] [2024-10-11 14:03:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,377 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-11 14:03:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386839681] [2024-10-11 14:03:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386839681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:02,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:03:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043315354] [2024-10-11 14:03:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:02,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:03:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:03:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:03:02,383 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-11 14:03:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:02,413 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-10-11 14:03:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:03:02,413 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-11 14:03:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:02,414 INFO L225 Difference]: With dead ends: 204 [2024-10-11 14:03:02,414 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:03:02,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-11 14:03:02,420 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-11 14:03:02,420 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-11 14:03:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:03:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 14:03:02,438 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-11 14:03:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-10-11 14:03:02,439 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 115 [2024-10-11 14:03:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:02,439 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-10-11 14:03:02,440 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-11 14:03:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-10-11 14:03:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 14:03:02,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:02,441 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-11 14:03:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:03:02,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1995083643, now seen corresponding path program 1 times [2024-10-11 14:03:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747224822] [2024-10-11 14:03:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,926 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-11 14:03:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747224822] [2024-10-11 14:03:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747224822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:03:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230239862] [2024-10-11 14:03:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:03:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:03:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:03:02,928 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-11 14:03:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:03,123 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2024-10-11 14:03:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:03,124 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-11 14:03:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:03,129 INFO L225 Difference]: With dead ends: 198 [2024-10-11 14:03:03,129 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 14:03:03,129 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-11 14:03:03,130 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-11 14:03:03,130 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-11 14:03:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 14:03:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-11 14:03:03,145 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-11 14:03:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-10-11 14:03:03,146 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 117 [2024-10-11 14:03:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:03,150 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-10-11 14:03:03,150 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-11 14:03:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-10-11 14:03:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 14:03:03,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:03,151 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-11 14:03:03,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:03:03,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2024-10-11 14:03:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719132696] [2024-10-11 14:03:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,326 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-11 14:03:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719132696] [2024-10-11 14:03:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719132696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:03:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354257094] [2024-10-11 14:03:03,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:03,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:03:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:03:03,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:03:03,328 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-11 14:03:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:03,362 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2024-10-11 14:03:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:03:03,363 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-11 14:03:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:03,363 INFO L225 Difference]: With dead ends: 197 [2024-10-11 14:03:03,363 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:03:03,364 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-11 14:03:03,364 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-11 14:03:03,365 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-11 14:03:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:03:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 14:03:03,379 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-11 14:03:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-11 14:03:03,384 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 117 [2024-10-11 14:03:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:03,384 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-11 14:03:03,384 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-11 14:03:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-11 14:03:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 14:03:03,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:03,385 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-11 14:03:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:03:03,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1080589313, now seen corresponding path program 1 times [2024-10-11 14:03:03,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300912603] [2024-10-11 14:03:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,501 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-11 14:03:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300912603] [2024-10-11 14:03:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300912603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:03:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462425739] [2024-10-11 14:03:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:03:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:03:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:03:03,506 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-11 14:03:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:03,538 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2024-10-11 14:03:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:03:03,541 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-11 14:03:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:03,542 INFO L225 Difference]: With dead ends: 199 [2024-10-11 14:03:03,542 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:03:03,543 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-11 14:03:03,543 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-11 14:03:03,543 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-11 14:03:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:03:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 14:03:03,554 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-11 14:03:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-10-11 14:03:03,555 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 119 [2024-10-11 14:03:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-10-11 14:03:03,557 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-11 14:03:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-10-11 14:03:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 14:03:03,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:03,558 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-11 14:03:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:03:03,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 493783299, now seen corresponding path program 1 times [2024-10-11 14:03:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961794925] [2024-10-11 14:03:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:04,351 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-11 14:03:04,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961794925] [2024-10-11 14:03:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961794925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:04,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:03:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906039753] [2024-10-11 14:03:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:04,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:03:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:03:04,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:03:04,354 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-11 14:03:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:04,908 INFO L93 Difference]: Finished difference Result 234 states and 322 transitions. [2024-10-11 14:03:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:03:04,909 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-11 14:03:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:04,910 INFO L225 Difference]: With dead ends: 234 [2024-10-11 14:03:04,910 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 14:03:04,910 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-11 14:03:04,911 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:04,911 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.4s Time] [2024-10-11 14:03:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 14:03:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2024-10-11 14:03:04,918 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-11 14:03:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-11 14:03:04,919 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 119 [2024-10-11 14:03:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:04,920 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-11 14:03:04,920 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-11 14:03:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-11 14:03:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 14:03:04,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:04,921 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-11 14:03:04,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:03:04,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:04,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2024-10-11 14:03:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811870307] [2024-10-11 14:03:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,098 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-11 14:03:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811870307] [2024-10-11 14:03:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811870307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:05,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:05,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:03:05,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477670387] [2024-10-11 14:03:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:03:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:03:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:03:05,100 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-11 14:03:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:05,140 INFO L93 Difference]: Finished difference Result 203 states and 280 transitions. [2024-10-11 14:03:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:05,141 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-11 14:03:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:05,142 INFO L225 Difference]: With dead ends: 203 [2024-10-11 14:03:05,142 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 14:03:05,142 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-11 14:03:05,143 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-11 14:03:05,143 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-11 14:03:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 14:03:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 14:03:05,150 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-11 14:03:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2024-10-11 14:03:05,151 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 119 [2024-10-11 14:03:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:05,151 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2024-10-11 14:03:05,151 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-11 14:03:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2024-10-11 14:03:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:03:05,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:05,152 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-11 14:03:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:03:05,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1950694842, now seen corresponding path program 1 times [2024-10-11 14:03:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242642381] [2024-10-11 14:03:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,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-11 14:03:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242642381] [2024-10-11 14:03:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242642381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:07,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:07,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:03:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820008943] [2024-10-11 14:03:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:07,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:03:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:03:07,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:03:07,015 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-11 14:03:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:07,385 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-10-11 14:03:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:03:07,386 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-11 14:03:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:07,386 INFO L225 Difference]: With dead ends: 208 [2024-10-11 14:03:07,387 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 14:03:07,387 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-11 14:03:07,387 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-11 14:03:07,388 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-11 14:03:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 14:03:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-10-11 14:03:07,396 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-11 14:03:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-10-11 14:03:07,397 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 121 [2024-10-11 14:03:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:07,397 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-10-11 14:03:07,397 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-11 14:03:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-10-11 14:03:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:03:07,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:07,398 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-11 14:03:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:03:07,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2024-10-11 14:03:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011846896] [2024-10-11 14:03:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,677 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-11 14:03:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011846896] [2024-10-11 14:03:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011846896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:07,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:03:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713181101] [2024-10-11 14:03:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:07,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:03:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:03:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:03:07,679 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-11 14:03:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:07,923 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2024-10-11 14:03:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:07,924 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-11 14:03:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:07,924 INFO L225 Difference]: With dead ends: 227 [2024-10-11 14:03:07,924 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 14:03:07,925 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-11 14:03:07,925 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-11 14:03:07,925 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-11 14:03:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 14:03:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 106. [2024-10-11 14:03:07,933 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-11 14:03:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2024-10-11 14:03:07,934 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 121 [2024-10-11 14:03:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2024-10-11 14:03:07,934 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-11 14:03:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2024-10-11 14:03:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 14:03:07,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:07,935 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-11 14:03:07,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:03:07,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2024-10-11 14:03:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462575764] [2024-10-11 14:03:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:07,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,695 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-11 14:03:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462575764] [2024-10-11 14:03:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462575764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:03:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968240234] [2024-10-11 14:03:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:03:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:03:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:03:08,697 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-11 14:03:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:09,027 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2024-10-11 14:03:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:03:09,028 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-11 14:03:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:09,029 INFO L225 Difference]: With dead ends: 258 [2024-10-11 14:03:09,030 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 14:03:09,030 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-11 14:03:09,031 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-11 14:03:09,031 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-11 14:03:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 14:03:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2024-10-11 14:03:09,042 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-11 14:03:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2024-10-11 14:03:09,043 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 123 [2024-10-11 14:03:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2024-10-11 14:03:09,046 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-11 14:03:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2024-10-11 14:03:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 14:03:09,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:09,047 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-11 14:03:09,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:03:09,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:09,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 671553404, now seen corresponding path program 1 times [2024-10-11 14:03:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207324616] [2024-10-11 14:03:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,601 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-11 14:03:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:09,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207324616] [2024-10-11 14:03:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207324616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:03:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450701427] [2024-10-11 14:03:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:03:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:03:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:03:09,604 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-11 14:03:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:09,958 INFO L93 Difference]: Finished difference Result 290 states and 384 transitions. [2024-10-11 14:03:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:09,959 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-11 14:03:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:09,960 INFO L225 Difference]: With dead ends: 290 [2024-10-11 14:03:09,960 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 14:03:09,961 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-11 14:03:09,961 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-11 14:03:09,962 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-11 14:03:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 14:03:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2024-10-11 14:03:09,979 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-11 14:03:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2024-10-11 14:03:09,980 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 124 [2024-10-11 14:03:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2024-10-11 14:03:09,980 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-11 14:03:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2024-10-11 14:03:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 14:03:09,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:09,982 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-11 14:03:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:03:09,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -772063983, now seen corresponding path program 1 times [2024-10-11 14:03:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537373913] [2024-10-11 14:03:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,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-11 14:03:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537373913] [2024-10-11 14:03:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537373913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:03:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192649979] [2024-10-11 14:03:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:03:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:03:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:03:10,753 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-11 14:03:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:11,175 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2024-10-11 14:03:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:03:11,176 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-11 14:03:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:11,177 INFO L225 Difference]: With dead ends: 190 [2024-10-11 14:03:11,177 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 14:03:11,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:03:11,178 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 370 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 14:03:11,178 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-11 14:03:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 14:03:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2024-10-11 14:03:11,190 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-11 14:03:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 223 transitions. [2024-10-11 14:03:11,191 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 223 transitions. Word has length 125 [2024-10-11 14:03:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:11,191 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 223 transitions. [2024-10-11 14:03:11,191 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-11 14:03:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 223 transitions. [2024-10-11 14:03:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 14:03:11,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:11,192 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-11 14:03:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:03:11,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1452136592, now seen corresponding path program 1 times [2024-10-11 14:03:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483245346] [2024-10-11 14:03:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,654 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-11 14:03:11,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:11,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483245346] [2024-10-11 14:03:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483245346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:11,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:03:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178056966] [2024-10-11 14:03:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:03:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:03:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:03:11,656 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-11 14:03:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:11,940 INFO L93 Difference]: Finished difference Result 370 states and 470 transitions. [2024-10-11 14:03:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:11,940 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-11 14:03:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:11,941 INFO L225 Difference]: With dead ends: 370 [2024-10-11 14:03:11,941 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 14:03:11,942 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-11 14:03:11,942 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-11 14:03:11,942 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-11 14:03:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 14:03:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 176. [2024-10-11 14:03:11,951 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-11 14:03:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2024-10-11 14:03:11,952 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 125 [2024-10-11 14:03:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2024-10-11 14:03:11,953 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-11 14:03:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2024-10-11 14:03:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 14:03:11,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:11,954 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-11 14:03:11,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:03:11,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:11,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1836143434, now seen corresponding path program 1 times [2024-10-11 14:03:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286157356] [2024-10-11 14:03:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,329 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-11 14:03:12,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286157356] [2024-10-11 14:03:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286157356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:12,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:03:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229141908] [2024-10-11 14:03:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:12,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:03:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:03:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:03:12,330 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-11 14:03:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:12,780 INFO L93 Difference]: Finished difference Result 426 states and 533 transitions. [2024-10-11 14:03:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:03:12,780 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-11 14:03:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:12,781 INFO L225 Difference]: With dead ends: 426 [2024-10-11 14:03:12,782 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 14:03:12,782 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-11 14:03:12,782 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-11 14:03:12,782 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-11 14:03:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 14:03:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2024-10-11 14:03:12,793 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-11 14:03:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 266 transitions. [2024-10-11 14:03:12,794 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 266 transitions. Word has length 126 [2024-10-11 14:03:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:12,794 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 266 transitions. [2024-10-11 14:03:12,794 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-11 14:03:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 266 transitions. [2024-10-11 14:03:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 14:03:12,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:12,795 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-11 14:03:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:03:12,796 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 87084600, now seen corresponding path program 1 times [2024-10-11 14:03:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002446178] [2024-10-11 14:03:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,942 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-11 14:03:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002446178] [2024-10-11 14:03:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002446178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:03:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832900371] [2024-10-11 14:03:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:03:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:03:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:03:12,943 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-11 14:03:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:13,059 INFO L93 Difference]: Finished difference Result 447 states and 557 transitions. [2024-10-11 14:03:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:03:13,060 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-11 14:03:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:13,061 INFO L225 Difference]: With dead ends: 447 [2024-10-11 14:03:13,061 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 14:03:13,061 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-11 14:03:13,061 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-11 14:03:13,062 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-11 14:03:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 14:03:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 176. [2024-10-11 14:03:13,073 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-11 14:03:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2024-10-11 14:03:13,074 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 126 [2024-10-11 14:03:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:13,074 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2024-10-11 14:03:13,074 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-11 14:03:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2024-10-11 14:03:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 14:03:13,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:13,076 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-11 14:03:13,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:03:13,076 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -393966798, now seen corresponding path program 1 times [2024-10-11 14:03:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369405479] [2024-10-11 14:03:13,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:03:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,727 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-11 14:03:13,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369405479] [2024-10-11 14:03:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369405479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:03:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7292475] [2024-10-11 14:03:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:13,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:13,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:03:13,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:03:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:13,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-11 14:03:13,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:14,598 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-11 14:03:15,077 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-11 14:03:15,381 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-11 14:03:15,710 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-11 14:03:16,013 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-11 14:03:16,363 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-11 14:03:16,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,642 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-11 14:03:16,782 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-11 14:03:16,782 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-11 14:03:16,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,850 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-11 14:03:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,921 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-11 14:03:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:17,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:17,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:17,067 INFO L349 Elim1Store]: treesize reduction 110, result has 19.7 percent of original size [2024-10-11 14:03:17,067 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-11 14:03:17,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:17,186 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2024-10-11 14:03:17,186 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-11 14:03:18,417 INFO L349 Elim1Store]: treesize reduction 116, result has 37.3 percent of original size [2024-10-11 14:03:18,418 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-11 14:03:20,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:20,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:20,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:20,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:20,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:20,937 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-11 14:03:20,937 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-11 14:03:21,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,374 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2024-10-11 14:03:21,374 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-11 14:03:21,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,515 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-11 14:03:21,515 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-11 14:03:21,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,624 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 14:03:21,624 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-11 14:03:21,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,736 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 14:03:21,737 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-11 14:03:21,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:21,823 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-11 14:03:21,823 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-11 14:03:23,126 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-11 14:03:23,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:03:24,225 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-11 14:03:28,382 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-11 14:03:32,812 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-11 14:03:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7292475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:03:33,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:03:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-11 14:03:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027894211] [2024-10-11 14:03:33,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:03:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 14:03:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 14:03:33,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=614, Unknown=3, NotChecked=156, Total=870 [2024-10-11 14:03:33,103 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-11 14:03:37,927 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-11 14:03:42,493 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-11 14:03:48,479 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-11 14:03:52,644 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-11 14:03:57,280 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-11 14:04:02,728 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-11 14:04:09,664 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-11 14:04:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:09,680 INFO L93 Difference]: Finished difference Result 435 states and 534 transitions. [2024-10-11 14:04:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 14:04:09,681 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-11 14:04:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:09,682 INFO L225 Difference]: With dead ends: 435 [2024-10-11 14:04:09,682 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 14:04:09,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=534, Invalid=2231, Unknown=3, NotChecked=312, Total=3080 [2024-10-11 14:04:09,683 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 385 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 152 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s 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, 32.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:09,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 559 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1313 Invalid, 7 Unknown, 0 Unchecked, 32.2s Time] [2024-10-11 14:04:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 14:04:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2024-10-11 14:04:09,716 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-11 14:04:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-10-11 14:04:09,717 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 127 [2024-10-11 14:04:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:09,719 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-10-11 14:04:09,719 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-11 14:04:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-10-11 14:04:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 14:04:09,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:09,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, 1, 1] [2024-10-11 14:04:09,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:04:09,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 14:04:09,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:09,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash -213349927, now seen corresponding path program 1 times [2024-10-11 14:04:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431892760] [2024-10-11 14:04:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:04:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:04:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:04:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:04:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:04:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:04:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:04:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,092 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-11 14:04:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431892760] [2024-10-11 14:04:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431892760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588641620] [2024-10-11 14:04:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:10,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:10,099 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-11 14:04:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:10,507 INFO L93 Difference]: Finished difference Result 301 states and 368 transitions. [2024-10-11 14:04:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:10,507 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-11 14:04:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:10,509 INFO L225 Difference]: With dead ends: 301 [2024-10-11 14:04:10,509 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 14:04:10,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:10,510 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 14:04:10,510 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-11 14:04:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 14:04:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-11 14:04:10,538 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-11 14:04:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2024-10-11 14:04:10,539 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 127 [2024-10-11 14:04:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:10,539 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2024-10-11 14:04:10,539 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-11 14:04:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2024-10-11 14:04:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 14:04:10,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:10,540 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-11 14:04:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:04:10,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:10,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 383481696, now seen corresponding path program 1 times [2024-10-11 14:04:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761755869] [2024-10-11 14:04:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:04:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:04:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:04:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:04:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:04:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:04:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:04:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,599 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-11 14:04:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761755869] [2024-10-11 14:04:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761755869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:10,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:04:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138456093] [2024-10-11 14:04:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:04:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:04:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:04:10,600 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-11 14:04:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:10,665 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2024-10-11 14:04:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:04:10,665 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-11 14:04:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:10,666 INFO L225 Difference]: With dead ends: 261 [2024-10-11 14:04:10,666 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 14:04:10,667 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-11 14:04:10,667 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:10,667 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.0s Time] [2024-10-11 14:04:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 14:04:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-11 14:04:10,695 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-11 14:04:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-11 14:04:10,696 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 128 [2024-10-11 14:04:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:10,696 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-11 14:04:10,696 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-11 14:04:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-11 14:04:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 14:04:10,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:10,697 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-11 14:04:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:04:10,697 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2136478238, now seen corresponding path program 1 times [2024-10-11 14:04:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724167180] [2024-10-11 14:04:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:04:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:04:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:04:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:04:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:04:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:04:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:04:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:04:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:04:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:10,900 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-11 14:04:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724167180] [2024-10-11 14:04:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724167180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:10,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457672572] [2024-10-11 14:04:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:10,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:10,902 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-11 14:04:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:11,225 INFO L93 Difference]: Finished difference Result 251 states and 306 transitions. [2024-10-11 14:04:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:11,225 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-11 14:04:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:11,226 INFO L225 Difference]: With dead ends: 251 [2024-10-11 14:04:11,226 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 14:04:11,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:11,227 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:11,227 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.3s Time] [2024-10-11 14:04:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 14:04:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 14:04:11,228 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-11 14:04:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 14:04:11,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2024-10-11 14:04:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:11,228 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 14:04:11,228 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-11 14:04:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 14:04:11,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 14:04:11,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:04:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 14:04:11,233 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-11 14:04:11,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 14:04:18,264 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 284 DAG size of output: 285 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 14:04:26,824 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:04:26,831 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,832 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,833 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base [2024-10-11 14:04:26,833 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,833 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,833 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,834 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,835 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,836 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,837 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base [2024-10-11 14:04:26,852 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,852 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,852 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base [2024-10-11 14:04:26,852 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base [2024-10-11 14:04:26,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base [2024-10-11 14:04:26,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,856 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,856 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base [2024-10-11 14:04:26,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base [2024-10-11 14:04:26,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,858 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base [2024-10-11 14:04:26,859 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,863 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset [2024-10-11 14:04:26,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base [2024-10-11 14:04:26,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:04:26 BoogieIcfgContainer [2024-10-11 14:04:26,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:04:26,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:04:26,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:04:26,870 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:04:26,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:59" (3/4) ... [2024-10-11 14:04:26,872 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:04:26,877 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 14:04:26,887 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 14:04:26,887 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 14:04:26,891 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:04:26,892 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 14:04:27,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:04:27,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:04:27,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:04:27,059 INFO L158 Benchmark]: Toolchain (without parser) took 88728.96ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,059 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:04:27,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.44ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 96.0MB in the beginning and 205.8MB in the end (delta: -109.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.11ms. Allocated memory is still 237.0MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,061 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 237.0MB. Free memory was 202.7MB in the beginning and 198.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,061 INFO L158 Benchmark]: RCFGBuilder took 556.04ms. Allocated memory is still 237.0MB. Free memory was 198.5MB in the beginning and 164.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,062 INFO L158 Benchmark]: TraceAbstraction took 87565.92ms. Allocated memory was 237.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 163.9MB in the beginning and 1.1GB in the end (delta: -966.8MB). Peak memory consumption was 794.8MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,062 INFO L158 Benchmark]: Witness Printer took 191.49ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:04:27,062 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.44ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 96.0MB in the beginning and 205.8MB in the end (delta: -109.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.11ms. Allocated memory is still 237.0MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 237.0MB. Free memory was 202.7MB in the beginning and 198.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 556.04ms. Allocated memory is still 237.0MB. Free memory was 198.5MB in the beginning and 164.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 87565.92ms. Allocated memory was 237.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 163.9MB in the beginning and 1.1GB in the end (delta: -966.8MB). Peak memory consumption was 794.8MB. Max. memory is 16.1GB. * Witness Printer took 191.49ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_10_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_12_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_13_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_11_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~WrapperStruct00_var_1_5_Pointer~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 2393 SdHoareTripleChecker+Valid, 35.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2386 mSDsluCounter, 7400 SdHoareTripleChecker+Invalid, 34.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5242 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5540 IncrementalHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 2158 mSDtfsCounter, 5540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1027 GetRequests, 832 SyntacticMatches, 3 SemanticMatches, 192 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=16, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 334 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 2677 NumberOfCodeBlocks, 2677 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2655 ConstructedInterpolants, 5 QuantifiedInterpolants, 23928 SizeOfPredicates, 9 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 9088/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 14:04:27,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE