./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.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 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:38:01,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:38:01,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:38:01,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:38:01,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:38:01,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:38:01,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:38:01,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:38:01,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:38:01,528 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:38:01,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:38:01,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:38:01,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:38:01,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:38:01,531 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:38:01,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:38:01,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:38:01,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:38:01,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:38:01,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:38:01,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:38:01,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:38:01,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:38:01,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:38:01,534 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:38:01,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:38:01,534 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:38:01,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:38:01,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:38:01,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:38:01,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:38:01,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:38:01,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:38:01,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:38:01,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:38:01,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:38:01,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:38:01,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:38:01,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:38:01,537 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:38:01,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:38:01,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:38:01,538 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:38:01,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:38:01,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:38:01,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:38:01,775 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:38:01,776 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:38:01,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2023-11-22 21:38:02,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:38:02,961 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:38:02,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2023-11-22 21:38:02,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c98d142/1cd0bc6ed5274074a58f2d50be64ea16/FLAG9c030ce71 [2023-11-22 21:38:02,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c98d142/1cd0bc6ed5274074a58f2d50be64ea16 [2023-11-22 21:38:02,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:38:02,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:38:02,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:38:02,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:38:03,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:38:03,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:02" (1/1) ... [2023-11-22 21:38:03,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1e76d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03, skipping insertion in model container [2023-11-22 21:38:03,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:02" (1/1) ... [2023-11-22 21:38:03,046 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:38:03,232 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-11-22 21:38:03,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:38:03,273 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:38:03,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-11-22 21:38:03,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:38:03,336 WARN L675 CHandler]: The function insert_fnc is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:38:03,341 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:38:03,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03 WrapperNode [2023-11-22 21:38:03,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:38:03,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:38:03,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:38:03,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:38:03,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,398 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 230 [2023-11-22 21:38:03,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:38:03,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:38:03,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:38:03,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:38:03,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,413 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,440 INFO L189 HeapSplitter]: Split 48 memory accesses to 3 slices as follows [2, 6, 40] [2023-11-22 21:38:03,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:38:03,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:38:03,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:38:03,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:38:03,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (1/1) ... [2023-11-22 21:38:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:38:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:38:03,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:38:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:38:03,541 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-22 21:38:03,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-22 21:38:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-11-22 21:38:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-11-22 21:38:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:38:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:38:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-11-22 21:38:03,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-11-22 21:38:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:38:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 21:38:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:38:03,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 21:38:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:38:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 21:38:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 21:38:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-22 21:38:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-11-22 21:38:03,546 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-11-22 21:38:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-11-22 21:38:03,547 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-11-22 21:38:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:38:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 21:38:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 21:38:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:38:03,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:38:03,691 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:38:03,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:38:04,041 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:38:04,084 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:38:04,084 INFO L309 CfgBuilder]: Removed 38 assume(true) statements. [2023-11-22 21:38:04,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:04 BoogieIcfgContainer [2023-11-22 21:38:04,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:38:04,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:38:04,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:38:04,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:38:04,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:38:02" (1/3) ... [2023-11-22 21:38:04,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7469b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:38:04, skipping insertion in model container [2023-11-22 21:38:04,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:03" (2/3) ... [2023-11-22 21:38:04,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7469b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:38:04, skipping insertion in model container [2023-11-22 21:38:04,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:04" (3/3) ... [2023-11-22 21:38:04,090 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2023-11-22 21:38:04,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:38:04,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:38:04,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:38:04,147 INFO L357 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, mHoare=true, 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;@20297a5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:38:04,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:38:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 85 states have (on average 1.8) internal successors, (153), 105 states have internal predecessors, (153), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-22 21:38:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 21:38:04,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:04,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:04,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:04,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1364741834, now seen corresponding path program 1 times [2023-11-22 21:38:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:38:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537637378] [2023-11-22 21:38:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:38:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 21:38:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:38:04,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537637378] [2023-11-22 21:38:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537637378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:38:04,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:38:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:38:04,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544499699] [2023-11-22 21:38:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:38:04,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:38:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:38:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:38:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:38:04,654 INFO L87 Difference]: Start difference. First operand has 117 states, 85 states have (on average 1.8) internal successors, (153), 105 states have internal predecessors, (153), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:38:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:04,859 INFO L93 Difference]: Finished difference Result 231 states and 409 transitions. [2023-11-22 21:38:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:38:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-11-22 21:38:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:04,869 INFO L225 Difference]: With dead ends: 231 [2023-11-22 21:38:04,869 INFO L226 Difference]: Without dead ends: 112 [2023-11-22 21:38:04,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:38:04,877 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:04,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:38:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-22 21:38:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-22 21:38:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 100 states have internal predecessors, (107), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 21:38:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2023-11-22 21:38:04,922 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 30 [2023-11-22 21:38:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:04,922 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2023-11-22 21:38:04,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:38:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2023-11-22 21:38:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 21:38:04,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:04,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:04,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:38:04,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:04,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 208543916, now seen corresponding path program 1 times [2023-11-22 21:38:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:38:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425575933] [2023-11-22 21:38:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:38:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:38:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:38:05,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425575933] [2023-11-22 21:38:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425575933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:38:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817237270] [2023-11-22 21:38:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:38:05,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:38:05,516 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) [2023-11-22 21:38:05,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:38:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:05,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-22 21:38:05,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:38:05,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:38:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817237270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:38:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:38:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2023-11-22 21:38:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694067012] [2023-11-22 21:38:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:38:05,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:38:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:38:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:38:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:38:05,718 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:38:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:05,820 INFO L93 Difference]: Finished difference Result 234 states and 308 transitions. [2023-11-22 21:38:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:38:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2023-11-22 21:38:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:05,822 INFO L225 Difference]: With dead ends: 234 [2023-11-22 21:38:05,822 INFO L226 Difference]: Without dead ends: 124 [2023-11-22 21:38:05,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:38:05,824 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:05,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 492 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:38:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-22 21:38:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-22 21:38:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 107 states have internal predecessors, (115), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 21:38:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2023-11-22 21:38:05,835 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 31 [2023-11-22 21:38:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:05,835 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2023-11-22 21:38:05,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 21:38:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2023-11-22 21:38:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 21:38:05,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:05,837 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:05,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:38:06,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:38:06,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:06,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1337816308, now seen corresponding path program 1 times [2023-11-22 21:38:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:38:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015987844] [2023-11-22 21:38:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:38:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:38:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-22 21:38:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:38:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015987844] [2023-11-22 21:38:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015987844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:38:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31469141] [2023-11-22 21:38:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:08,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:38:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:38:08,229 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) [2023-11-22 21:38:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:38:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:08,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-22 21:38:08,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:08,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-22 21:38:08,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:09,365 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 30 treesize of output 26 [2023-11-22 21:38:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 65 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-22 21:38:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31469141] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:09,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:38:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2023-11-22 21:38:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748168598] [2023-11-22 21:38:09,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:09,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 21:38:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:38:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 21:38:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-22 21:38:09,435 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-22 21:38:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:10,023 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2023-11-22 21:38:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 21:38:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 91 [2023-11-22 21:38:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:10,024 INFO L225 Difference]: With dead ends: 253 [2023-11-22 21:38:10,024 INFO L226 Difference]: Without dead ends: 133 [2023-11-22 21:38:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2023-11-22 21:38:10,026 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 110 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:10,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 854 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 21:38:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-22 21:38:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2023-11-22 21:38:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 114 states have internal predecessors, (122), 27 states have call successors, (27), 9 states have call predecessors, (27), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-22 21:38:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2023-11-22 21:38:10,041 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 91 [2023-11-22 21:38:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:10,042 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2023-11-22 21:38:10,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-22 21:38:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2023-11-22 21:38:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 21:38:10,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:10,049 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:10,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 21:38:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 21:38:10,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:10,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -786406196, now seen corresponding path program 1 times [2023-11-22 21:38:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:38:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212862045] [2023-11-22 21:38:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:38:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:38:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-22 21:38:12,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:38:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212862045] [2023-11-22 21:38:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212862045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:38:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089242739] [2023-11-22 21:38:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:38:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:38:12,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:38:12,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 21:38:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:12,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-22 21:38:12,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:12,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:12,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 21:38:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-22 21:38:12,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:12,794 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 30 treesize of output 26 [2023-11-22 21:38:12,801 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 30 treesize of output 26 [2023-11-22 21:38:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-22 21:38:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089242739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:12,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:38:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 21 [2023-11-22 21:38:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556736360] [2023-11-22 21:38:12,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:12,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 21:38:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:38:12,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 21:38:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2023-11-22 21:38:12,882 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 21 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-22 21:38:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:14,001 INFO L93 Difference]: Finished difference Result 333 states and 416 transitions. [2023-11-22 21:38:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-22 21:38:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 91 [2023-11-22 21:38:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:14,005 INFO L225 Difference]: With dead ends: 333 [2023-11-22 21:38:14,005 INFO L226 Difference]: Without dead ends: 201 [2023-11-22 21:38:14,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1262, Unknown=0, NotChecked=0, Total=1406 [2023-11-22 21:38:14,009 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 162 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:14,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1461 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 21:38:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-22 21:38:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2023-11-22 21:38:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 127 states have (on average 1.2519685039370079) internal successors, (159), 144 states have internal predecessors, (159), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-22 21:38:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2023-11-22 21:38:14,035 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 91 [2023-11-22 21:38:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:14,035 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2023-11-22 21:38:14,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-22 21:38:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2023-11-22 21:38:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:38:14,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:14,036 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:14,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:38:14,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:38:14,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:14,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 67289600, now seen corresponding path program 1 times [2023-11-22 21:38:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:38:14,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448268141] [2023-11-22 21:38:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:38:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:16,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:38:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:38:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 21:38:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-22 21:38:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:38:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:38:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:38:37,918 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-22 21:38:37,922 INFO L158 Benchmark]: Toolchain (without parser) took 34926.18ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 96.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 163.9MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,923 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:38:37,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.08ms. Allocated memory is still 165.7MB. Free memory was 96.1MB in the beginning and 126.7MB in the end (delta: -30.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.87ms. Allocated memory is still 165.7MB. Free memory was 126.7MB in the beginning and 124.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,923 INFO L158 Benchmark]: Boogie Preprocessor took 69.97ms. Allocated memory is still 165.7MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,923 INFO L158 Benchmark]: RCFGBuilder took 613.19ms. Allocated memory is still 165.7MB. Free memory was 117.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,924 INFO L158 Benchmark]: TraceAbstraction took 33835.85ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 85.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2023-11-22 21:38:37,925 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.08ms. Allocated memory is still 165.7MB. Free memory was 96.1MB in the beginning and 126.7MB in the end (delta: -30.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.87ms. Allocated memory is still 165.7MB. Free memory was 126.7MB in the beginning and 124.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.97ms. Allocated memory is still 165.7MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 613.19ms. Allocated memory is still 165.7MB. Free memory was 117.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33835.85ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 85.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 21:38:37,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:38:39,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:38:39,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 21:38:39,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:38:39,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:38:40,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:38:40,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:38:40,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:38:40,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:38:40,011 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:38:40,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:38:40,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:38:40,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:38:40,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:38:40,013 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:38:40,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:38:40,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:38:40,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:38:40,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:38:40,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:38:40,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:38:40,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:38:40,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:38:40,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 21:38:40,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 21:38:40,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 21:38:40,017 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:38:40,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:38:40,018 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:38:40,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:38:40,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:38:40,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:38:40,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:38:40,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:38:40,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:38:40,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:38:40,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:38:40,021 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 21:38:40,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 21:38:40,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:38:40,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:38:40,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:38:40,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:38:40,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:38:40,023 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 21:38:40,023 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:38:40,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:38:40,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:38:40,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:38:40,276 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:38:40,277 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:38:40,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2023-11-22 21:38:41,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:38:41,458 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:38:41,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2023-11-22 21:38:41,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16ec5b5b/cc98df8026474cb6b908a1e13f707351/FLAG48dd5b4ba [2023-11-22 21:38:41,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16ec5b5b/cc98df8026474cb6b908a1e13f707351 [2023-11-22 21:38:41,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:38:41,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:38:41,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:38:41,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:38:41,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:38:41,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:41,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b538ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41, skipping insertion in model container [2023-11-22 21:38:41,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:41,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:38:41,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-11-22 21:38:41,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:38:41,851 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:38:41,885 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-11-22 21:38:41,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:38:41,926 WARN L675 CHandler]: The function insert_fnc is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:38:41,931 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:38:41,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41 WrapperNode [2023-11-22 21:38:41,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:38:41,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:38:41,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:38:41,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:38:41,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:41,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:41,998 INFO L138 Inliner]: procedures = 141, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 231 [2023-11-22 21:38:41,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:38:41,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:38:41,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:38:41,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:38:42,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,021 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,045 INFO L189 HeapSplitter]: Split 48 memory accesses to 3 slices as follows [2, 40, 6] [2023-11-22 21:38:42,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:38:42,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:38:42,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:38:42,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:38:42,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (1/1) ... [2023-11-22 21:38:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:38:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:38:42,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:38:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:38:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-22 21:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-22 21:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-11-22 21:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-11-22 21:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-11-22 21:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:38:42,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-22 21:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-11-22 21:38:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-11-22 21:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 21:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 21:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-22 21:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-11-22 21:38:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-11-22 21:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:38:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:38:42,333 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:38:42,335 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:38:42,761 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:38:42,800 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:38:42,802 INFO L309 CfgBuilder]: Removed 38 assume(true) statements. [2023-11-22 21:38:42,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:42 BoogieIcfgContainer [2023-11-22 21:38:42,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:38:42,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:38:42,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:38:42,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:38:42,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:38:41" (1/3) ... [2023-11-22 21:38:42,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae9102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:38:42, skipping insertion in model container [2023-11-22 21:38:42,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:41" (2/3) ... [2023-11-22 21:38:42,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ae9102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:38:42, skipping insertion in model container [2023-11-22 21:38:42,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:42" (3/3) ... [2023-11-22 21:38:42,810 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2023-11-22 21:38:42,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:38:42,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:38:42,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:38:42,857 INFO L357 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, mHoare=true, 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;@6ac3b9bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:38:42,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:38:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 85 states have (on average 1.8) internal successors, (153), 105 states have internal predecessors, (153), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-22 21:38:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 21:38:42,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:42,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:42,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:42,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1364741834, now seen corresponding path program 1 times [2023-11-22 21:38:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639021902] [2023-11-22 21:38:42,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:42,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:42,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:42,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 21:38:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:43,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 21:38:43,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:38:43,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:38:43,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:38:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639021902] [2023-11-22 21:38:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639021902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:38:43,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:38:43,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:38:43,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394776900] [2023-11-22 21:38:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:38:43,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:38:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:38:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:38:43,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:38:43,088 INFO L87 Difference]: Start difference. First operand has 117 states, 85 states have (on average 1.8) internal successors, (153), 105 states have internal predecessors, (153), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 21:38:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:43,195 INFO L93 Difference]: Finished difference Result 231 states and 409 transitions. [2023-11-22 21:38:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:38:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-22 21:38:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:43,203 INFO L225 Difference]: With dead ends: 231 [2023-11-22 21:38:43,203 INFO L226 Difference]: Without dead ends: 112 [2023-11-22 21:38:43,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:38:43,208 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:43,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:38:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-22 21:38:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-22 21:38:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 100 states have internal predecessors, (107), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 21:38:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2023-11-22 21:38:43,239 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 30 [2023-11-22 21:38:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:43,239 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2023-11-22 21:38:43,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 21:38:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2023-11-22 21:38:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 21:38:43,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:43,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:43,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 21:38:43,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:43,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:43,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash 208543916, now seen corresponding path program 1 times [2023-11-22 21:38:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:43,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138953542] [2023-11-22 21:38:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:43,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:43,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:43,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:43,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 21:38:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:43,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:38:43,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:38:43,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:38:43,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:38:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138953542] [2023-11-22 21:38:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138953542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:43,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:38:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-22 21:38:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98142493] [2023-11-22 21:38:43,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:43,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:38:43,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:38:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:38:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:38:43,941 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:38:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:44,253 INFO L93 Difference]: Finished difference Result 234 states and 308 transitions. [2023-11-22 21:38:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:38:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2023-11-22 21:38:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:44,255 INFO L225 Difference]: With dead ends: 234 [2023-11-22 21:38:44,256 INFO L226 Difference]: Without dead ends: 124 [2023-11-22 21:38:44,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:38:44,258 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 16 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:44,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 487 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 21:38:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-22 21:38:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-22 21:38:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 107 states have internal predecessors, (115), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 21:38:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2023-11-22 21:38:44,281 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 31 [2023-11-22 21:38:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:44,281 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2023-11-22 21:38:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:38:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2023-11-22 21:38:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 21:38:44,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:44,284 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:44,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-22 21:38:44,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:44,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:44,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1337816308, now seen corresponding path program 1 times [2023-11-22 21:38:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:44,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676113516] [2023-11-22 21:38:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:44,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:44,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 21:38:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:44,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-22 21:38:44,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:44,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-22 21:38:44,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:46,070 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 30 treesize of output 26 [2023-11-22 21:38:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 13 proven. 60 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-22 21:38:46,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:38:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676113516] [2023-11-22 21:38:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676113516] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:46,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:38:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2023-11-22 21:38:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835086878] [2023-11-22 21:38:46,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 21:38:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:38:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 21:38:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-22 21:38:46,113 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-22 21:38:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:47,384 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2023-11-22 21:38:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 21:38:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 91 [2023-11-22 21:38:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:47,386 INFO L225 Difference]: With dead ends: 253 [2023-11-22 21:38:47,386 INFO L226 Difference]: Without dead ends: 133 [2023-11-22 21:38:47,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-11-22 21:38:47,387 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 118 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:47,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 733 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 21:38:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-22 21:38:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2023-11-22 21:38:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 114 states have internal predecessors, (122), 27 states have call successors, (27), 9 states have call predecessors, (27), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-22 21:38:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2023-11-22 21:38:47,399 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 91 [2023-11-22 21:38:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:47,399 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2023-11-22 21:38:47,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-22 21:38:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2023-11-22 21:38:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 21:38:47,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:47,400 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:47,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-22 21:38:47,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:47,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:47,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash -786406196, now seen corresponding path program 1 times [2023-11-22 21:38:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115326685] [2023-11-22 21:38:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:47,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:47,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 21:38:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:47,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-22 21:38:47,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:47,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-22 21:38:48,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:48,968 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 30 treesize of output 26 [2023-11-22 21:38:48,978 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 30 treesize of output 26 [2023-11-22 21:38:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-22 21:38:49,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:38:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115326685] [2023-11-22 21:38:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115326685] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:49,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:38:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2023-11-22 21:38:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771742154] [2023-11-22 21:38:49,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:49,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 21:38:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:38:49,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 21:38:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-22 21:38:49,034 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 19 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-22 21:38:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:50,718 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2023-11-22 21:38:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 21:38:50,718 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 91 [2023-11-22 21:38:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:50,720 INFO L225 Difference]: With dead ends: 277 [2023-11-22 21:38:50,720 INFO L226 Difference]: Without dead ends: 145 [2023-11-22 21:38:50,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 21:38:50,721 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:50,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 839 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 21:38:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-22 21:38:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-11-22 21:38:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.25) internal successors, (130), 122 states have internal predecessors, (130), 29 states have call successors, (29), 11 states have call predecessors, (29), 10 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-22 21:38:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2023-11-22 21:38:50,735 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 91 [2023-11-22 21:38:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:50,737 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2023-11-22 21:38:50,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 15 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-22 21:38:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2023-11-22 21:38:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 21:38:50,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:50,739 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:50,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 21:38:50,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:50,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:50,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1034552690, now seen corresponding path program 1 times [2023-11-22 21:38:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114898377] [2023-11-22 21:38:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:50,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:50,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 21:38:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:51,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 21:38:51,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:51,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:51,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 21:38:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-22 21:38:51,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:38:51,925 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 30 treesize of output 26 [2023-11-22 21:38:51,934 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 30 treesize of output 26 [2023-11-22 21:38:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-22 21:38:52,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:38:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114898377] [2023-11-22 21:38:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114898377] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:38:52,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:38:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-11-22 21:38:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422052592] [2023-11-22 21:38:52,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:38:52,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 21:38:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:38:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 21:38:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:38:52,044 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-22 21:38:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:38:53,129 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2023-11-22 21:38:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 21:38:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 91 [2023-11-22 21:38:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:38:53,131 INFO L225 Difference]: With dead ends: 254 [2023-11-22 21:38:53,131 INFO L226 Difference]: Without dead ends: 201 [2023-11-22 21:38:53,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-22 21:38:53,132 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 82 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:38:53,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1462 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-22 21:38:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-22 21:38:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2023-11-22 21:38:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 127 states have (on average 1.2519685039370079) internal successors, (159), 144 states have internal predecessors, (159), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-22 21:38:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2023-11-22 21:38:53,143 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 91 [2023-11-22 21:38:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:38:53,143 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2023-11-22 21:38:53,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-22 21:38:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2023-11-22 21:38:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:38:53,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:38:53,144 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:38:53,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-22 21:38:53,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:53,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:38:53,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:38:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 67289600, now seen corresponding path program 1 times [2023-11-22 21:38:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:38:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633656232] [2023-11-22 21:38:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:38:53,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:38:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:38:53,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:38:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 21:38:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:38:54,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 140 conjunts are in the unsatisfiable core [2023-11-22 21:38:54,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:38:54,104 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 6 treesize of output 7 [2023-11-22 21:38:56,559 INFO L349 Elim1Store]: treesize reduction 159, result has 17.6 percent of original size [2023-11-22 21:38:56,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 49 treesize of output 60 [2023-11-22 21:38:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:38:57,105 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 27 treesize of output 17 [2023-11-22 21:38:57,752 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-22 21:38:57,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 23 [2023-11-22 21:38:57,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-22 21:38:57,903 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-22 21:38:57,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2023-11-22 21:38:57,911 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 15 treesize of output 11 [2023-11-22 21:38:58,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:39:01,496 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 125 treesize of output 81 [2023-11-22 21:39:01,627 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|dll_create_generic_~#dll~0.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((v_arrayElimCell_13 (_ BitVec 32)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#1.base| (store (store |c_old(#memory_$Pointer$#1.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#memory_$Pointer$#1.base| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) v_arrayElimCell_13 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_13))) (exists ((v_DerPreprocessor_4 (_ BitVec 1))) (let ((.cse0 (store (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_4) v_arrayElimCell_13 (_ bv1 1)))) (and (= (_ bv0 1) (select (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (select .cse0 |dll_create_generic_~#dll~0.base|)) v_arrayElimCell_13)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) (_ bv0 1))))))))) (exists ((|dll_create_generic_~#dll~0.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((v_arrayElimCell_13 (_ BitVec 32)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#1.base| (store (store |c_old(#memory_$Pointer$#1.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#memory_$Pointer$#1.base| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) v_arrayElimCell_13 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_13))) (exists ((v_DerPreprocessor_1 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_DerPreprocessor_1) v_arrayElimCell_13))) (= (select (store |c_old(#valid)| v_arrayElimCell_13 (_ bv1 1)) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) (_ bv0 1))))))) is different from true [2023-11-22 21:39:01,984 INFO L349 Elim1Store]: treesize reduction 105, result has 16.0 percent of original size [2023-11-22 21:39:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 157 [2023-11-22 21:39:02,145 INFO L349 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2023-11-22 21:39:02,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 11 [2023-11-22 21:39:09,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:39:10,837 INFO L349 Elim1Store]: treesize reduction 196, result has 34.0 percent of original size [2023-11-22 21:39:10,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1514 treesize of output 1507 [2023-11-22 21:39:12,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 201 [2023-11-22 21:39:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:39:20,896 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 245 treesize of output 213 [2023-11-22 21:39:26,692 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 407 DAG size of output: 398 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 21:39:26,692 INFO L349 Elim1Store]: treesize reduction 18, result has 97.7 percent of original size [2023-11-22 21:39:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 4 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 75 case distinctions, treesize of input 398 treesize of output 1146 [2023-11-22 21:40:05,600 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 44 treesize of output 28 [2023-11-22 21:40:05,605 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 32 treesize of output 20 [2023-11-22 21:40:08,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-22 21:40:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 44 proven. 52 refuted. 2 times theorem prover too weak. 8 trivial. 10 not checked. [2023-11-22 21:40:08,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:40:31,219 INFO L349 Elim1Store]: treesize reduction 56, result has 51.7 percent of original size [2023-11-22 21:40:31,219 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 4 case distinctions, treesize of input 46 treesize of output 81 [2023-11-22 21:40:31,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 21:40:31,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 21:40:31,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 21:40:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 96 [2023-11-22 21:40:31,382 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 26 [2023-11-22 21:40:32,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:40:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633656232] [2023-11-22 21:40:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633656232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146864112] [2023-11-22 21:40:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 21:40:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 21:40:32,678 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 21:40:32,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-11-22 21:40:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:34,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 176 conjunts are in the unsatisfiable core [2023-11-22 21:40:34,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:40:34,551 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 6 treesize of output 7 [2023-11-22 21:40:35,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-11-22 21:40:37,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:40:38,383 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_dll_create_generic_~#dll~0.offset| (_ bv0 32)) (exists ((|v_dll_insert_master_~item~1#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (bvult |v_dll_insert_master_~item~1#1.base_BEFORE_CALL_7| |c_#StackHeapBarrier|) (not (= (_ bv0 32) |v_dll_insert_master_~item~1#1.base_BEFORE_CALL_7|)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_dll_create_generic_~#dll~0.base|) (_ bv0 32)))) (let ((.cse0 (= .cse1 |c_dll_create_generic_~#dll~0.base|)) (.cse2 (select |c_#valid| .cse1))) (or (and .cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 .cse2)) (exists ((v_DerPreprocessor_10 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_10) .cse1)))) (let ((.cse3 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)))) (and (not .cse0) (= (_ bv0 1) (select .cse3 .cse1)) (= (store .cse3 .cse1 .cse2) |c_#valid|)))))) (bvult |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2023-11-22 21:40:38,409 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2023-11-22 21:40:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 130 [2023-11-22 21:40:38,417 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 86 treesize of output 54 [2023-11-22 21:40:38,482 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 39 treesize of output 35 [2023-11-22 21:40:41,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 49 [2023-11-22 21:40:54,498 INFO L349 Elim1Store]: treesize reduction 228, result has 30.1 percent of original size [2023-11-22 21:40:54,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 276 [2023-11-22 21:41:05,729 WARN L293 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 405 DAG size of output: 187 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 21:41:05,730 INFO L349 Elim1Store]: treesize reduction 1588, result has 23.6 percent of original size [2023-11-22 21:41:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 161 treesize of output 667 Killed by 15