/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 13:26:40,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 13:26:40,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 13:26:40,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 13:26:40,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 13:26:40,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 13:26:40,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 13:26:40,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 13:26:40,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 13:26:40,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 13:26:40,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 13:26:40,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 13:26:40,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 13:26:40,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 13:26:40,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 13:26:40,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 13:26:40,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 13:26:40,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 13:26:40,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 13:26:40,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 13:26:40,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 13:26:40,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 13:26:40,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 13:26:40,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 13:26:40,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 13:26:40,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 13:26:40,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 13:26:40,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 13:26:40,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 13:26:40,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 13:26:40,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 13:26:40,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 13:26:40,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 13:26:40,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 13:26:40,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 13:26:40,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 13:26:40,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 13:26:40,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 13:26:40,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 13:26:40,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 13:26:40,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 13:26:40,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 13:26:40,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 13:26:40,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 13:26:40,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 13:26:40,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 13:26:40,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 13:26:40,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 13:26:40,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 13:26:40,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 13:26:40,477 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 13:26:40,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 13:26:40,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 13:26:40,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 13:26:40,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 13:26:40,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 13:26:40,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 13:26:40,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:26:40,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 13:26:40,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 13:26:40,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 13:26:40,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 13:26:40,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 13:26:40,482 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 13:26:40,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 13:26:40,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-28 13:26:40,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 13:26:40,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 13:26:40,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 13:26:40,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 13:26:40,688 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 13:26:40,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-01-28 13:26:40,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100201f27/5f1b48ffbf3143198e09262a89c54218/FLAG9c8c4805e [2022-01-28 13:26:41,025 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 13:26:41,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-01-28 13:26:41,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100201f27/5f1b48ffbf3143198e09262a89c54218/FLAG9c8c4805e [2022-01-28 13:26:41,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100201f27/5f1b48ffbf3143198e09262a89c54218 [2022-01-28 13:26:41,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 13:26:41,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 13:26:41,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 13:26:41,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 13:26:41,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 13:26:41,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f7c8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41, skipping insertion in model container [2022-01-28 13:26:41,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 13:26:41,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 13:26:41,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c[2486,2499] [2022-01-28 13:26:41,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:26:41,650 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 13:26:41,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c[2486,2499] [2022-01-28 13:26:41,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:26:41,673 INFO L208 MainTranslator]: Completed translation [2022-01-28 13:26:41,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41 WrapperNode [2022-01-28 13:26:41,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 13:26:41,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 13:26:41,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 13:26:41,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 13:26:41,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,701 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2022-01-28 13:26:41,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 13:26:41,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 13:26:41,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 13:26:41,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 13:26:41,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 13:26:41,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 13:26:41,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 13:26:41,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 13:26:41,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (1/1) ... [2022-01-28 13:26:41,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:26:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:26:41,754 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) [2022-01-28 13:26:41,763 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 [2022-01-28 13:26:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 13:26:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-28 13:26:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-28 13:26:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-28 13:26:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-28 13:26:41,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 13:26:41,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 13:26:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 13:26:41,782 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 13:26:41,850 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 13:26:41,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 13:26:42,052 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 13:26:42,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 13:26:42,084 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-28 13:26:42,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:26:42 BoogieIcfgContainer [2022-01-28 13:26:42,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 13:26:42,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 13:26:42,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 13:26:42,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 13:26:42,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:26:41" (1/3) ... [2022-01-28 13:26:42,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407e281f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:26:42, skipping insertion in model container [2022-01-28 13:26:42,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:41" (2/3) ... [2022-01-28 13:26:42,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407e281f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:26:42, skipping insertion in model container [2022-01-28 13:26:42,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:26:42" (3/3) ... [2022-01-28 13:26:42,095 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2022-01-28 13:26:42,098 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 13:26:42,098 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 13:26:42,099 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-28 13:26:42,099 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 13:26:42,124 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,128 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,129 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,130 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,140 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,141 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,144 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,144 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,146 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:26:42,148 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-28 13:26:42,185 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 13:26:42,193 INFO L339 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 13:26:42,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-28 13:26:42,207 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 149 transitions, 322 flow [2022-01-28 13:26:42,301 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2041 states, 2040 states have (on average 3.394607843137255) internal successors, (6925), 2040 states have internal predecessors, (6925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 2041 states, 2040 states have (on average 3.394607843137255) internal successors, (6925), 2040 states have internal predecessors, (6925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 13:26:42,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:42,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:42,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 134934520, now seen corresponding path program 1 times [2022-01-28 13:26:42,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571404345] [2022-01-28 13:26:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:42,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:42,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:42,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571404345] [2022-01-28 13:26:42,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571404345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:26:42,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:26:42,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 13:26:42,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937758567] [2022-01-28 13:26:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:26:42,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-28 13:26:42,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:26:42,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-28 13:26:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:26:42,604 INFO L87 Difference]: Start difference. First operand has 2041 states, 2040 states have (on average 3.394607843137255) internal successors, (6925), 2040 states have internal predecessors, (6925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:26:42,688 INFO L93 Difference]: Finished difference Result 2041 states and 6506 transitions. [2022-01-28 13:26:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-28 13:26:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-28 13:26:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:26:42,716 INFO L225 Difference]: With dead ends: 2041 [2022-01-28 13:26:42,716 INFO L226 Difference]: Without dead ends: 2037 [2022-01-28 13:26:42,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:26:42,719 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:26:42,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:26:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-01-28 13:26:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2037. [2022-01-28 13:26:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 3.1935166994106092) internal successors, (6502), 2036 states have internal predecessors, (6502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 6502 transitions. [2022-01-28 13:26:42,829 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 6502 transitions. Word has length 107 [2022-01-28 13:26:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:26:42,829 INFO L470 AbstractCegarLoop]: Abstraction has 2037 states and 6502 transitions. [2022-01-28 13:26:42,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 6502 transitions. [2022-01-28 13:26:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 13:26:42,838 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:42,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:42,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 13:26:42,838 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1399132343, now seen corresponding path program 1 times [2022-01-28 13:26:42,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020897696] [2022-01-28 13:26:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:42,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:43,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020897696] [2022-01-28 13:26:43,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020897696] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:26:43,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:26:43,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:26:43,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385435024] [2022-01-28 13:26:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:26:43,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:26:43,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:26:43,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:26:43,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:26:43,018 INFO L87 Difference]: Start difference. First operand 2037 states and 6502 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:26:43,121 INFO L93 Difference]: Finished difference Result 2853 states and 9214 transitions. [2022-01-28 13:26:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 13:26:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-28 13:26:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:26:43,136 INFO L225 Difference]: With dead ends: 2853 [2022-01-28 13:26:43,137 INFO L226 Difference]: Without dead ends: 2853 [2022-01-28 13:26:43,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:26:43,139 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 165 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:26:43,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 279 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:26:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2022-01-28 13:26:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2241. [2022-01-28 13:26:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2240 states have (on average 3.205357142857143) internal successors, (7180), 2240 states have internal predecessors, (7180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 7180 transitions. [2022-01-28 13:26:43,222 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 7180 transitions. Word has length 107 [2022-01-28 13:26:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:26:43,224 INFO L470 AbstractCegarLoop]: Abstraction has 2241 states and 7180 transitions. [2022-01-28 13:26:43,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 7180 transitions. [2022-01-28 13:26:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-28 13:26:43,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:43,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:43,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 13:26:43,232 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -390044877, now seen corresponding path program 1 times [2022-01-28 13:26:43,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60520371] [2022-01-28 13:26:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:43,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:43,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:43,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60520371] [2022-01-28 13:26:43,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60520371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:26:43,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:26:43,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 13:26:43,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537115716] [2022-01-28 13:26:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:26:43,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:26:43,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:26:43,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:26:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:26:43,355 INFO L87 Difference]: Start difference. First operand 2241 states and 7180 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:26:43,467 INFO L93 Difference]: Finished difference Result 2676 states and 8360 transitions. [2022-01-28 13:26:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-28 13:26:43,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-01-28 13:26:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:26:43,479 INFO L225 Difference]: With dead ends: 2676 [2022-01-28 13:26:43,479 INFO L226 Difference]: Without dead ends: 2247 [2022-01-28 13:26:43,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-28 13:26:43,484 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 354 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:26:43,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 455 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:26:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-01-28 13:26:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2242. [2022-01-28 13:26:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 3.2043730477465417) internal successors, (7181), 2241 states have internal predecessors, (7181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 7181 transitions. [2022-01-28 13:26:43,545 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 7181 transitions. Word has length 112 [2022-01-28 13:26:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:26:43,546 INFO L470 AbstractCegarLoop]: Abstraction has 2242 states and 7181 transitions. [2022-01-28 13:26:43,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 7181 transitions. [2022-01-28 13:26:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-28 13:26:43,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:43,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:43,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 13:26:43,559 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash 708673487, now seen corresponding path program 1 times [2022-01-28 13:26:43,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:43,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111602041] [2022-01-28 13:26:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:43,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:43,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:43,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111602041] [2022-01-28 13:26:43,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111602041] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:26:43,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915782446] [2022-01-28 13:26:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:43,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:26:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:26:43,685 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) [2022-01-28 13:26:43,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-28 13:26:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:43,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-28 13:26:43,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:26:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:44,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:26:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:44,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915782446] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-28 13:26:44,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-28 13:26:44,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-28 13:26:44,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511375121] [2022-01-28 13:26:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:26:44,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:26:44,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:26:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:26:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-28 13:26:44,389 INFO L87 Difference]: Start difference. First operand 2242 states and 7181 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:26:44,472 INFO L93 Difference]: Finished difference Result 2474 states and 7954 transitions. [2022-01-28 13:26:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:26:44,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-28 13:26:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:26:44,487 INFO L225 Difference]: With dead ends: 2474 [2022-01-28 13:26:44,487 INFO L226 Difference]: Without dead ends: 2474 [2022-01-28 13:26:44,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-28 13:26:44,493 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 288 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:26:44,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 319 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:26:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2022-01-28 13:26:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2022-01-28 13:26:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 3.2163364334816014) internal successors, (7954), 2473 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 7954 transitions. [2022-01-28 13:26:44,564 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 7954 transitions. Word has length 119 [2022-01-28 13:26:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:26:44,564 INFO L470 AbstractCegarLoop]: Abstraction has 2474 states and 7954 transitions. [2022-01-28 13:26:44,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 7954 transitions. [2022-01-28 13:26:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-28 13:26:44,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:44,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:44,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-28 13:26:44,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:26:44,783 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -127685361, now seen corresponding path program 1 times [2022-01-28 13:26:44,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:44,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510380708] [2022-01-28 13:26:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:44,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:26:44,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:44,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510380708] [2022-01-28 13:26:44,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510380708] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:26:44,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695855529] [2022-01-28 13:26:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:44,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:26:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:26:44,971 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) [2022-01-28 13:26:44,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-28 13:26:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:45,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-28 13:26:45,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:26:45,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-28 13:26:45,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:26:45,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-28 13:26:45,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:26:45,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-28 13:26:45,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-28 13:26:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:26:45,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:26:46,038 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~min~0 c_~max~0) (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse0) (<= .cse0 c_~max~0))))) is different from false [2022-01-28 13:26:46,697 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~min~0 |c_ULTIMATE.start_main_#t~mem10#1|) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109))) (or (<= c_~min~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)) (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min~0))))) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse1) (<= .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)) (<= .cse1 |c_ULTIMATE.start_main_#t~mem10#1|)))))) is different from false [2022-01-28 13:26:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:26:46,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695855529] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:26:46,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:26:46,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22, 15] total 37 [2022-01-28 13:26:46,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094911933] [2022-01-28 13:26:46,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:26:46,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-28 13:26:46,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:26:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-28 13:26:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1021, Unknown=17, NotChecked=134, Total=1332 [2022-01-28 13:26:46,979 INFO L87 Difference]: Start difference. First operand 2474 states and 7954 transitions. Second operand has 37 states, 37 states have (on average 6.8108108108108105) internal successors, (252), 37 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:48,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse9 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse8 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (.cse6 (select .cse9 c_~A~0.offset)) (.cse5 (select .cse9 (+ (* c_thread2Thread1of1ForFork2_~i~1 4) c_~A~0.offset))) (.cse1 (<= c_~min~0 c_~max~0))) (and (or (< .cse0 c_~min~0) (and (or .cse1 .cse2) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)))))) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= c_~min~0 .cse5) (<= .cse5 c_~max~0)) (or .cse1 .cse2 (< .cse6 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse7 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse7)))) (or (<= .cse0 c_~max~0) .cse2))) (< .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 (<= c_~min~0 .cse6) (<= .cse6 c_~max~0)) (or (< c_~max~0 .cse5) .cse1)))) is different from false [2022-01-28 13:26:50,334 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (<= c_~min~0 c_~max~0)) (.cse0 (select .cse8 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse7 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (.cse5 (select .cse8 c_~A~0.offset))) (and (or (< .cse0 c_~min~0) (and (or .cse1 .cse2) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)))))) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse1 .cse2 (< .cse5 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse6 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse6)))) (or (<= .cse0 c_~max~0) .cse2))) (< .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 (<= c_~min~0 .cse5) (<= .cse5 c_~max~0))))) is different from false [2022-01-28 13:26:50,339 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse12 c_~A~0.offset))) (let ((.cse0 (select .cse12 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse10 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (<= c_~min~0 c_~max~0)) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (.cse7 (<= c_~min~0 .cse6)) (.cse8 (<= .cse6 c_~max~0))) (and (or (< .cse0 c_~min~0) (and (or .cse1 .cse2) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)))))) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse5) (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (<= .cse5 c_~max~0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (< c_~max~0 .cse6) .cse1) (or .cse7 .cse8) (or .cse1 .cse2 (< .cse6 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse9 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse9)))) (or (<= .cse0 c_~max~0) .cse2))) (< .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse1 (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) c_~min~0) (< c_~max~0 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 .cse7 .cse8))))) is different from false [2022-01-28 13:26:50,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse12 c_~A~0.offset))) (let ((.cse0 (select .cse12 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse10 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (<= c_~min~0 c_~max~0)) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (.cse7 (<= c_~min~0 .cse6)) (.cse8 (<= .cse6 c_~max~0))) (and (or (< .cse0 c_~min~0) (and (or .cse1 .cse2) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)))))) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse5) (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (<= .cse5 c_~max~0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (< c_~max~0 .cse6) .cse1) (= c_~v_assert~0 1) (or .cse7 .cse8) (or .cse1 .cse2 (< .cse6 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse9 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse9)))) (or (<= .cse0 c_~max~0) .cse2))) (< .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse1 (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_109))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) c_~min~0) (< c_~max~0 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 .cse7 .cse8))))) is different from false [2022-01-28 13:26:50,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (<= c_~min~0 c_~max~0)) (.cse0 (select .cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset)))) (.cse4 (select .cse6 c_~A~0.offset))) (and (or (< .cse0 c_~min~0) (and (or .cse1 .cse2) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)))))) (or .cse1 .cse2 (< .cse4 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse5 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse5)))) (or (<= .cse0 c_~max~0) .cse2))) (or .cse2 (<= c_~min~0 .cse4) (<= .cse4 c_~max~0))))) is different from false [2022-01-28 13:26:50,924 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base)) (.cse4 (<= c_~min~0 c_~max~0)) (.cse5 (forall ((v_ArrVal_110 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))))) (let ((.cse1 (or .cse4 .cse5)) (.cse0 (select .cse8 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (.cse2 (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 .cse9) (<= .cse9 c_~max~0))))) (.cse6 (select .cse8 c_~A~0.offset)) (.cse3 (select .cse8 (+ (* c_thread2Thread1of1ForFork2_~i~1 4) c_~A~0.offset)))) (and (or (< .cse0 c_~min~0) (and .cse1 .cse2)) .cse1 (or (<= c_~min~0 .cse3) (<= .cse3 c_~max~0)) (or .cse4 .cse5 (< .cse6 c_~min~0)) (or (<= c_~min~0 .cse0) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_110) c_~A~0.base) c_~A~0.offset))) (or (<= .cse7 c_~max~0) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) .cse7)))) (or (<= .cse0 c_~max~0) .cse5))) .cse2 (or .cse5 (<= c_~min~0 .cse6) (<= .cse6 c_~max~0)) (or (< c_~max~0 .cse3) .cse4)))) is different from false [2022-01-28 13:26:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:26:52,007 INFO L93 Difference]: Finished difference Result 16053 states and 52581 transitions. [2022-01-28 13:26:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-28 13:26:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.8108108108108105) internal successors, (252), 37 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-01-28 13:26:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:26:52,076 INFO L225 Difference]: With dead ends: 16053 [2022-01-28 13:26:52,077 INFO L226 Difference]: Without dead ends: 12655 [2022-01-28 13:26:52,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1371, Invalid=5971, Unknown=172, NotChecked=1416, Total=8930 [2022-01-28 13:26:52,080 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 2721 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2136 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:26:52,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2721 Valid, 3414 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 981 Invalid, 0 Unknown, 2136 Unchecked, 0.5s Time] [2022-01-28 13:26:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2022-01-28 13:26:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 3883. [2022-01-28 13:26:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3882 states have (on average 3.3142709943328184) internal successors, (12866), 3882 states have internal predecessors, (12866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 12866 transitions. [2022-01-28 13:26:52,295 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 12866 transitions. Word has length 124 [2022-01-28 13:26:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:26:52,296 INFO L470 AbstractCegarLoop]: Abstraction has 3883 states and 12866 transitions. [2022-01-28 13:26:52,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.8108108108108105) internal successors, (252), 37 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:26:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 12866 transitions. [2022-01-28 13:26:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-28 13:26:52,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:26:52,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:26:52,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-28 13:26:52,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:26:52,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:26:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:26:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 101190671, now seen corresponding path program 2 times [2022-01-28 13:26:52,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:26:52,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694073434] [2022-01-28 13:26:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:26:52,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:26:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:26:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:26:52,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:26:52,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694073434] [2022-01-28 13:26:52,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694073434] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:26:52,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674150555] [2022-01-28 13:26:52,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:26:52,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:26:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:26:52,667 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) [2022-01-28 13:26:52,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-28 13:26:52,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:26:52,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:26:52,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-28 13:26:52,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:26:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:26:53,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-28 13:26:53,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:26:53,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-28 13:26:53,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:26:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-28 13:26:53,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-28 13:26:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:26:53,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:26:56,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2424 treesize of output 1952 [2022-01-28 13:26:56,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1835 treesize of output 1707 [2022-01-28 13:26:56,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1792 treesize of output 1720 [2022-01-28 13:26:56,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1720 treesize of output 1684 [2022-01-28 13:30:14,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19146 treesize of output 17370 [2022-01-28 13:30:14,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16922 treesize of output 16242 [2022-01-28 13:30:14,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16242 treesize of output 15138 [2022-01-28 13:30:14,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15060 treesize of output 14996 [2022-01-28 13:30:14,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14996 treesize of output 13908 Received shutdown request... [2022-01-28 13:40:04,602 WARN L243 SmtUtils]: Removed 1 from assertion stack [2022-01-28 13:40:04,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-28 13:40:04,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-28 13:40:04,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-28 13:40:04,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-28 13:40:04,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:04,804 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 125 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-01-28 13:40:04,806 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-28 13:40:04,806 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-28 13:40:04,806 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-28 13:40:04,809 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-01-28 13:40:04,810 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 13:40:04,811 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 13:40:04,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 01:40:04 BasicIcfg [2022-01-28 13:40:04,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 13:40:04,816 INFO L158 Benchmark]: Toolchain (without parser) took 803363.90ms. Allocated memory was 189.8MB in the beginning and 660.6MB in the end (delta: 470.8MB). Free memory was 134.2MB in the beginning and 527.2MB in the end (delta: -393.0MB). Peak memory consumption was 403.1MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,817 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 13:40:04,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.51ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 134.0MB in the beginning and 230.5MB in the end (delta: -96.6MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 259.0MB. Free memory was 230.5MB in the beginning and 228.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,818 INFO L158 Benchmark]: Boogie Preprocessor took 18.88ms. Allocated memory is still 259.0MB. Free memory was 228.4MB in the beginning and 227.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,818 INFO L158 Benchmark]: RCFGBuilder took 364.53ms. Allocated memory is still 259.0MB. Free memory was 226.9MB in the beginning and 209.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,819 INFO L158 Benchmark]: TraceAbstraction took 802729.07ms. Allocated memory was 259.0MB in the beginning and 660.6MB in the end (delta: 401.6MB). Free memory was 209.0MB in the beginning and 527.2MB in the end (delta: -318.2MB). Peak memory consumption was 408.7MB. Max. memory is 8.0GB. [2022-01-28 13:40:04,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.51ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 134.0MB in the beginning and 230.5MB in the end (delta: -96.6MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 259.0MB. Free memory was 230.5MB in the beginning and 228.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.88ms. Allocated memory is still 259.0MB. Free memory was 228.4MB in the beginning and 227.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 364.53ms. Allocated memory is still 259.0MB. Free memory was 226.9MB in the beginning and 209.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 802729.07ms. Allocated memory was 259.0MB in the beginning and 660.6MB in the end (delta: 401.6MB). Free memory was 209.0MB in the beginning and 527.2MB in the end (delta: -318.2MB). Peak memory consumption was 408.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 125 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 125 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 125 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 125 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 802.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3528 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3528 mSDsluCounter, 4587 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2136 IncrementalHoareTripleChecker+Unchecked, 4257 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1214 IncrementalHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 649 mSDtfsCounter, 1214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 474 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3883occurred in iteration=5, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 9389 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1046 ConstructedInterpolants, 18 QuantifiedInterpolants, 4118 SizeOfPredicates, 32 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 9/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown