/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:19:09,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:19:09,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:19:09,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:19:09,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:19:09,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:19:09,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:19:09,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:19:09,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:19:09,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:19:09,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:19:09,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:19:09,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:19:09,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:19:09,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:19:09,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:19:09,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:19:09,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:19:09,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:19:09,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:19:09,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:19:09,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:19:09,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:19:09,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:19:09,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:19:09,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:19:09,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:19:09,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:19:09,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:19:09,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:19:09,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:19:09,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:19:09,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:19:09,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:19:09,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:19:09,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:19:09,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:19:09,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:19:09,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:19:09,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:19:09,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:19:09,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:19:09,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:19:09,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:19:09,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:19:09,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:19:09,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:19:09,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:19:09,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:19:09,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:09,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:19:09,526 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:19:09,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:19:09,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:19:09,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:19:09,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:19:09,708 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:19:09,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2022-03-15 19:19:09,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044f551a8/b9b3ff6e834e49798a602b752550ff92/FLAG2c9582f2a [2022-03-15 19:19:10,094 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:19:10,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2022-03-15 19:19:10,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044f551a8/b9b3ff6e834e49798a602b752550ff92/FLAG2c9582f2a [2022-03-15 19:19:10,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044f551a8/b9b3ff6e834e49798a602b752550ff92 [2022-03-15 19:19:10,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:19:10,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:19:10,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:10,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:19:10,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:19:10,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2142bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10, skipping insertion in model container [2022-03-15 19:19:10,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:19:10,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:19:10,344 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-min-max-inc-dec.wvr.c[3271,3284] [2022-03-15 19:19:10,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:10,357 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:19:10,387 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-min-max-inc-dec.wvr.c[3271,3284] [2022-03-15 19:19:10,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:10,400 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:19:10,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10 WrapperNode [2022-03-15 19:19:10,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:10,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:10,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:19:10,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:19:10,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,448 INFO L137 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2022-03-15 19:19:10,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:10,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:19:10,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:19:10,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:19:10,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:19:10,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:19:10,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:19:10,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:19:10,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (1/1) ... [2022-03-15 19:19:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:10,519 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-03-15 19:19:10,539 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-03-15 19:19:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:19:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:19:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:19:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:19:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:19:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:19:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:19:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:19:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:19:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:19:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:19:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:19:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:19:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-03-15 19:19:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-03-15 19:19:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:19:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:19:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:19:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:19:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:19:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:19:10,554 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:19:10,635 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:19:10,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:19:10,939 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:19:10,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:19:10,991 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-15 19:19:10,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:10 BoogieIcfgContainer [2022-03-15 19:19:10,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:19:10,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:19:10,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:19:10,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:19:10,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:19:10" (1/3) ... [2022-03-15 19:19:10,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e419a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:10, skipping insertion in model container [2022-03-15 19:19:10,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:10" (2/3) ... [2022-03-15 19:19:10,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e419a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:10, skipping insertion in model container [2022-03-15 19:19:10,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:10" (3/3) ... [2022-03-15 19:19:10,999 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2022-03-15 19:19:11,002 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:19:11,003 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:19:11,003 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:19:11,003 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:19:11,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,057 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,063 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,067 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,068 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,069 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,070 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,071 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,071 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,071 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,071 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,072 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,072 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,072 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,074 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,074 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,079 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,079 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,080 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork4_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:11,093 INFO L148 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-03-15 19:19:11,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:19:11,126 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:19:11,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 19:19:11,136 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:19:11,142 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 195 transitions, 430 flow [2022-03-15 19:19:11,147 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 195 transitions, 430 flow [2022-03-15 19:19:11,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 195 transitions, 430 flow [2022-03-15 19:19:11,216 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2022-03-15 19:19:11,217 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-03-15 19:19:11,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 190 events. 14/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 134 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-03-15 19:19:11,225 INFO L116 LiptonReduction]: Number of co-enabled transitions 3806 [2022-03-15 19:19:17,491 INFO L131 LiptonReduction]: Checked pairs total: 5798 [2022-03-15 19:19:17,492 INFO L133 LiptonReduction]: Total number of compositions: 174 [2022-03-15 19:19:17,497 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 44 transitions, 128 flow [2022-03-15 19:19:17,583 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1201 states, 1200 states have (on average 4.693333333333333) internal successors, (5632), 1200 states have internal predecessors, (5632), 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-03-15 19:19:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 1201 states, 1200 states have (on average 4.693333333333333) internal successors, (5632), 1200 states have internal predecessors, (5632), 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-03-15 19:19:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:19:17,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:17,607 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] [2022-03-15 19:19:17,608 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1312979836, now seen corresponding path program 1 times [2022-03-15 19:19:17,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:17,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015521276] [2022-03-15 19:19:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:17,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:17,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015521276] [2022-03-15 19:19:17,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015521276] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:17,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:17,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:17,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880316944] [2022-03-15 19:19:17,856 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:17,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:18,145 INFO L252 McrAutomatonBuilder]: Finished intersection with 628 states and 2050 transitions. [2022-03-15 19:19:18,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:21,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2606#(< thread1Thread1of1ForFork2_~i~0 ~N~0)] [2022-03-15 19:19:21,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:21,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:21,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:21,406 INFO L87 Difference]: Start difference. First operand has 1201 states, 1200 states have (on average 4.693333333333333) internal successors, (5632), 1200 states have internal predecessors, (5632), 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 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:21,510 INFO L93 Difference]: Finished difference Result 1451 states and 6836 transitions. [2022-03-15 19:19:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:21,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:19:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:21,535 INFO L225 Difference]: With dead ends: 1451 [2022-03-15 19:19:21,535 INFO L226 Difference]: Without dead ends: 1451 [2022-03-15 19:19:21,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 586 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:21,539 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:21,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 6 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-03-15 19:19:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2022-03-15 19:19:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 4.714482758620689) internal successors, (6836), 1450 states have internal predecessors, (6836), 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-03-15 19:19:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 6836 transitions. [2022-03-15 19:19:21,635 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 6836 transitions. Word has length 33 [2022-03-15 19:19:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:21,636 INFO L470 AbstractCegarLoop]: Abstraction has 1451 states and 6836 transitions. [2022-03-15 19:19:21,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 6836 transitions. [2022-03-15 19:19:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:19:21,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:21,641 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] [2022-03-15 19:19:21,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:19:21,642 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2041072773, now seen corresponding path program 1 times [2022-03-15 19:19:21,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:21,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635716605] [2022-03-15 19:19:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:21,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:21,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635716605] [2022-03-15 19:19:21,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635716605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:21,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:21,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:21,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668268031] [2022-03-15 19:19:21,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:21,751 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:21,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 494 states and 1562 transitions. [2022-03-15 19:19:21,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:24,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6964#(< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)] [2022-03-15 19:19:24,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:24,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:24,466 INFO L87 Difference]: Start difference. First operand 1451 states and 6836 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03-15 19:19:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:24,575 INFO L93 Difference]: Finished difference Result 1911 states and 9054 transitions. [2022-03-15 19:19:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 34 [2022-03-15 19:19:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:24,588 INFO L225 Difference]: With dead ends: 1911 [2022-03-15 19:19:24,588 INFO L226 Difference]: Without dead ends: 1911 [2022-03-15 19:19:24,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 444 SyntacticMatches, 15 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:24,589 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:24,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-03-15 19:19:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2022-03-15 19:19:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 4.740314136125654) internal successors, (9054), 1910 states have internal predecessors, (9054), 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-03-15 19:19:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 9054 transitions. [2022-03-15 19:19:24,642 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 9054 transitions. Word has length 34 [2022-03-15 19:19:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:24,644 INFO L470 AbstractCegarLoop]: Abstraction has 1911 states and 9054 transitions. [2022-03-15 19:19:24,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03-15 19:19:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 9054 transitions. [2022-03-15 19:19:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:19:24,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:24,650 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] [2022-03-15 19:19:24,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:19:24,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1364459107, now seen corresponding path program 1 times [2022-03-15 19:19:24,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:24,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093449989] [2022-03-15 19:19:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:19:24,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:24,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093449989] [2022-03-15 19:19:24,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093449989] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:24,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:24,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:24,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1681735413] [2022-03-15 19:19:24,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:24,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:24,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 354 states and 1039 transitions. [2022-03-15 19:19:24,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:26,532 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12702#(< thread2Thread1of1ForFork4_~i~1 ~N~0)] [2022-03-15 19:19:26,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:26,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:26,533 INFO L87 Difference]: Start difference. First operand 1911 states and 9054 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-03-15 19:19:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:26,647 INFO L93 Difference]: Finished difference Result 2369 states and 11260 transitions. [2022-03-15 19:19:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 35 [2022-03-15 19:19:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:26,661 INFO L225 Difference]: With dead ends: 2369 [2022-03-15 19:19:26,661 INFO L226 Difference]: Without dead ends: 2369 [2022-03-15 19:19:26,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 311 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:26,664 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:26,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 8 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-15 19:19:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-15 19:19:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2368 states have (on average 4.7550675675675675) internal successors, (11260), 2368 states have internal predecessors, (11260), 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-03-15 19:19:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 11260 transitions. [2022-03-15 19:19:26,736 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 11260 transitions. Word has length 35 [2022-03-15 19:19:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:26,737 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 11260 transitions. [2022-03-15 19:19:26,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-03-15 19:19:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 11260 transitions. [2022-03-15 19:19:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:19:26,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:26,744 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] [2022-03-15 19:19:26,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:19:26,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 395800374, now seen corresponding path program 1 times [2022-03-15 19:19:26,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:26,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697722511] [2022-03-15 19:19:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:26,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:26,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697722511] [2022-03-15 19:19:26,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697722511] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:26,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:26,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:26,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724999758] [2022-03-15 19:19:26,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:26,824 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:26,898 INFO L252 McrAutomatonBuilder]: Finished intersection with 246 states and 642 transitions. [2022-03-15 19:19:26,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:28,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19814#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0)] [2022-03-15 19:19:28,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:28,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:28,162 INFO L87 Difference]: Start difference. First operand 2369 states and 11260 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-03-15 19:19:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:28,273 INFO L93 Difference]: Finished difference Result 3069 states and 14686 transitions. [2022-03-15 19:19:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 36 [2022-03-15 19:19:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:28,361 INFO L225 Difference]: With dead ends: 3069 [2022-03-15 19:19:28,362 INFO L226 Difference]: Without dead ends: 3069 [2022-03-15 19:19:28,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 10 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:28,367 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:28,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 5 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-03-15 19:19:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 3069. [2022-03-15 19:19:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3068 states have (on average 4.786831812255541) internal successors, (14686), 3068 states have internal predecessors, (14686), 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-03-15 19:19:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 14686 transitions. [2022-03-15 19:19:28,464 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 14686 transitions. Word has length 36 [2022-03-15 19:19:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:28,465 INFO L470 AbstractCegarLoop]: Abstraction has 3069 states and 14686 transitions. [2022-03-15 19:19:28,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-03-15 19:19:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 14686 transitions. [2022-03-15 19:19:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:19:28,473 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:28,473 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] [2022-03-15 19:19:28,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:19:28,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash 536485756, now seen corresponding path program 1 times [2022-03-15 19:19:28,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:28,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036379700] [2022-03-15 19:19:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:19:28,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:28,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036379700] [2022-03-15 19:19:28,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036379700] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:28,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:28,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:19:28,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468387645] [2022-03-15 19:19:28,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:28,534 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:28,592 INFO L252 McrAutomatonBuilder]: Finished intersection with 190 states and 458 transitions. [2022-03-15 19:19:28,592 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:29,274 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:19:29,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:19:29,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:19:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:19:29,275 INFO L87 Difference]: Start difference. First operand 3069 states and 14686 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03-15 19:19:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:29,341 INFO L93 Difference]: Finished difference Result 3070 states and 14687 transitions. [2022-03-15 19:19:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:19:29,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-03-15 19:19:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:29,359 INFO L225 Difference]: With dead ends: 3070 [2022-03-15 19:19:29,359 INFO L226 Difference]: Without dead ends: 3070 [2022-03-15 19:19:29,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:19:29,360 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:29,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:19:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2022-03-15 19:19:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 3070. [2022-03-15 19:19:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 3069 states have (on average 4.785597914630173) internal successors, (14687), 3069 states have internal predecessors, (14687), 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-03-15 19:19:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 14687 transitions. [2022-03-15 19:19:29,432 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 14687 transitions. Word has length 37 [2022-03-15 19:19:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:29,432 INFO L470 AbstractCegarLoop]: Abstraction has 3070 states and 14687 transitions. [2022-03-15 19:19:29,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03-15 19:19:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 14687 transitions. [2022-03-15 19:19:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:19:29,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:29,440 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] [2022-03-15 19:19:29,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:19:29,440 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:19:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 323154240, now seen corresponding path program 1 times [2022-03-15 19:19:29,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:29,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967844551] [2022-03-15 19:19:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:19:29,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:29,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967844551] [2022-03-15 19:19:29,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967844551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:29,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016737514] [2022-03-15 19:19:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:29,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:29,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:29,626 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-03-15 19:19:29,639 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-03-15 19:19:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:29,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:19:29,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:29,830 INFO L387 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-03-15 19:19:29,852 INFO L387 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 6 treesize of output 5 [2022-03-15 19:19:29,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:29,967 INFO L387 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 14 treesize of output 16 [2022-03-15 19:19:30,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:30,003 INFO L387 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 14 treesize of output 16 [2022-03-15 19:19:30,029 INFO L387 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-03-15 19:19:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:30,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:30,281 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:30,303 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:30,372 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse3 (+ .cse0 1)) (.cse1 (< c_~min~0 .cse2))) (and (or .cse1 (<= .cse2 .cse3)) (or (<= c_~min~0 .cse3) (not .cse1)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:30,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse3 1)) (.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (<= .cse1 .cse2)) (or (<= c_~min~0 .cse2) (not .cse0))))) (<= 2147483647 .cse3)))) is different from false [2022-03-15 19:19:30,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2022-03-15 19:19:30,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_282))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)))))) is different from false [2022-03-15 19:19:30,442 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:19:30,442 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-03-15 19:19:30,448 INFO L387 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 3355 treesize of output 3067 [2022-03-15 19:19:30,558 INFO L387 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 2407 treesize of output 2235 [2022-03-15 19:19:30,575 INFO L387 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 1809 treesize of output 1713 [2022-03-15 19:19:30,592 INFO L387 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 2139 treesize of output 2055 [2022-03-15 19:29:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-03-15 19:29:17,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016737514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:29:17,397 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:29:17,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 26 [2022-03-15 19:29:17,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443746738] [2022-03-15 19:29:17,397 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:17,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:17,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 459 transitions. [2022-03-15 19:29:17,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:19,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [38485#(or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)))] [2022-03-15 19:29:19,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:29:19,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:29:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=418, Unknown=6, NotChecked=282, Total=812 [2022-03-15 19:29:19,277 INFO L87 Difference]: Start difference. First operand 3070 states and 14687 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-03-15 19:29:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:19,847 INFO L93 Difference]: Finished difference Result 13100 states and 61723 transitions. [2022-03-15 19:29:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:29:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 38 [2022-03-15 19:29:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:19,875 INFO L225 Difference]: With dead ends: 13100 [2022-03-15 19:29:19,875 INFO L226 Difference]: Without dead ends: 7120 [2022-03-15 19:29:19,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=954, Unknown=6, NotChecked=426, Total=1640 [2022-03-15 19:29:19,876 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 253 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:19,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 39 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:29:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7120 states. [2022-03-15 19:29:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7120 to 3342. [2022-03-15 19:29:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3341 states have (on average 4.714456749476205) internal successors, (15751), 3341 states have internal predecessors, (15751), 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-03-15 19:29:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 15751 transitions. [2022-03-15 19:29:20,045 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 15751 transitions. Word has length 38 [2022-03-15 19:29:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:20,046 INFO L470 AbstractCegarLoop]: Abstraction has 3342 states and 15751 transitions. [2022-03-15 19:29:20,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-03-15 19:29:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 15751 transitions. [2022-03-15 19:29:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:20,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:20,055 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] [2022-03-15 19:29:20,072 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-03-15 19:29:20,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:29:20,272 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2104708142, now seen corresponding path program 2 times [2022-03-15 19:29:20,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:20,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833841742] [2022-03-15 19:29:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:29:20,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:20,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833841742] [2022-03-15 19:29:20,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833841742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:29:20,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:29:20,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:29:20,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622248305] [2022-03-15 19:29:20,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:20,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:20,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 285 transitions. [2022-03-15 19:29:20,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:21,343 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [58298#(= (mod ~b2~0 256) 0)] [2022-03-15 19:29:21,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:29:21,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:29:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:29:21,344 INFO L87 Difference]: Start difference. First operand 3342 states and 15751 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-03-15 19:29:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:21,454 INFO L93 Difference]: Finished difference Result 3961 states and 18410 transitions. [2022-03-15 19:29:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:29:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 38 [2022-03-15 19:29:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:21,464 INFO L225 Difference]: With dead ends: 3961 [2022-03-15 19:29:21,464 INFO L226 Difference]: Without dead ends: 2934 [2022-03-15 19:29:21,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:29:21,465 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:21,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:29:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2022-03-15 19:29:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2878. [2022-03-15 19:29:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 4.6141814389989575) internal successors, (13275), 2877 states have internal predecessors, (13275), 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-03-15 19:29:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 13275 transitions. [2022-03-15 19:29:21,528 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 13275 transitions. Word has length 38 [2022-03-15 19:29:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:21,528 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 13275 transitions. [2022-03-15 19:29:21,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-03-15 19:29:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 13275 transitions. [2022-03-15 19:29:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:21,535 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:21,535 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] [2022-03-15 19:29:21,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:29:21,535 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash 975555202, now seen corresponding path program 3 times [2022-03-15 19:29:21,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:21,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777034330] [2022-03-15 19:29:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:29:21,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:21,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777034330] [2022-03-15 19:29:21,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777034330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:29:21,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160539184] [2022-03-15 19:29:21,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:29:21,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:21,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:29:21,831 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-03-15 19:29:21,831 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-03-15 19:29:21,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:29:21,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:29:21,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:29:21,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:29:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:22,165 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:22,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:22,206 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:22,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:22,251 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:22,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:22,281 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:22,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 19:29:22,371 INFO L387 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 17 treesize of output 9 [2022-03-15 19:29:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:29:22,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:29:22,677 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (<= c_~min~0 .cse0))))) is different from false [2022-03-15 19:29:22,692 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (<= c_~min~0 .cse0))))) is different from false [2022-03-15 19:29:22,720 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (<= c_~min~0 .cse0)))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:29:22,746 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_416 (Array Int Int)) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (<= c_~min~0 .cse0)))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:29:22,817 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_416 (Array Int Int)) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2))) (and (or (not .cse1) (<= c_~min~0 .cse0)) (or .cse1 (<= .cse2 .cse0))))))))) is different from false [2022-03-15 19:29:22,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_416 (Array Int Int)) (v_ArrVal_415 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_417) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483648 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< c_~min~0 .cse2))) (and (or (<= c_~min~0 .cse0) (not .cse1)) (or .cse1 (<= .cse2 .cse0)))))))) is different from false [2022-03-15 19:29:22,851 INFO L387 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 515 treesize of output 451 [2022-03-15 19:29:22,856 INFO L387 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 447 treesize of output 415 [2022-03-15 19:29:22,859 INFO L387 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 415 treesize of output 399 [2022-03-15 19:29:22,864 INFO L387 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 205 treesize of output 201 [2022-03-15 19:29:22,867 INFO L387 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 395 treesize of output 387 [2022-03-15 19:29:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:29:23,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160539184] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:29:23,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:29:23,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 39 [2022-03-15 19:29:23,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130079146] [2022-03-15 19:29:23,553 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:23,559 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:23,592 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 221 transitions. [2022-03-15 19:29:23,592 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:25,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [68281#(and (or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1))) (= ~A~0.offset 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))] [2022-03-15 19:29:25,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:29:25,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:29:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1062, Unknown=6, NotChecked=438, Total=1722 [2022-03-15 19:29:25,020 INFO L87 Difference]: Start difference. First operand 2878 states and 13275 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:29:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:26,621 INFO L93 Difference]: Finished difference Result 13060 states and 61227 transitions. [2022-03-15 19:29:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:29:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 19:29:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:26,647 INFO L225 Difference]: With dead ends: 13060 [2022-03-15 19:29:26,648 INFO L226 Difference]: Without dead ends: 7512 [2022-03-15 19:29:26,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=763, Invalid=2795, Unknown=6, NotChecked=726, Total=4290 [2022-03-15 19:29:26,649 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 453 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:26,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 89 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:29:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2022-03-15 19:29:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 2758. [2022-03-15 19:29:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2758 states, 2757 states have (on average 4.595937613347842) internal successors, (12671), 2757 states have internal predecessors, (12671), 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-03-15 19:29:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 12671 transitions. [2022-03-15 19:29:26,745 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 12671 transitions. Word has length 38 [2022-03-15 19:29:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:26,746 INFO L470 AbstractCegarLoop]: Abstraction has 2758 states and 12671 transitions. [2022-03-15 19:29:26,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:29:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 12671 transitions. [2022-03-15 19:29:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:26,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:26,752 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] [2022-03-15 19:29:26,771 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-03-15 19:29:26,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-03-15 19:29:26,961 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash -984237168, now seen corresponding path program 4 times [2022-03-15 19:29:26,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:26,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118648635] [2022-03-15 19:29:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:29:27,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:27,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118648635] [2022-03-15 19:29:27,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118648635] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:29:27,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240431650] [2022-03-15 19:29:27,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:29:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:29:27,039 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-03-15 19:29:27,040 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-03-15 19:29:27,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:29:27,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:29:27,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:29:27,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:29:27,193 INFO L387 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-03-15 19:29:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:29:27,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:29:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:29:27,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240431650] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:29:27,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:29:27,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-03-15 19:29:27,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937807993] [2022-03-15 19:29:27,384 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:27,389 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:27,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 212 states and 513 transitions. [2022-03-15 19:29:27,458 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:29,676 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [87143#(or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))), 87144#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))))] [2022-03-15 19:29:29,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:29:29,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:29:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:29:29,677 INFO L87 Difference]: Start difference. First operand 2758 states and 12671 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 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-03-15 19:29:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:30,486 INFO L93 Difference]: Finished difference Result 14789 states and 68985 transitions. [2022-03-15 19:29:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:29:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 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 38 [2022-03-15 19:29:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:30,511 INFO L225 Difference]: With dead ends: 14789 [2022-03-15 19:29:30,511 INFO L226 Difference]: Without dead ends: 8125 [2022-03-15 19:29:30,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 237 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:29:30,512 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 224 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:30,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 67 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:29:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8125 states. [2022-03-15 19:29:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8125 to 3338. [2022-03-15 19:29:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 3337 states have (on average 4.545100389571472) internal successors, (15167), 3337 states have internal predecessors, (15167), 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-03-15 19:29:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 15167 transitions. [2022-03-15 19:29:30,672 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 15167 transitions. Word has length 38 [2022-03-15 19:29:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:30,672 INFO L470 AbstractCegarLoop]: Abstraction has 3338 states and 15167 transitions. [2022-03-15 19:29:30,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 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-03-15 19:29:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 15167 transitions. [2022-03-15 19:29:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:30,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:30,680 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] [2022-03-15 19:29:30,697 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-03-15 19:29:30,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:30,896 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1232354840, now seen corresponding path program 5 times [2022-03-15 19:29:30,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:30,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279863483] [2022-03-15 19:29:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:29:31,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:31,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279863483] [2022-03-15 19:29:31,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279863483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:29:31,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:29:31,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:29:31,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230333440] [2022-03-15 19:29:31,021 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:31,028 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:31,086 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 291 transitions. [2022-03-15 19:29:31,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:32,009 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [108653#(= (mod ~b1~0 256) 0)] [2022-03-15 19:29:32,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:29:32,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:29:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:29:32,010 INFO L87 Difference]: Start difference. First operand 3338 states and 15167 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:29:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:32,127 INFO L93 Difference]: Finished difference Result 3765 states and 16962 transitions. [2022-03-15 19:29:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:29:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 19:29:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:32,136 INFO L225 Difference]: With dead ends: 3765 [2022-03-15 19:29:32,136 INFO L226 Difference]: Without dead ends: 3095 [2022-03-15 19:29:32,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:29:32,137 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:32,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:29:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-03-15 19:29:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3041. [2022-03-15 19:29:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3040 states have (on average 4.466447368421052) internal successors, (13578), 3040 states have internal predecessors, (13578), 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-03-15 19:29:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 13578 transitions. [2022-03-15 19:29:32,199 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 13578 transitions. Word has length 38 [2022-03-15 19:29:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:32,200 INFO L470 AbstractCegarLoop]: Abstraction has 3041 states and 13578 transitions. [2022-03-15 19:29:32,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:29:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 13578 transitions. [2022-03-15 19:29:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:32,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:32,207 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] [2022-03-15 19:29:32,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 19:29:32,207 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2108072756, now seen corresponding path program 6 times [2022-03-15 19:29:32,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:32,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908815020] [2022-03-15 19:29:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:29:32,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:32,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908815020] [2022-03-15 19:29:32,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908815020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:29:32,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:29:32,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 19:29:32,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2034699881] [2022-03-15 19:29:32,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:32,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:32,398 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 401 transitions. [2022-03-15 19:29:32,398 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:33,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [118512#(or (= ~b1~0 (* 256 (div ~b1~0 256))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)))] [2022-03-15 19:29:33,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:29:33,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:29:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:29:33,430 INFO L87 Difference]: Start difference. First operand 3041 states and 13578 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03-15 19:29:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:33,710 INFO L93 Difference]: Finished difference Result 5254 states and 23977 transitions. [2022-03-15 19:29:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:29:33,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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 38 [2022-03-15 19:29:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:33,720 INFO L225 Difference]: With dead ends: 5254 [2022-03-15 19:29:33,720 INFO L226 Difference]: Without dead ends: 3805 [2022-03-15 19:29:33,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 38 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:29:33,723 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 223 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:33,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 28 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:29:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2022-03-15 19:29:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3201. [2022-03-15 19:29:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 4.435625) internal successors, (14194), 3200 states have internal predecessors, (14194), 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-03-15 19:29:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 14194 transitions. [2022-03-15 19:29:33,790 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 14194 transitions. Word has length 38 [2022-03-15 19:29:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:33,790 INFO L470 AbstractCegarLoop]: Abstraction has 3201 states and 14194 transitions. [2022-03-15 19:29:33,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03-15 19:29:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 14194 transitions. [2022-03-15 19:29:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:33,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:33,797 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] [2022-03-15 19:29:33,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 19:29:33,797 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2093723084, now seen corresponding path program 7 times [2022-03-15 19:29:33,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:33,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939853342] [2022-03-15 19:29:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:29:33,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:33,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939853342] [2022-03-15 19:29:33,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939853342] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:29:33,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794946825] [2022-03-15 19:29:33,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:29:33,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:33,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:29:33,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:29:33,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:29:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:34,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:29:34,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:29:34,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:34,143 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:34,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:34,202 INFO L387 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-03-15 19:29:34,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-03-15 19:29:34,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-03-15 19:29:34,332 INFO L387 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-03-15 19:29:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:29:34,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:29:41,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_678))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse5 (store .cse0 c_~A~0.offset v_ArrVal_680)) (.cse6 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_680 1))) (let ((.cse1 (select (store .cse5 .cse6 v_ArrVal_682) (+ c_~A~0.offset (* c_thread2Thread1of1ForFork4_~i~1 4))))) (let ((.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse2 (< .cse1 c_~max~0))) (and (or (<= 2147483647 .cse1) .cse2 (<= .cse3 (+ .cse1 1))) (or (<= 2147483647 c_~max~0) (<= .cse3 (+ c_~max~0 1)) (not .cse2))))) (not (<= (+ (select .cse5 .cse6) 1) v_ArrVal_682))))))) is different from false [2022-03-15 19:29:41,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_678))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse5 (store .cse0 c_~A~0.offset v_ArrVal_680)) (.cse6 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_680 1))) (let ((.cse2 (select (store .cse5 .cse6 v_ArrVal_682) c_~A~0.offset))) (let ((.cse1 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse3 (< .cse2 c_~max~0))) (and (or (<= .cse1 (+ .cse2 1)) .cse3 (<= 2147483647 .cse2)) (or (<= 2147483647 c_~max~0) (<= .cse1 (+ c_~max~0 1)) (not .cse3))))) (not (<= (+ (select .cse5 .cse6) 1) v_ArrVal_682))))))) is different from false [2022-03-15 19:29:41,819 INFO L387 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 707 treesize of output 681 [2022-03-15 19:29:41,833 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:29:41,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 750 treesize of output 742 [2022-03-15 19:29:41,847 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:29:41,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 876 treesize of output 872 [2022-03-15 19:29:41,864 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:29:41,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 939 treesize of output 923 [2022-03-15 19:29:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:29:42,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794946825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:29:42,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:29:42,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 32 [2022-03-15 19:29:42,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1262036339] [2022-03-15 19:29:42,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:42,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:42,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 497 transitions. [2022-03-15 19:29:42,634 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:44,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:29:44,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:29:44,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:44,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:29:44,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=842, Unknown=10, NotChecked=122, Total=1122 [2022-03-15 19:29:44,552 INFO L87 Difference]: Start difference. First operand 3201 states and 14194 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03-15 19:29:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:44,863 INFO L93 Difference]: Finished difference Result 4618 states and 20797 transitions. [2022-03-15 19:29:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:29:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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 38 [2022-03-15 19:29:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:44,872 INFO L225 Difference]: With dead ends: 4618 [2022-03-15 19:29:44,872 INFO L226 Difference]: Without dead ends: 3521 [2022-03-15 19:29:44,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 161 SyntacticMatches, 50 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=224, Invalid=1180, Unknown=10, NotChecked=146, Total=1560 [2022-03-15 19:29:44,873 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 169 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:44,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 34 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:29:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2022-03-15 19:29:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 3065. [2022-03-15 19:29:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3064 states have (on average 4.460182767624021) internal successors, (13666), 3064 states have internal predecessors, (13666), 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-03-15 19:29:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 13666 transitions. [2022-03-15 19:29:44,930 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 13666 transitions. Word has length 38 [2022-03-15 19:29:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:44,931 INFO L470 AbstractCegarLoop]: Abstraction has 3065 states and 13666 transitions. [2022-03-15 19:29:44,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03-15 19:29:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 13666 transitions. [2022-03-15 19:29:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:44,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:44,937 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] [2022-03-15 19:29:44,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:29:45,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:45,151 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 212071180, now seen corresponding path program 8 times [2022-03-15 19:29:45,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:45,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738071099] [2022-03-15 19:29:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:29:45,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:45,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738071099] [2022-03-15 19:29:45,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738071099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:29:45,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:29:45,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 19:29:45,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833935890] [2022-03-15 19:29:45,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:45,290 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:45,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 405 transitions. [2022-03-15 19:29:45,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:29:46,477 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [141210#(or (= ~b1~0 (* 256 (div ~b1~0 256))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)))] [2022-03-15 19:29:46,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:29:46,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:29:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:29:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:29:46,477 INFO L87 Difference]: Start difference. First operand 3065 states and 13666 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-03-15 19:29:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:29:46,879 INFO L93 Difference]: Finished difference Result 5462 states and 24917 transitions. [2022-03-15 19:29:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:29:46,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 38 [2022-03-15 19:29:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:29:46,889 INFO L225 Difference]: With dead ends: 5462 [2022-03-15 19:29:46,890 INFO L226 Difference]: Without dead ends: 3929 [2022-03-15 19:29:46,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 29 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:29:46,890 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 195 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:29:46,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 38 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:29:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2022-03-15 19:29:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3273. [2022-03-15 19:29:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3272 states have (on average 4.440709046454768) internal successors, (14530), 3272 states have internal predecessors, (14530), 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-03-15 19:29:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 14530 transitions. [2022-03-15 19:29:46,953 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 14530 transitions. Word has length 38 [2022-03-15 19:29:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:29:46,953 INFO L470 AbstractCegarLoop]: Abstraction has 3273 states and 14530 transitions. [2022-03-15 19:29:46,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-03-15 19:29:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 14530 transitions. [2022-03-15 19:29:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:29:46,960 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:29:46,960 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] [2022-03-15 19:29:46,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 19:29:46,960 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:29:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:29:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 305242636, now seen corresponding path program 9 times [2022-03-15 19:29:46,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:29:46,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371769365] [2022-03-15 19:29:46,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:29:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:29:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:29:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:29:47,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:29:47,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371769365] [2022-03-15 19:29:47,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371769365] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:29:47,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225835465] [2022-03-15 19:29:47,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:29:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:29:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:29:47,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:29:47,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:29:47,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:29:47,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:29:47,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:29:47,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:29:47,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:47,402 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:47,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:29:47,432 INFO L387 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 14 treesize of output 16 [2022-03-15 19:29:47,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-03-15 19:29:47,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-03-15 19:29:47,583 INFO L387 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-03-15 19:29:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:29:47,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:29:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:29:58,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225835465] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:29:58,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:29:58,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 30 [2022-03-15 19:29:58,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463619768] [2022-03-15 19:29:58,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:29:58,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:29:58,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 501 transitions. [2022-03-15 19:29:58,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:21,563 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:30:21,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:30:21,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:30:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=753, Unknown=8, NotChecked=0, Total=930 [2022-03-15 19:30:21,564 INFO L87 Difference]: Start difference. First operand 3273 states and 14530 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-03-15 19:30:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:26,521 INFO L93 Difference]: Finished difference Result 4622 states and 20745 transitions. [2022-03-15 19:30:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:30:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 38 [2022-03-15 19:30:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:26,560 INFO L225 Difference]: With dead ends: 4622 [2022-03-15 19:30:26,560 INFO L226 Difference]: Without dead ends: 3665 [2022-03-15 19:30:26,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 170 SyntacticMatches, 41 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=245, Invalid=1079, Unknown=8, NotChecked=0, Total=1332 [2022-03-15 19:30:26,561 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 212 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:26,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 26 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:30:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2022-03-15 19:30:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3177. [2022-03-15 19:30:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3176 states have (on average 4.433879093198993) internal successors, (14082), 3176 states have internal predecessors, (14082), 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-03-15 19:30:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 14082 transitions. [2022-03-15 19:30:26,618 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 14082 transitions. Word has length 38 [2022-03-15 19:30:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:26,618 INFO L470 AbstractCegarLoop]: Abstraction has 3177 states and 14082 transitions. [2022-03-15 19:30:26,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-03-15 19:30:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 14082 transitions. [2022-03-15 19:30:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:30:26,625 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:26,625 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] [2022-03-15 19:30:26,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:30:26,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:30:26,843 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:30:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1312541134, now seen corresponding path program 10 times [2022-03-15 19:30:26,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:26,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530417758] [2022-03-15 19:30:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:30:28,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:28,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530417758] [2022-03-15 19:30:28,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530417758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:30:28,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91504038] [2022-03-15 19:30:28,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:30:28,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:30:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:30:28,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:30:28,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:30:29,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:30:29,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:30:29,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:30:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:30:29,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:30:29,165 INFO L387 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 13430 treesize of output 13302 [2022-03-15 19:30:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:30:32,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:30:32,519 INFO L387 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 14 treesize of output 16 [2022-03-15 19:30:33,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-03-15 19:30:36,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:30:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:30:37,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:30:39,633 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_911 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_911) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 19:30:39,758 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_911) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 19:30:39,839 INFO L387 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 69 treesize of output 53 [2022-03-15 19:30:39,865 INFO L387 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 28 treesize of output 26 [2022-03-15 19:30:39,888 INFO L387 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 44 treesize of output 40 [2022-03-15 19:30:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:30:41,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91504038] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:30:41,374 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:30:41,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 31 [2022-03-15 19:30:41,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398663761] [2022-03-15 19:30:41,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:30:41,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:30:41,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 247 transitions. [2022-03-15 19:30:41,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:53,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [164735#(= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (* (- 1) ~max~0)) 0)] [2022-03-15 19:30:53,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:30:53,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:30:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=839, Unknown=2, NotChecked=122, Total=1122 [2022-03-15 19:30:53,194 INFO L87 Difference]: Start difference. First operand 3177 states and 14082 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-03-15 19:31:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:03,401 INFO L93 Difference]: Finished difference Result 5143 states and 23216 transitions. [2022-03-15 19:31:03,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:31:03,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 38 [2022-03-15 19:31:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:03,412 INFO L225 Difference]: With dead ends: 5143 [2022-03-15 19:31:03,413 INFO L226 Difference]: Without dead ends: 3877 [2022-03-15 19:31:03,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 127 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=267, Invalid=1379, Unknown=2, NotChecked=158, Total=1806 [2022-03-15 19:31:03,413 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 147 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:03,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 40 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-03-15 19:31:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2022-03-15 19:31:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3225. [2022-03-15 19:31:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 3224 states have (on average 4.421836228287841) internal successors, (14256), 3224 states have internal predecessors, (14256), 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-03-15 19:31:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 14256 transitions. [2022-03-15 19:31:03,475 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 14256 transitions. Word has length 38 [2022-03-15 19:31:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:03,476 INFO L470 AbstractCegarLoop]: Abstraction has 3225 states and 14256 transitions. [2022-03-15 19:31:03,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-03-15 19:31:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 14256 transitions. [2022-03-15 19:31:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:31:03,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:03,483 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] [2022-03-15 19:31:03,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:03,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:31:03,700 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:31:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 126412250, now seen corresponding path program 11 times [2022-03-15 19:31:03,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:03,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826842493] [2022-03-15 19:31:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:31:06,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:06,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826842493] [2022-03-15 19:31:06,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826842493] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:06,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852006380] [2022-03-15 19:31:06,506 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:31:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:06,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:06,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:31:06,633 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:06,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:06,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:31:06,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:09,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:09,208 INFO L387 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 14 treesize of output 16 [2022-03-15 19:31:09,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:09,848 INFO L387 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 14 treesize of output 16 [2022-03-15 19:31:11,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 19:31:11,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-03-15 19:31:11,961 INFO L387 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-03-15 19:31:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:13,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:20,794 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1002) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_1003) c_~A~0.base))) (let ((.cse0 (store .cse2 c_~A~0.offset v_ArrVal_1005)) (.cse1 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (or (not (<= v_ArrVal_1006 (+ (select .cse0 .cse1) 1))) (<= (select (store .cse0 .cse1 v_ArrVal_1006) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_1005 1) (select .cse2 c_~A~0.offset)))))))) is different from false [2022-03-15 19:31:20,851 INFO L387 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 581 treesize of output 551 [2022-03-15 19:31:20,945 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:20,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 593 [2022-03-15 19:31:21,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:21,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 706 treesize of output 686 [2022-03-15 19:31:21,228 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:21,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 738 treesize of output 734 [2022-03-15 19:31:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:23,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852006380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:23,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:23,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2022-03-15 19:31:23,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366339160] [2022-03-15 19:31:23,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:23,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:23,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 160 states and 353 transitions. [2022-03-15 19:31:23,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:48,301 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [176607#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t5~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), 176606#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t5~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), 176605#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t5~0#1.base|)) (= (* |thread4Thread1of1ForFork3_~i~3#1| 4) 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread4Thread1of1ForFork3_~i~3#1| 4))) ~max~0)), 176604#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t5~0#1.base|)) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) ~max~0))] [2022-03-15 19:31:48,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:31:48,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:31:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1185, Unknown=8, NotChecked=72, Total=1482 [2022-03-15 19:31:48,302 INFO L87 Difference]: Start difference. First operand 3225 states and 14256 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-03-15 19:32:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:14,728 INFO L93 Difference]: Finished difference Result 6778 states and 30796 transitions. [2022-03-15 19:32:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:32:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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 38 [2022-03-15 19:32:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:14,742 INFO L225 Difference]: With dead ends: 6778 [2022-03-15 19:32:14,742 INFO L226 Difference]: Without dead ends: 4731 [2022-03-15 19:32:14,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=478, Invalid=2488, Unknown=8, NotChecked=106, Total=3080 [2022-03-15 19:32:14,743 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 281 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:14,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 108 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2022-03-15 19:32:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-03-15 19:32:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 3070. [2022-03-15 19:32:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 3069 states have (on average 4.4600847181492345) internal successors, (13688), 3069 states have internal predecessors, (13688), 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-03-15 19:32:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 13688 transitions. [2022-03-15 19:32:14,809 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 13688 transitions. Word has length 38 [2022-03-15 19:32:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:14,809 INFO L470 AbstractCegarLoop]: Abstraction has 3070 states and 13688 transitions. [2022-03-15 19:32:14,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-03-15 19:32:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 13688 transitions. [2022-03-15 19:32:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:32:14,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:14,815 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] [2022-03-15 19:32:14,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:15,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:15,032 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:32:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -31277894, now seen corresponding path program 12 times [2022-03-15 19:32:15,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:15,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229686434] [2022-03-15 19:32:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:32:17,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:17,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229686434] [2022-03-15 19:32:17,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229686434] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:17,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288524531] [2022-03-15 19:32:17,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:32:17,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:17,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:17,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:32:17,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:32:17,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:17,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:32:17,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:18,894 INFO L387 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 14 treesize of output 16 [2022-03-15 19:32:19,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:19,306 INFO L387 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 14 treesize of output 16 [2022-03-15 19:32:19,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 19:32:19,784 INFO L387 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 17 treesize of output 9 [2022-03-15 19:32:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:32:20,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:22,440 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_1097 Int) (v_ArrVal_1095 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_1095) c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (or (not (<= v_ArrVal_1097 (+ (select .cse0 .cse1) 1))) (<= (select (store .cse0 .cse1 v_ArrVal_1097) c_~A~0.offset) (+ c_~max~0 1)))))) is different from false [2022-03-15 19:32:22,605 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_1097 Int) (v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1094) |c_ULTIMATE.start_main_~#t5~0#1.base| v_ArrVal_1095) c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (or (<= (select (store .cse0 .cse1 v_ArrVal_1097) c_~A~0.offset) (+ c_~max~0 1)) (not (<= v_ArrVal_1097 (+ (select .cse0 .cse1) 1))))))) is different from false [2022-03-15 19:32:22,708 INFO L387 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 395 treesize of output 369 [2022-03-15 19:32:22,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:22,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 367 [2022-03-15 19:32:22,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:22,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 376 [2022-03-15 19:32:23,037 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:23,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-03-15 19:32:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:32:26,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288524531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:26,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:26,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-03-15 19:32:26,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333703483] [2022-03-15 19:32:26,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:26,268 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:26,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 387 transitions. [2022-03-15 19:32:26,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:50,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [189809#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t5~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), 189808#(= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (* (- 1) ~max~0)) 0), 189807#(or (= ~b1~0 (* 256 (div ~b1~0 256))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)))] [2022-03-15 19:32:50,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:32:50,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:32:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=546, Unknown=2, NotChecked=98, Total=756 [2022-03-15 19:32:50,350 INFO L87 Difference]: Start difference. First operand 3070 states and 13688 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-03-15 19:33:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:00,682 INFO L93 Difference]: Finished difference Result 6442 states and 29303 transitions. [2022-03-15 19:33:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:33:00,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 38 [2022-03-15 19:33:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:00,695 INFO L225 Difference]: With dead ends: 6442 [2022-03-15 19:33:00,695 INFO L226 Difference]: Without dead ends: 4600 [2022-03-15 19:33:00,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 162 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=229, Invalid=1109, Unknown=2, NotChecked=142, Total=1482 [2022-03-15 19:33:00,696 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 351 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:00,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 38 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-03-15 19:33:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2022-03-15 19:33:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 3122. [2022-03-15 19:33:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 4.447292534444088) internal successors, (13880), 3121 states have internal predecessors, (13880), 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-03-15 19:33:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 13880 transitions. [2022-03-15 19:33:00,770 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 13880 transitions. Word has length 38 [2022-03-15 19:33:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:00,771 INFO L470 AbstractCegarLoop]: Abstraction has 3122 states and 13880 transitions. [2022-03-15 19:33:00,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-03-15 19:33:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 13880 transitions. [2022-03-15 19:33:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:33:00,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:00,778 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] [2022-03-15 19:33:00,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:01,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:33:01,009 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2022-03-15 19:33:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash 239252118, now seen corresponding path program 13 times [2022-03-15 19:33:01,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:01,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593736291] [2022-03-15 19:33:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:03,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:03,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593736291] [2022-03-15 19:33:03,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593736291] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:03,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476145531] [2022-03-15 19:33:03,807 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:33:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:03,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:03,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:33:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:03,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:33:03,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:05,697 INFO L387 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 14 treesize of output 16 [2022-03-15 19:33:06,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:06,153 INFO L387 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 14 treesize of output 16 [2022-03-15 19:33:07,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:33:07,582 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:07,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-03-15 19:33:07,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-03-15 19:33:08,211 INFO L387 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-03-15 19:33:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:33:09,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-03-15 19:33:09,388 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-03-15 19:33:09,398 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:33:09,399 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 19:33:09,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:09,418 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:33:09,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:33:09,600 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. [2022-03-15 19:33:09,601 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 19:33:09,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 19:33:09,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 19:33:09,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 19:33:09,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATION (0 of 6 remaining) [2022-03-15 19:33:09,603 INFO L732 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1, 1, 1] [2022-03-15 19:33:09,605 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:33:09,605 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:33:09,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:33:09 BasicIcfg [2022-03-15 19:33:09,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:33:09,606 INFO L158 Benchmark]: Toolchain (without parser) took 839491.89ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 161.5MB in the beginning and 396.3MB in the end (delta: -234.8MB). Peak memory consumption was 876.8MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,606 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 211.8MB. Free memory is still 178.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:33:09,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.68ms. Allocated memory is still 211.8MB. Free memory was 161.3MB in the beginning and 187.1MB in the end (delta: -25.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.22ms. Allocated memory is still 211.8MB. Free memory was 186.5MB in the beginning and 184.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,607 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 211.8MB. Free memory was 184.5MB in the beginning and 182.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,607 INFO L158 Benchmark]: RCFGBuilder took 510.25ms. Allocated memory is still 211.8MB. Free memory was 182.9MB in the beginning and 158.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,607 INFO L158 Benchmark]: TraceAbstraction took 838610.86ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 158.2MB in the beginning and 396.3MB in the end (delta: -238.1MB). Peak memory consumption was 873.4MB. Max. memory is 8.0GB. [2022-03-15 19:33:09,608 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.10ms. Allocated memory is still 211.8MB. Free memory is still 178.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.68ms. Allocated memory is still 211.8MB. Free memory was 161.3MB in the beginning and 187.1MB in the end (delta: -25.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.22ms. Allocated memory is still 211.8MB. Free memory was 186.5MB in the beginning and 184.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 211.8MB. Free memory was 184.5MB in the beginning and 182.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 510.25ms. Allocated memory is still 211.8MB. Free memory was 182.9MB in the beginning and 158.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 838610.86ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 158.2MB in the beginning and 396.3MB in the end (delta: -238.1MB). Peak memory consumption was 873.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 197 PlacesBefore, 55 PlacesAfterwards, 195 TransitionsBefore, 44 TransitionsAfterwards, 3806 CoEnabledTransitionPairs, 8 FixpointIterations, 98 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 8 ConcurrentYvCompositions, 9 ChoiceCompositions, 174 TotalNumberOfCompositions, 5798 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4402, positive: 4264, positive conditional: 0, positive unconditional: 4264, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2048, positive: 2011, positive conditional: 0, positive unconditional: 2011, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4402, positive: 2253, positive conditional: 0, positive unconditional: 2253, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 2048, unknown conditional: 0, unknown unconditional: 2048] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - 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: 134]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 122]: 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 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 125]: 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 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 123]: 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 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 126]: 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 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 124]: 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 39 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 231 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 838.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.1s, AutomataDifference: 57.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2694 SdHoareTripleChecker+Valid, 40.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2694 mSDsluCounter, 559 SdHoareTripleChecker+Invalid, 38.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3775 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8142 IncrementalHoareTripleChecker+Invalid, 8584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 130 mSDtfsCounter, 8142 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4037 GetRequests, 3407 SyntacticMatches, 239 SemanticMatches, 391 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 6172 ImplicationChecksByTransitivity, 71.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3342occurred in iteration=6, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 19424 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 656.1s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1206 ConstructedInterpolants, 60 QuantifiedInterpolants, 15839 SizeOfPredicates, 123 NumberOfNonLiveVariables, 2896 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 111/150 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