./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:08:58,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:08:58,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:08:58,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:08:58,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:08:58,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:08:58,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:08:58,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:08:58,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:08:58,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:08:58,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:08:58,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:08:58,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:08:58,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:08:58,478 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:08:58,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:08:58,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:08:58,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:08:58,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:08:58,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:08:58,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:08:58,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:08:58,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:08:58,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:08:58,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:08:58,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:08:58,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:08:58,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:08:58,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:08:58,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:08:58,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:08:58,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:08:58,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:08:58,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:08:58,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:08:58,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:08:58,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:08:58,498 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2024-11-09 22:08:58,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:08:58,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:08:58,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:08:58,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:08:58,793 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:08:58,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-09 22:09:00,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:09:00,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:09:00,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-09 22:09:00,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affebdef1/8f1f3418e3dc45cb87d271aed752c60f/FLAG608010eab [2024-11-09 22:09:00,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affebdef1/8f1f3418e3dc45cb87d271aed752c60f [2024-11-09 22:09:00,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:09:00,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:09:00,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:00,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:09:00,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:09:00,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:00" (1/1) ... [2024-11-09 22:09:00,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314abd79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:00, skipping insertion in model container [2024-11-09 22:09:00,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:00" (1/1) ... [2024-11-09 22:09:00,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:09:00,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2024-11-09 22:09:00,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:00,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:09:00,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2024-11-09 22:09:00,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:01,032 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:09:01,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01 WrapperNode [2024-11-09 22:09:01,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:01,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:01,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:09:01,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:09:01,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,082 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-11-09 22:09:01,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:01,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:09:01,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:09:01,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:09:01,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,126 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 7 writes are split as follows [0, 2, 5]. [2024-11-09 22:09:01,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:09:01,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:09:01,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:09:01,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:09:01,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:01,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:01,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:09:01,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:09:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:09:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:09:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:09:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:09:01,230 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:09:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:09:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:09:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:09:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:09:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:09:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:09:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:09:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:09:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:09:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:09:01,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:09:01,349 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:09:01,352 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:09:01,525 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:09:01,546 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:09:01,565 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 22:09:01,565 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:09:01,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:09:01,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:09:01,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:01 BoogieIcfgContainer [2024-11-09 22:09:01,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:09:01,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:09:01,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:09:01,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:09:01,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:00" (1/3) ... [2024-11-09 22:09:01,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d60bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:01, skipping insertion in model container [2024-11-09 22:09:01,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (2/3) ... [2024-11-09 22:09:01,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d60bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:01, skipping insertion in model container [2024-11-09 22:09:01,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:01" (3/3) ... [2024-11-09 22:09:01,586 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2024-11-09 22:09:01,601 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:09:01,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:09:01,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:09:01,665 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;@25ae33e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:09:01,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:09:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:09:01,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:01,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:01,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:01,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 617303201, now seen corresponding path program 1 times [2024-11-09 22:09:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672896471] [2024-11-09 22:09:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672896471] [2024-11-09 22:09:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672896471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:09:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877633922] [2024-11-09 22:09:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:09:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:09:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:02,047 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:02,104 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-11-09 22:09:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:09:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 22:09:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:02,150 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:09:02,154 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 22:09:02,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:02,169 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:02,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 22:09:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 22:09:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 22:09:02,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2024-11-09 22:09:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:02,232 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 22:09:02,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 22:09:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:09:02,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:02,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:09:02,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 113667393, now seen corresponding path program 1 times [2024-11-09 22:09:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353742253] [2024-11-09 22:09:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353742253] [2024-11-09 22:09:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353742253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:09:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719324723] [2024-11-09 22:09:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:09:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:09:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:02,472 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:02,525 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-09 22:09:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:09:02,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 22:09:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:02,527 INFO L225 Difference]: With dead ends: 45 [2024-11-09 22:09:02,528 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:09:02,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:02,530 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:02,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:09:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 22:09:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 22:09:02,541 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2024-11-09 22:09:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 22:09:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 22:09:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:09:02,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:02,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:09:02,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash -323179344, now seen corresponding path program 1 times [2024-11-09 22:09:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777587644] [2024-11-09 22:09:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777587644] [2024-11-09 22:09:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777587644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:02,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:09:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166482520] [2024-11-09 22:09:02,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:02,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:09:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:02,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:09:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:09:02,753 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:02,812 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 22:09:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 22:09:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:02,814 INFO L225 Difference]: With dead ends: 41 [2024-11-09 22:09:02,814 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 22:09:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:09:02,816 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:02,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 66 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 22:09:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-09 22:09:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 22:09:02,821 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2024-11-09 22:09:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:02,821 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 22:09:02,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 22:09:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:09:02,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:02,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:02,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:09:02,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:02,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1564115890, now seen corresponding path program 1 times [2024-11-09 22:09:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594427898] [2024-11-09 22:09:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594427898] [2024-11-09 22:09:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594427898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959413852] [2024-11-09 22:09:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:03,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:03,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:09:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 22:09:03,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959413852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:03,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 22:09:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271175545] [2024-11-09 22:09:03,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:09:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:09:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:03,407 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:03,476 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-09 22:09:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:09:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-09 22:09:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:03,478 INFO L225 Difference]: With dead ends: 43 [2024-11-09 22:09:03,478 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 22:09:03,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:03,481 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:03,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 22:09:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 22:09:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 22:09:03,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 32 [2024-11-09 22:09:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:03,492 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 22:09:03,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 22:09:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 22:09:03,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:03,494 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:03,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:09:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:03,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2105455380, now seen corresponding path program 2 times [2024-11-09 22:09:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324112795] [2024-11-09 22:09:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324112795] [2024-11-09 22:09:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324112795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:03,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:09:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240587531] [2024-11-09 22:09:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:03,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:03,987 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:04,074 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-09 22:09:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:09:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-09 22:09:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:04,076 INFO L225 Difference]: With dead ends: 53 [2024-11-09 22:09:04,076 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:09:04,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:09:04,077 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:04,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:09:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2024-11-09 22:09:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 22:09:04,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 36 [2024-11-09 22:09:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:04,084 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 22:09:04,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 22:09:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:09:04,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:04,085 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:04,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:09:04,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1024736727, now seen corresponding path program 1 times [2024-11-09 22:09:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676532678] [2024-11-09 22:09:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:04,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676532678] [2024-11-09 22:09:04,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676532678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:04,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:09:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357816117] [2024-11-09 22:09:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:04,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:04,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:04,467 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:04,562 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-09 22:09:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:09:04,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-09 22:09:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:04,563 INFO L225 Difference]: With dead ends: 58 [2024-11-09 22:09:04,563 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 22:09:04,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:09:04,564 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:04,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 22:09:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 22:09:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-09 22:09:04,571 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2024-11-09 22:09:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:04,572 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-09 22:09:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-09 22:09:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:04,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:04,573 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:09:04,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2135107830, now seen corresponding path program 1 times [2024-11-09 22:09:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091134239] [2024-11-09 22:09:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:09:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091134239] [2024-11-09 22:09:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091134239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559668709] [2024-11-09 22:09:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:05,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:05,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:05,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:09:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 22:09:05,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:05,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 22:09:05,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:09:05,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:09:05,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:05,580 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:09:05,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 22:09:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-11-09 22:09:05,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-09 22:09:05,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 22:09:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:05,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:05,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-09 22:09:05,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 22:09:05,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:05,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-09 22:09:05,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-09 22:09:05,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 22:09:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559668709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:05,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2024-11-09 22:09:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603485366] [2024-11-09 22:09:05,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 22:09:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:05,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 22:09:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=532, Unknown=7, NotChecked=0, Total=600 [2024-11-09 22:09:05,972 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:09:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:06,334 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-11-09 22:09:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:09:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-09 22:09:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:06,339 INFO L225 Difference]: With dead ends: 74 [2024-11-09 22:09:06,339 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 22:09:06,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=722, Unknown=7, NotChecked=0, Total=812 [2024-11-09 22:09:06,342 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:06,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 278 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:09:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 22:09:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-11-09 22:09:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:09:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-09 22:09:06,357 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 41 [2024-11-09 22:09:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:06,359 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-09 22:09:06,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:09:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-09 22:09:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:09:06,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:06,360 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:06,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:09:06,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 22:09:06,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 257807664, now seen corresponding path program 1 times [2024-11-09 22:09:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189450363] [2024-11-09 22:09:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189450363] [2024-11-09 22:09:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189450363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428047792] [2024-11-09 22:09:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:07,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:07,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:07,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:09:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-09 22:09:07,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:07,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 96 [2024-11-09 22:09:07,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 22:09:07,938 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-09 22:09:07,938 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 55 [2024-11-09 22:09:07,954 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 22:09:07,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2024-11-09 22:09:08,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 59 [2024-11-09 22:09:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2024-11-09 22:09:08,157 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:09:08,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 22:09:08,164 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:09:08,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 22:09:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:09:08,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428047792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:08,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 11] total 30 [2024-11-09 22:09:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83640479] [2024-11-09 22:09:08,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 22:09:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 22:09:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2024-11-09 22:09:08,720 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 28 states have internal predecessors, (70), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:09:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:09,323 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2024-11-09 22:09:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:09:09,324 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 28 states have internal predecessors, (70), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 22:09:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:09,325 INFO L225 Difference]: With dead ends: 99 [2024-11-09 22:09:09,325 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 22:09:09,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 22:09:09,327 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:09,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 456 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:09:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 22:09:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2024-11-09 22:09:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:09:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-11-09 22:09:09,337 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 46 [2024-11-09 22:09:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:09,337 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-11-09 22:09:09,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 28 states have internal predecessors, (70), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:09:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-11-09 22:09:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 22:09:09,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:09,339 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:09,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:09:09,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:09,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:09,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1728684081, now seen corresponding path program 2 times [2024-11-09 22:09:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:09,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076273087] [2024-11-09 22:09:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076273087] [2024-11-09 22:09:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076273087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071871759] [2024-11-09 22:09:10,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:10,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:10,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:10,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:09:11,084 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:09:11,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:11,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-09 22:09:11,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 22:09:11,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:09:11,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:09:11,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:11,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:11,391 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 22:09:11,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2024-11-09 22:09:11,396 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2024-11-09 22:09:11,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2024-11-09 22:09:11,720 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 22:09:11,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2024-11-09 22:09:11,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:11,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:09:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:09:11,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:12,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2024-11-09 22:09:12,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2024-11-09 22:09:12,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:12,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 720 [2024-11-09 22:09:12,210 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:09:12,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 1 [2024-11-09 22:09:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071871759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:12,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:09:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2024-11-09 22:09:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134899871] [2024-11-09 22:09:12,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 22:09:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 22:09:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1454, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 22:09:12,466 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:13,402 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2024-11-09 22:09:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:09:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-09 22:09:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:13,404 INFO L225 Difference]: With dead ends: 97 [2024-11-09 22:09:13,404 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 22:09:13,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=2352, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 22:09:13,405 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:13,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 416 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:09:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 22:09:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-09 22:09:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:09:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2024-11-09 22:09:13,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 48 [2024-11-09 22:09:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2024-11-09 22:09:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2024-11-09 22:09:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 22:09:13,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:13,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:13,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:09:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:13,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1223793445, now seen corresponding path program 2 times [2024-11-09 22:09:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486380413] [2024-11-09 22:09:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:09:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 22:09:13,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486380413] [2024-11-09 22:09:13,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486380413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63639728] [2024-11-09 22:09:13,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:13,781 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:13,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:09:13,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:09:13,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:13,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:09:13,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:09:13,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:09:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63639728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:09:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 22:09:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98839522] [2024-11-09 22:09:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:13,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:09:13,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:13,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:09:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:13,995 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:09:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:14,011 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-09 22:09:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:09:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-09 22:09:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:14,012 INFO L225 Difference]: With dead ends: 101 [2024-11-09 22:09:14,013 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 22:09:14,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-11-09 22:09:14,014 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:14,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 22:09:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 22:09:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-09 22:09:14,026 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 50 [2024-11-09 22:09:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:14,027 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-09 22:09:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:09:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-09 22:09:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 22:09:14,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:14,028 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:14,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:09:14,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 22:09:14,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 20654418, now seen corresponding path program 3 times [2024-11-09 22:09:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:14,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310879917] [2024-11-09 22:09:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 22:09:14,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310879917] [2024-11-09 22:09:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310879917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151944377] [2024-11-09 22:09:14,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:09:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:14,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:14,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:09:14,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 22:09:14,812 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:14,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:09:14,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 22:09:14,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:09:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151944377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:14,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:09:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-09 22:09:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153361435] [2024-11-09 22:09:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:14,906 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:14,928 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-09 22:09:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:09:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-09 22:09:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:14,929 INFO L225 Difference]: With dead ends: 56 [2024-11-09 22:09:14,929 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 22:09:14,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:14,930 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:14,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 22:09:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 22:09:14,930 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-11-09 22:09:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 22:09:14,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-09 22:09:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:14,931 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 22:09:14,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 22:09:14,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 22:09:14,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:09:14,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 22:09:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:15,138 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2024-11-09 22:09:15,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 22:09:15,457 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:09:15,473 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-09 22:09:15,478 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 22:09:15,479 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-09 22:09:15,481 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 22:09:15,481 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 22:09:15,481 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 22:09:15,481 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 22:09:15,484 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 22:09:15,485 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 22:09:15,485 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 22:09:15,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:09:15 BoogieIcfgContainer [2024-11-09 22:09:15,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:09:15,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:09:15,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:09:15,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:09:15,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:01" (3/4) ... [2024-11-09 22:09:15,490 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 22:09:15,494 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-09 22:09:15,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 22:09:15,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 22:09:15,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 22:09:15,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 22:09:15,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:09:15,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 22:09:15,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:09:15,594 INFO L158 Benchmark]: Toolchain (without parser) took 15057.61ms. Allocated memory was 174.1MB in the beginning and 423.6MB in the end (delta: 249.6MB). Free memory was 116.4MB in the beginning and 345.4MB in the end (delta: -229.0MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,594 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 174.1MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:09:15,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.41ms. Allocated memory is still 174.1MB. Free memory was 116.4MB in the beginning and 96.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 174.1MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,595 INFO L158 Benchmark]: Boogie Preprocessor took 62.20ms. Allocated memory is still 174.1MB. Free memory was 94.2MB in the beginning and 91.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,595 INFO L158 Benchmark]: IcfgBuilder took 430.73ms. Allocated memory is still 174.1MB. Free memory was 91.6MB in the beginning and 74.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,595 INFO L158 Benchmark]: TraceAbstraction took 13905.32ms. Allocated memory was 174.1MB in the beginning and 423.6MB in the end (delta: 249.6MB). Free memory was 74.0MB in the beginning and 350.6MB in the end (delta: -276.6MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,596 INFO L158 Benchmark]: Witness Printer took 106.40ms. Allocated memory is still 423.6MB. Free memory was 350.6MB in the beginning and 345.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 22:09:15,599 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.24ms. Allocated memory is still 174.1MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.41ms. Allocated memory is still 174.1MB. Free memory was 116.4MB in the beginning and 96.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 174.1MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.20ms. Allocated memory is still 174.1MB. Free memory was 94.2MB in the beginning and 91.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 430.73ms. Allocated memory is still 174.1MB. Free memory was 91.6MB in the beginning and 74.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13905.32ms. Allocated memory was 174.1MB in the beginning and 423.6MB in the end (delta: 249.6MB). Free memory was 74.0MB in the beginning and 350.6MB in the end (delta: -276.6MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. * Witness Printer took 106.40ms. Allocated memory is still 423.6MB. Free memory was 350.6MB in the beginning and 345.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 623]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1797 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1504 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1383 IncrementalHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 293 mSDtfsCounter, 1383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 43 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 673 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 772 ConstructedInterpolants, 9 QuantifiedInterpolants, 5963 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2132 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 342/413 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: 602]: Location Invariant Derived location invariant: null - InvariantResult [Line: 615]: Location Invariant Derived location invariant: null - InvariantResult [Line: 586]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 22:09:15,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE