./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:44:09,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:44:09,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:44:09,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:44:09,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:44:09,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:44:09,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:44:09,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:44:09,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:44:09,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:44:09,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:44:09,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:44:09,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:44:09,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:44:09,825 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:44:09,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:44:09,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:44:09,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:44:09,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:44:09,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:44:09,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:44:09,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:44:09,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:44:09,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:44:09,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:44:09,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:44:09,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:44:09,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:44:09,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:44:09,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:44:09,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:44:09,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:44:09,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:44:09,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:44:09,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:44:09,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:44:09,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:44:09,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:44:09,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:44:09,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:44:09,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:44:09,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:44:09,832 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2024-11-19 20:44:10,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:44:10,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:44:10,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:44:10,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:44:10,119 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:44:10,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-11-19 20:44:11,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:44:11,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:44:11,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-11-19 20:44:11,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00bfbb33/a46a66a9c546478d8fec889c4cf34481/FLAG5c97540a4 [2024-11-19 20:44:11,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00bfbb33/a46a66a9c546478d8fec889c4cf34481 [2024-11-19 20:44:11,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:44:11,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:44:11,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:44:11,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:44:11,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:44:11,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:44:11" (1/1) ... [2024-11-19 20:44:11,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234dccf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:11, skipping insertion in model container [2024-11-19 20:44:11,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:44:11" (1/1) ... [2024-11-19 20:44:11,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:44:12,092 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/forester-heap/dll-circular-2.i[22391,22404] [2024-11-19 20:44:12,097 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/forester-heap/dll-circular-2.i[22497,22510] [2024-11-19 20:44:12,099 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/forester-heap/dll-circular-2.i[22622,22635] [2024-11-19 20:44:12,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:44:12,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:44:12,151 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/forester-heap/dll-circular-2.i[22391,22404] [2024-11-19 20:44:12,152 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/forester-heap/dll-circular-2.i[22497,22510] [2024-11-19 20:44:12,153 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/forester-heap/dll-circular-2.i[22622,22635] [2024-11-19 20:44:12,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:44:12,181 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:44:12,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12 WrapperNode [2024-11-19 20:44:12,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:44:12,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:44:12,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:44:12,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:44:12,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,240 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2024-11-19 20:44:12,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:44:12,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:44:12,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:44:12,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:44:12,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,280 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-19 20:44:12,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:44:12,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:44:12,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:44:12,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:44:12,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (1/1) ... [2024-11-19 20:44:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:44:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:12,342 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-19 20:44:12,345 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-19 20:44:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:44:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:44:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:44:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:44:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:44:12,488 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:44:12,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:44:12,719 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-19 20:44:12,720 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:44:12,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:44:12,738 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 20:44:12,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:44:12 BoogieIcfgContainer [2024-11-19 20:44:12,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:44:12,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:44:12,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:44:12,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:44:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:44:11" (1/3) ... [2024-11-19 20:44:12,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2286e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:44:12, skipping insertion in model container [2024-11-19 20:44:12,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:44:12" (2/3) ... [2024-11-19 20:44:12,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2286e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:44:12, skipping insertion in model container [2024-11-19 20:44:12,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:44:12" (3/3) ... [2024-11-19 20:44:12,751 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2024-11-19 20:44:12,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:44:12,768 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 20:44:12,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:44:12,826 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;@67993e30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:44:12,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 20:44:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 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-19 20:44:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 20:44:12,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:12,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 20:44:12,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2024-11-19 20:44:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058659969] [2024-11-19 20:44:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:13,036 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-19 20:44:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058659969] [2024-11-19 20:44:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058659969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:44:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111384606] [2024-11-19 20:44:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:44:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:44:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:44:13,062 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-19 20:44:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:13,074 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2024-11-19 20:44:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:44:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-19 20:44:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:13,081 INFO L225 Difference]: With dead ends: 64 [2024-11-19 20:44:13,082 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 20:44:13,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:44:13,087 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:13,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:44:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 20:44:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 20:44:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 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-19 20:44:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-19 20:44:13,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2024-11-19 20:44:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:13,128 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-19 20:44:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-19 20:44:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-19 20:44:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 20:44:13,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:13,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:13,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:44:13,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2024-11-19 20:44:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684446815] [2024-11-19 20:44:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:13,570 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-19 20:44:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684446815] [2024-11-19 20:44:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684446815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:13,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:44:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299208616] [2024-11-19 20:44:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:13,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:44:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:44:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:44:13,577 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-19 20:44:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:13,663 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-19 20:44:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:44:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-11-19 20:44:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:13,665 INFO L225 Difference]: With dead ends: 42 [2024-11-19 20:44:13,666 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:44:13,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:44:13,667 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:13,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:44:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:44:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2024-11-19 20:44:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 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-19 20:44:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-19 20:44:13,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2024-11-19 20:44:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:13,676 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-19 20:44:13,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-19 20:44:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-19 20:44:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 20:44:13,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:13,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:44:13,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2024-11-19 20:44:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018948572] [2024-11-19 20:44:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:13,754 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-19 20:44:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018948572] [2024-11-19 20:44:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018948572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:13,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:44:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201729607] [2024-11-19 20:44:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:44:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:44:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:44:13,756 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 20:44:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:13,780 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-19 20:44:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:44:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2024-11-19 20:44:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:13,783 INFO L225 Difference]: With dead ends: 58 [2024-11-19 20:44:13,784 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:44:13,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 20:44:13,787 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 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-19 20:44:13,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:44:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:44:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-19 20:44:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-19 20:44:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-19 20:44:13,797 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2024-11-19 20:44:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:13,797 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-19 20:44:13,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 20:44:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-19 20:44:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 20:44:13,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:13,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:13,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:44:13,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2024-11-19 20:44:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268006758] [2024-11-19 20:44:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:13,852 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-19 20:44:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268006758] [2024-11-19 20:44:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268006758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:44:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683583220] [2024-11-19 20:44:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:13,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:44:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:44:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:44:13,854 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-19 20:44:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:13,874 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-19 20:44:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:44:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2024-11-19 20:44:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:13,876 INFO L225 Difference]: With dead ends: 38 [2024-11-19 20:44:13,876 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:44:13,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 20:44:13,877 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:13,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:44:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:44:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 20:44:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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-19 20:44:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-19 20:44:13,887 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2024-11-19 20:44:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:13,888 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-19 20:44:13,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-19 20:44:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-19 20:44:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 20:44:13,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:13,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:13,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:44:13,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:13,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -84802755, now seen corresponding path program 1 times [2024-11-19 20:44:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361047102] [2024-11-19 20:44:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:14,399 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-19 20:44:14,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361047102] [2024-11-19 20:44:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361047102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:44:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911701611] [2024-11-19 20:44:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:14,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:44:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:44:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:44:14,402 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-19 20:44:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:14,525 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-19 20:44:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:44:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2024-11-19 20:44:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:14,527 INFO L225 Difference]: With dead ends: 47 [2024-11-19 20:44:14,527 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 20:44:14,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:44:14,528 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:14,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:44:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 20:44:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 20:44:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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-19 20:44:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-19 20:44:14,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2024-11-19 20:44:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-19 20:44:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-19 20:44:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-19 20:44:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 20:44:14,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:14,534 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:44:14,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:14,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1783178116, now seen corresponding path program 1 times [2024-11-19 20:44:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807628204] [2024-11-19 20:44:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807628204] [2024-11-19 20:44:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807628204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105203152] [2024-11-19 20:44:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:14,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:14,781 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-19 20:44:14,785 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-19 20:44:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:14,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 20:44:14,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:14,961 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-19 20:44:15,006 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-19 20:44:15,029 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:44:15,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2024-11-19 20:44:15,048 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 5 treesize of output 3 [2024-11-19 20:44:15,055 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 5 treesize of output 3 [2024-11-19 20:44:15,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:44:15,086 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-19 20:44:15,104 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-19 20:44:15,122 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-19 20:44:15,122 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 2 case distinctions, treesize of input 114 treesize of output 82 [2024-11-19 20:44:15,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:44:15,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:44:15,143 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 28 treesize of output 20 [2024-11-19 20:44:15,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:44:15,271 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 47 treesize of output 27 [2024-11-19 20:44:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:15,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:15,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:15,406 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 88 treesize of output 72 [2024-11-19 20:44:15,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:15,428 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 203 treesize of output 158 [2024-11-19 20:44:15,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:15,449 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 141 treesize of output 137 [2024-11-19 20:44:15,466 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 80 treesize of output 74 [2024-11-19 20:44:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105203152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:44:15,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:44:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2024-11-19 20:44:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161915692] [2024-11-19 20:44:15,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:15,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:44:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:44:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2024-11-19 20:44:15,847 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-19 20:44:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:15,979 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-11-19 20:44:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:44:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) Word has length 13 [2024-11-19 20:44:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:15,981 INFO L225 Difference]: With dead ends: 61 [2024-11-19 20:44:15,981 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:44:15,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=91, Unknown=2, NotChecked=0, Total=132 [2024-11-19 20:44:15,982 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:15,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 100 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:44:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:44:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2024-11-19 20:44:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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-19 20:44:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-19 20:44:15,992 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2024-11-19 20:44:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-19 20:44:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-19 20:44:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-19 20:44:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 20:44:15,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:15,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:16,002 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-19 20:44:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 20:44:16,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1644077251, now seen corresponding path program 1 times [2024-11-19 20:44:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:16,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36094870] [2024-11-19 20:44:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36094870] [2024-11-19 20:44:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36094870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:44:16,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:44:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:44:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020180592] [2024-11-19 20:44:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:44:16,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:44:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:44:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:44:16,252 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 20:44:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:16,273 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2024-11-19 20:44:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:44:16,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2024-11-19 20:44:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:16,274 INFO L225 Difference]: With dead ends: 81 [2024-11-19 20:44:16,274 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:44:16,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 20:44:16,275 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:16,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:44:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:44:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-19 20:44:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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-19 20:44:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-11-19 20:44:16,281 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2024-11-19 20:44:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:16,281 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-11-19 20:44:16,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 20:44:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-19 20:44:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 20:44:16,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:16,282 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:16,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:44:16,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:16,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash 619754034, now seen corresponding path program 1 times [2024-11-19 20:44:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307228340] [2024-11-19 20:44:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:16,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307228340] [2024-11-19 20:44:16,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307228340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:16,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498864446] [2024-11-19 20:44:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:16,943 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-19 20:44:16,945 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-19 20:44:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-19 20:44:17,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:17,061 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-19 20:44:17,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 20:44:17,134 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 20:44:17,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:44:17,143 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-19 20:44:17,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-19 20:44:17,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:17,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2024-11-19 20:44:17,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-19 20:44:17,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-19 20:44:17,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-19 20:44:17,180 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 8 treesize of output 7 [2024-11-19 20:44:17,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:17,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-19 20:44:17,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:44:17,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 20:44:17,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:44:17,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 20:44:17,414 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-19 20:44:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 69 [2024-11-19 20:44:17,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 71 [2024-11-19 20:44:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2024-11-19 20:44:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:44:17,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:17,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 v_ArrVal_419))) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_418))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 |c_ULTIMATE.start_main_~state~0#1|)) (select (select .cse1 .cse2) .cse3)) (+ 8 (select (select .cse4 .cse2) .cse3))))) 0) (not (= v_ArrVal_418 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_418 .cse0))))))) is different from false [2024-11-19 20:44:17,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:17,783 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2024-11-19 20:44:17,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (not (= |c_ULTIMATE.start_main_~state~0#1| (select v_arrayElimArr_7 .cse0))) (not (= v_ArrVal_418 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_418 .cse0)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 v_ArrVal_419))) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_418))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) (select (select .cse1 .cse2) .cse3)) (+ 8 (select (select .cse4 .cse2) .cse3))))) 0)))) is different from false [2024-11-19 20:44:17,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:17,838 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 547 treesize of output 427 [2024-11-19 20:44:17,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:17,850 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 404 treesize of output 292 [2024-11-19 20:44:18,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:18,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 7240 treesize of output 6388 [2024-11-19 20:44:18,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:18,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 198102 treesize of output 178048 [2024-11-19 20:44:20,333 INFO L349 Elim1Store]: treesize reduction 928, result has 35.7 percent of original size [2024-11-19 20:44:20,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 2537 treesize of output 2769 [2024-11-19 20:44:20,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:20,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 9541 treesize of output 8517 [2024-11-19 20:44:21,893 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-19 20:44:23,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:23,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6