/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 13:35:37,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 13:35:37,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 13:35:37,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 13:35:37,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 13:35:37,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 13:35:37,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 13:35:37,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 13:35:37,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 13:35:37,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 13:35:37,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 13:35:37,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 13:35:37,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 13:35:37,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 13:35:37,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 13:35:37,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 13:35:37,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 13:35:37,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 13:35:37,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 13:35:37,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 13:35:37,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 13:35:37,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 13:35:37,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 13:35:37,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 13:35:37,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 13:35:37,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 13:35:37,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 13:35:37,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 13:35:37,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 13:35:37,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 13:35:37,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 13:35:37,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 13:35:37,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 13:35:37,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 13:35:37,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 13:35:37,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 13:35:37,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 13:35:37,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 13:35:37,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 13:35:37,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 13:35:37,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 13:35:37,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 13:35:37,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 13:35:37,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 13:35:37,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 13:35:37,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 13:35:37,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 13:35:37,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 13:35:37,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 13:35:37,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 13:35:37,463 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 13:35:37,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 13:35:37,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 13:35:37,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 13:35:37,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:35:37,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 13:35:37,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-28 13:35:37,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 13:35:37,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 13:35:37,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 13:35:37,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 13:35:37,723 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 13:35:37,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-01-28 13:35:37,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc893d310/23709671922e40b095824740cac9aed3/FLAGb1f1300a9 [2022-01-28 13:35:38,195 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 13:35:38,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-01-28 13:35:38,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc893d310/23709671922e40b095824740cac9aed3/FLAGb1f1300a9 [2022-01-28 13:35:38,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc893d310/23709671922e40b095824740cac9aed3 [2022-01-28 13:35:38,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 13:35:38,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 13:35:38,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 13:35:38,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 13:35:38,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 13:35:38,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:38,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb1ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38, skipping insertion in model container [2022-01-28 13:35:38,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:38,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 13:35:38,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 13:35:38,884 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-prod-cons.wvr.c[3056,3069] [2022-01-28 13:35:38,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:35:38,907 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 13:35:38,943 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-prod-cons.wvr.c[3056,3069] [2022-01-28 13:35:38,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:35:38,957 INFO L208 MainTranslator]: Completed translation [2022-01-28 13:35:38,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38 WrapperNode [2022-01-28 13:35:38,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 13:35:38,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 13:35:38,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 13:35:38,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 13:35:38,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:38,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,014 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-01-28 13:35:39,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 13:35:39,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 13:35:39,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 13:35:39,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 13:35:39,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 13:35:39,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 13:35:39,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 13:35:39,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 13:35:39,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (1/1) ... [2022-01-28 13:35:39,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:35:39,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:35:39,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-28 13:35:39,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-28 13:35:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 13:35:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 13:35:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 13:35:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 13:35:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-28 13:35:39,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-28 13:35:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-28 13:35:39,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-28 13:35:39,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-28 13:35:39,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 13:35:39,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 13:35:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 13:35:39,147 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 13:35:39,235 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 13:35:39,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 13:35:39,428 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 13:35:39,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 13:35:39,539 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-28 13:35:39,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:35:39 BoogieIcfgContainer [2022-01-28 13:35:39,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 13:35:39,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 13:35:39,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 13:35:39,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 13:35:39,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:35:38" (1/3) ... [2022-01-28 13:35:39,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70764335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:35:39, skipping insertion in model container [2022-01-28 13:35:39,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:35:38" (2/3) ... [2022-01-28 13:35:39,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70764335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:35:39, skipping insertion in model container [2022-01-28 13:35:39,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:35:39" (3/3) ... [2022-01-28 13:35:39,554 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-01-28 13:35:39,563 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 13:35:39,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 13:35:39,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-28 13:35:39,564 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 13:35:39,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,623 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,623 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,624 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,624 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,624 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,625 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:35:39,630 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-28 13:35:39,667 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 13:35:39,672 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 13:35:39,673 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-28 13:35:39,683 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 156 transitions, 336 flow [2022-01-28 13:35:39,826 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-28 13:35:39,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:39,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:39,868 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2134475998, now seen corresponding path program 1 times [2022-01-28 13:35:39,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131994787] [2022-01-28 13:35:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:39,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:40,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131994787] [2022-01-28 13:35:40,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131994787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:35:40,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:35:40,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 13:35:40,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588174986] [2022-01-28 13:35:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:35:40,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-28 13:35:40,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-28 13:35:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:35:40,211 INFO L87 Difference]: Start difference. First operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:35:40,311 INFO L93 Difference]: Finished difference Result 2453 states and 8070 transitions. [2022-01-28 13:35:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-28 13:35:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-01-28 13:35:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:35:40,352 INFO L225 Difference]: With dead ends: 2453 [2022-01-28 13:35:40,352 INFO L226 Difference]: Without dead ends: 2449 [2022-01-28 13:35:40,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:35:40,359 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:35:40,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:35:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2022-01-28 13:35:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2022-01-28 13:35:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.2949346405228757) internal successors, (8066), 2448 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 8066 transitions. [2022-01-28 13:35:40,568 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 8066 transitions. Word has length 112 [2022-01-28 13:35:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:35:40,568 INFO L470 AbstractCegarLoop]: Abstraction has 2449 states and 8066 transitions. [2022-01-28 13:35:40,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 8066 transitions. [2022-01-28 13:35:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-28 13:35:40,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:40,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:40,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 13:35:40,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash -198236285, now seen corresponding path program 1 times [2022-01-28 13:35:40,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364878230] [2022-01-28 13:35:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:40,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:40,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:40,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364878230] [2022-01-28 13:35:40,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364878230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:35:40,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:35:40,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-28 13:35:40,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753251612] [2022-01-28 13:35:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:35:40,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-28 13:35:40,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-28 13:35:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-28 13:35:40,927 INFO L87 Difference]: Start difference. First operand 2449 states and 8066 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:35:41,195 INFO L93 Difference]: Finished difference Result 3433 states and 11469 transitions. [2022-01-28 13:35:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 13:35:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-01-28 13:35:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:35:41,255 INFO L225 Difference]: With dead ends: 3433 [2022-01-28 13:35:41,255 INFO L226 Difference]: Without dead ends: 2164 [2022-01-28 13:35:41,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-28 13:35:41,257 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 259 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:35:41,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 610 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:35:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-01-28 13:35:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2022-01-28 13:35:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 3.1673601479426723) internal successors, (6851), 2163 states have internal predecessors, (6851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 6851 transitions. [2022-01-28 13:35:41,331 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 6851 transitions. Word has length 112 [2022-01-28 13:35:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:35:41,334 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 6851 transitions. [2022-01-28 13:35:41,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 6851 transitions. [2022-01-28 13:35:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-28 13:35:41,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:41,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:41,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 13:35:41,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -50241742, now seen corresponding path program 1 times [2022-01-28 13:35:41,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:41,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322563381] [2022-01-28 13:35:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:41,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:41,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322563381] [2022-01-28 13:35:41,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322563381] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:35:41,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941589842] [2022-01-28 13:35:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:41,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:35:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:35:41,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:35:41,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-28 13:35:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-28 13:35:41,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:35:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:41,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:35:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:42,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941589842] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:35:42,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:35:42,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-01-28 13:35:42,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235224676] [2022-01-28 13:35:42,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:35:42,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-28 13:35:42,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-28 13:35:42,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-28 13:35:42,161 INFO L87 Difference]: Start difference. First operand 2164 states and 6851 transitions. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:35:42,256 INFO L93 Difference]: Finished difference Result 2869 states and 9286 transitions. [2022-01-28 13:35:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:35:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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 116 [2022-01-28 13:35:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:35:42,274 INFO L225 Difference]: With dead ends: 2869 [2022-01-28 13:35:42,274 INFO L226 Difference]: Without dead ends: 2305 [2022-01-28 13:35:42,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:35:42,275 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 256 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:35:42,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 495 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:35:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-01-28 13:35:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2022-01-28 13:35:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 3.1236979166666665) internal successors, (7197), 2304 states have internal predecessors, (7197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 7197 transitions. [2022-01-28 13:35:42,346 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 7197 transitions. Word has length 116 [2022-01-28 13:35:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:35:42,346 INFO L470 AbstractCegarLoop]: Abstraction has 2305 states and 7197 transitions. [2022-01-28 13:35:42,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 7197 transitions. [2022-01-28 13:35:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-28 13:35:42,354 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:42,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:42,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-28 13:35:42,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:35:42,568 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash 102358740, now seen corresponding path program 2 times [2022-01-28 13:35:42,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:42,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394815963] [2022-01-28 13:35:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:42,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:42,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:42,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394815963] [2022-01-28 13:35:42,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394815963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:35:42,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:35:42,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-28 13:35:42,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123653173] [2022-01-28 13:35:42,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:35:42,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 13:35:42,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 13:35:42,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 13:35:42,699 INFO L87 Difference]: Start difference. First operand 2305 states and 7197 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:35:42,734 INFO L93 Difference]: Finished difference Result 2493 states and 7603 transitions. [2022-01-28 13:35:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 13:35:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2022-01-28 13:35:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:35:42,748 INFO L225 Difference]: With dead ends: 2493 [2022-01-28 13:35:42,748 INFO L226 Difference]: Without dead ends: 2343 [2022-01-28 13:35:42,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 13:35:42,749 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:35:42,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:35:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-28 13:35:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-28 13:35:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 3.066609735269001) internal successors, (7182), 2342 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 7182 transitions. [2022-01-28 13:35:42,835 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 7182 transitions. Word has length 116 [2022-01-28 13:35:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:35:42,836 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 7182 transitions. [2022-01-28 13:35:42,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 7182 transitions. [2022-01-28 13:35:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:35:42,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:42,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:42,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 13:35:42,845 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash 743330443, now seen corresponding path program 1 times [2022-01-28 13:35:42,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:42,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909872246] [2022-01-28 13:35:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:42,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:35:42,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:42,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909872246] [2022-01-28 13:35:42,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909872246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:35:42,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:35:42,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:35:42,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005031452] [2022-01-28 13:35:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:35:42,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:35:42,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:35:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:35:42,914 INFO L87 Difference]: Start difference. First operand 2343 states and 7182 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:35:42,993 INFO L93 Difference]: Finished difference Result 2594 states and 7748 transitions. [2022-01-28 13:35:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:35:42,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 123 [2022-01-28 13:35:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:35:43,007 INFO L225 Difference]: With dead ends: 2594 [2022-01-28 13:35:43,007 INFO L226 Difference]: Without dead ends: 2349 [2022-01-28 13:35:43,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:35:43,008 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 334 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:35:43,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 355 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:35:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-01-28 13:35:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2344. [2022-01-28 13:35:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 3.0657276995305165) internal successors, (7183), 2343 states have internal predecessors, (7183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 7183 transitions. [2022-01-28 13:35:43,082 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 7183 transitions. Word has length 123 [2022-01-28 13:35:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:35:43,082 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 7183 transitions. [2022-01-28 13:35:43,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:35:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 7183 transitions. [2022-01-28 13:35:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:35:43,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:35:43,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:35:43,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 13:35:43,091 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:35:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:35:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -129850157, now seen corresponding path program 1 times [2022-01-28 13:35:43,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:35:43,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465225884] [2022-01-28 13:35:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:43,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:35:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:44,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:35:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465225884] [2022-01-28 13:35:44,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465225884] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:35:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710656894] [2022-01-28 13:35:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:35:44,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:35:44,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:35:44,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:35:44,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-28 13:35:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:35:44,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-28 13:35:44,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:35:45,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-28 13:35:46,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:35:46,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:35:46,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-28 13:35:46,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:35:46,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-28 13:35:47,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-28 13:35:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:35:47,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:35:47,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_121 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset)) c_~d~0) c_~W~0)) is different from false [2022-01-28 13:35:47,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)) is different from false [2022-01-28 13:35:49,209 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:35:49,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2022-01-28 13:35:49,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:35:49,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 354 [2022-01-28 13:35:49,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-01-28 13:35:49,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:35:49,245 INFO L388 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 290 treesize of output 288 [2022-01-28 13:35:49,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 230 [2022-01-28 13:35:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-28 13:35:51,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710656894] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:35:51,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:35:51,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35, 34] total 87 [2022-01-28 13:35:51,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095077630] [2022-01-28 13:35:51,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:35:51,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-01-28 13:35:51,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:35:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-01-28 13:35:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=6545, Unknown=20, NotChecked=334, Total=7482 [2022-01-28 13:35:51,277 INFO L87 Difference]: Start difference. First operand 2344 states and 7183 transitions. Second operand has 87 states, 87 states have (on average 3.7701149425287355) internal successors, (328), 87 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:05,876 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse2 (<= c_~d~0 0)) (.cse3 (< c_~back~0 0)) (.cse0 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse0 (<= 1 c_~v_assert~0) (<= c_~v_assert~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~d~0 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2 (or .cse3 (<= 1 c_~back~0) (and (= (* 4 c_~back~0) (* 4 c_~front~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2)) (or .cse3 .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-28 13:36:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:13,249 INFO L93 Difference]: Finished difference Result 20270 states and 62787 transitions. [2022-01-28 13:36:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-01-28 13:36:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.7701149425287355) internal successors, (328), 87 states have internal predecessors, (328), 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 130 [2022-01-28 13:36:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:13,330 INFO L225 Difference]: With dead ends: 20270 [2022-01-28 13:36:13,331 INFO L226 Difference]: Without dead ends: 16271 [2022-01-28 13:36:13,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 228 SyntacticMatches, 28 SemanticMatches, 228 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 19723 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=7243, Invalid=43757, Unknown=314, NotChecked=1356, Total=52670 [2022-01-28 13:36:13,342 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 6712 mSDsluCounter, 11630 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6712 SdHoareTripleChecker+Valid, 10073 SdHoareTripleChecker+Invalid, 12037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7094 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:13,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6712 Valid, 10073 Invalid, 12037 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [431 Valid, 4512 Invalid, 0 Unknown, 7094 Unchecked, 2.9s Time] [2022-01-28 13:36:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16271 states. [2022-01-28 13:36:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16271 to 4220. [2022-01-28 13:36:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4219 states have (on average 2.9898080113771037) internal successors, (12614), 4219 states have internal predecessors, (12614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 12614 transitions. [2022-01-28 13:36:13,607 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 12614 transitions. Word has length 130 [2022-01-28 13:36:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:13,608 INFO L470 AbstractCegarLoop]: Abstraction has 4220 states and 12614 transitions. [2022-01-28 13:36:13,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.7701149425287355) internal successors, (328), 87 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 12614 transitions. [2022-01-28 13:36:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:36:13,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:13,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:13,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:13,847 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,SelfDestructingSolverStorable5 [2022-01-28 13:36:13,848 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:36:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 131013671, now seen corresponding path program 2 times [2022-01-28 13:36:13,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518577518] [2022-01-28 13:36:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:13,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:14,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518577518] [2022-01-28 13:36:14,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518577518] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064795790] [2022-01-28 13:36:14,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:36:14,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:14,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:14,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-28 13:36:15,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:36:15,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:15,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-28 13:36:15,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:16,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-28 13:36:16,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:36:16,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:36:17,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:36:17,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-28 13:36:17,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-28 13:36:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:17,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:17,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_158) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset)) c_~d~0) c_~W~0)) is different from false [2022-01-28 13:36:19,295 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:19,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2022-01-28 13:36:19,307 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:19,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 394 [2022-01-28 13:36:19,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:19,323 INFO L388 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 378 treesize of output 358 [2022-01-28 13:36:19,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 242 [2022-01-28 13:36:19,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:19,352 INFO L388 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 179 treesize of output 177 [2022-01-28 13:36:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:21,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064795790] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:21,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:21,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34, 33] total 85 [2022-01-28 13:36:21,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813511407] [2022-01-28 13:36:21,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:21,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-28 13:36:21,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-28 13:36:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=6443, Unknown=24, NotChecked=164, Total=7140 [2022-01-28 13:36:21,196 INFO L87 Difference]: Start difference. First operand 4220 states and 12614 transitions. Second operand has 85 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 85 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:45,562 INFO L93 Difference]: Finished difference Result 34338 states and 104292 transitions. [2022-01-28 13:36:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-01-28 13:36:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 85 states have internal predecessors, (328), 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 130 [2022-01-28 13:36:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:45,718 INFO L225 Difference]: With dead ends: 34338 [2022-01-28 13:36:45,718 INFO L226 Difference]: Without dead ends: 30726 [2022-01-28 13:36:45,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 224 SyntacticMatches, 52 SemanticMatches, 224 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22062 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=7871, Invalid=42482, Unknown=51, NotChecked=446, Total=50850 [2022-01-28 13:36:45,724 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 8693 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 5906 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8693 SdHoareTripleChecker+Valid, 15163 SdHoareTripleChecker+Invalid, 12082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 5906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5519 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:45,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8693 Valid, 15163 Invalid, 12082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [657 Valid, 5906 Invalid, 0 Unknown, 5519 Unchecked, 3.5s Time] [2022-01-28 13:36:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30726 states. [2022-01-28 13:36:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30726 to 5460. [2022-01-28 13:36:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 2.979117054405569) internal successors, (16263), 5459 states have internal predecessors, (16263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 16263 transitions. [2022-01-28 13:36:46,128 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 16263 transitions. Word has length 130 [2022-01-28 13:36:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:46,128 INFO L470 AbstractCegarLoop]: Abstraction has 5460 states and 16263 transitions. [2022-01-28 13:36:46,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 85 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 16263 transitions. [2022-01-28 13:36:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-28 13:36:46,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:46,146 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:46,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-28 13:36:46,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:46,369 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:36:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 526565270, now seen corresponding path program 3 times [2022-01-28 13:36:46,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:46,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570099347] [2022-01-28 13:36:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:46,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:36:46,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:46,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570099347] [2022-01-28 13:36:46,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570099347] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:46,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408295795] [2022-01-28 13:36:46,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:36:46,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:46,511 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-01-28 13:36:46,524 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-01-28 13:36:46,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:36:46,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:46,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-28 13:36:46,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:36:46,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:36:47,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408295795] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:47,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:47,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2022-01-28 13:36:47,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937546914] [2022-01-28 13:36:47,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:47,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:36:47,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:36:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:36:47,273 INFO L87 Difference]: Start difference. First operand 5460 states and 16263 transitions. Second operand has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:47,361 INFO L93 Difference]: Finished difference Result 10852 states and 32847 transitions. [2022-01-28 13:36:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-28 13:36:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 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 134 [2022-01-28 13:36:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:47,391 INFO L225 Difference]: With dead ends: 10852 [2022-01-28 13:36:47,392 INFO L226 Difference]: Without dead ends: 10213 [2022-01-28 13:36:47,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-28 13:36:47,392 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 364 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:47,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 298 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:36:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10213 states. [2022-01-28 13:36:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10213 to 8291. [2022-01-28 13:36:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8291 states, 8290 states have (on average 2.9685162846803377) internal successors, (24609), 8290 states have internal predecessors, (24609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 24609 transitions. [2022-01-28 13:36:47,695 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 24609 transitions. Word has length 134 [2022-01-28 13:36:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:47,696 INFO L470 AbstractCegarLoop]: Abstraction has 8291 states and 24609 transitions. [2022-01-28 13:36:47,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 24609 transitions. [2022-01-28 13:36:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:36:47,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:47,719 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:47,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:47,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:47,936 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:36:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2146157939, now seen corresponding path program 4 times [2022-01-28 13:36:47,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116596491] [2022-01-28 13:36:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:47,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:49,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:49,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116596491] [2022-01-28 13:36:49,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116596491] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:49,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501389467] [2022-01-28 13:36:49,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:36:49,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:49,308 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-01-28 13:36:49,334 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-01-28 13:36:49,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:36:49,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:49,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-28 13:36:49,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:49,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:36:49,475 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-28 13:36:49,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-28 13:36:49,796 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-28 13:36:49,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:36:50,628 INFO L388 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 18 treesize of output 20 [2022-01-28 13:36:50,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-28 13:36:50,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-28 13:36:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:36:50,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:51,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)) is different from false [2022-01-28 13:36:51,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)) is different from false [2022-01-28 13:36:51,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:51,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 166 [2022-01-28 13:36:51,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-01-28 13:36:51,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2022-01-28 13:36:53,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-01-28 13:36:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-01-28 13:36:53,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501389467] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:53,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:53,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 23] total 68 [2022-01-28 13:36:53,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312550118] [2022-01-28 13:36:53,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:53,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-28 13:36:53,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:53,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-28 13:36:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3954, Unknown=3, NotChecked=258, Total=4556 [2022-01-28 13:36:53,400 INFO L87 Difference]: Start difference. First operand 8291 states and 24609 transitions. Second operand has 68 states, 68 states have (on average 5.0) internal successors, (340), 68 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:03,959 INFO L93 Difference]: Finished difference Result 32675 states and 95476 transitions. [2022-01-28 13:37:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-01-28 13:37:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 5.0) internal successors, (340), 68 states have internal predecessors, (340), 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 137 [2022-01-28 13:37:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:04,052 INFO L225 Difference]: With dead ends: 32675 [2022-01-28 13:37:04,052 INFO L226 Difference]: Without dead ends: 27578 [2022-01-28 13:37:04,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 234 SyntacticMatches, 10 SemanticMatches, 177 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 11336 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3143, Invalid=28014, Unknown=3, NotChecked=702, Total=31862 [2022-01-28 13:37:04,055 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 3075 mSDsluCounter, 13208 mSDsCounter, 0 mSdLazyCounter, 6006 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3075 SdHoareTripleChecker+Valid, 11800 SdHoareTripleChecker+Invalid, 7827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 6006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1701 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:04,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3075 Valid, 11800 Invalid, 7827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 6006 Invalid, 0 Unknown, 1701 Unchecked, 2.9s Time] [2022-01-28 13:37:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27578 states. [2022-01-28 13:37:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27578 to 4902. [2022-01-28 13:37:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4901 states have (on average 3.0246888390124465) internal successors, (14824), 4901 states have internal predecessors, (14824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 14824 transitions. [2022-01-28 13:37:04,441 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 14824 transitions. Word has length 137 [2022-01-28 13:37:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:04,441 INFO L470 AbstractCegarLoop]: Abstraction has 4902 states and 14824 transitions. [2022-01-28 13:37:04,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 5.0) internal successors, (340), 68 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 14824 transitions. [2022-01-28 13:37:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-28 13:37:04,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:04,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:37:04,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-28 13:37:04,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:04,680 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:37:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -385964561, now seen corresponding path program 5 times [2022-01-28 13:37:04,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:04,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714840035] [2022-01-28 13:37:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:04,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-28 13:37:04,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714840035] [2022-01-28 13:37:04,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714840035] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932654411] [2022-01-28 13:37:04,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:37:04,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:04,800 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-01-28 13:37:04,827 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-01-28 13:37:04,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-28 13:37:04,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:04,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-28 13:37:04,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-28 13:37:05,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-28 13:37:05,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932654411] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:05,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:05,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-28 13:37:05,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100303755] [2022-01-28 13:37:05,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:05,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-28 13:37:05,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-28 13:37:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-28 13:37:05,484 INFO L87 Difference]: Start difference. First operand 4902 states and 14824 transitions. Second operand has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:05,661 INFO L93 Difference]: Finished difference Result 5761 states and 16994 transitions. [2022-01-28 13:37:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-28 13:37:05,661 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 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 141 [2022-01-28 13:37:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:05,671 INFO L225 Difference]: With dead ends: 5761 [2022-01-28 13:37:05,672 INFO L226 Difference]: Without dead ends: 4914 [2022-01-28 13:37:05,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-01-28 13:37:05,672 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 766 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:05,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 840 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:37:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2022-01-28 13:37:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4909. [2022-01-28 13:37:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 3.021801140994295) internal successors, (14831), 4908 states have internal predecessors, (14831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 14831 transitions. [2022-01-28 13:37:05,791 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 14831 transitions. Word has length 141 [2022-01-28 13:37:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:05,791 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 14831 transitions. [2022-01-28 13:37:05,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 14831 transitions. [2022-01-28 13:37:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:37:05,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:05,804 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:37:05,831 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-01-28 13:37:06,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:06,028 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:37:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1959922121, now seen corresponding path program 6 times [2022-01-28 13:37:06,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204236563] [2022-01-28 13:37:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:06,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:07,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:07,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204236563] [2022-01-28 13:37:07,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204236563] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:07,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868302081] [2022-01-28 13:37:07,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:37:07,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:07,283 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-01-28 13:37:07,284 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-01-28 13:37:07,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:37:07,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:07,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-28 13:37:07,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:08,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-28 13:37:09,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:37:09,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:09,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-28 13:37:10,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:10,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-28 13:37:10,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:10,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:10,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-01-28 13:37:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:10,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:10,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_303) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ .cse1 c_~queue~0.offset)) (select .cse0 (+ .cse1 c_~queue~0.offset 4)) c_~d~0)) c_~W~0)) is different from false [2022-01-28 13:37:10,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_303) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ .cse1 c_~queue~0.offset)) c_~d~0 (select .cse0 (+ .cse1 c_~queue~0.offset 4)))) c_~W~0)) is different from false [2022-01-28 13:37:12,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:12,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2022-01-28 13:37:12,815 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:37:12,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 528 treesize of output 529 [2022-01-28 13:37:12,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-28 13:37:12,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 324 [2022-01-28 13:37:12,856 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:37:12,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 386 [2022-01-28 13:37:12,869 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:37:12,869 INFO L388 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 298 treesize of output 246 [2022-01-28 13:37:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-28 13:37:16,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868302081] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:16,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:16,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 39, 39] total 103 [2022-01-28 13:37:16,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69281495] [2022-01-28 13:37:16,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:16,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-01-28 13:37:16,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-01-28 13:37:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=9220, Unknown=27, NotChecked=398, Total=10506 [2022-01-28 13:37:16,978 INFO L87 Difference]: Start difference. First operand 4909 states and 14831 transitions. Second operand has 103 states, 103 states have (on average 3.70873786407767) internal successors, (382), 103 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:31,748 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_303) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ (select .cse2 (+ .cse3 c_~queue~0.offset)) c_~d~0 (select .cse2 (+ .cse3 c_~queue~0.offset 4)))) c_~W~0))) (.cse1 (< c_~back~0 0))) (and .cse0 (or .cse1 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0) (= (mod c_~v_assert~0 256) 0)) (or .cse1 (<= 1 c_~back~0) (and (= (* 4 c_~back~0) (* 4 c_~front~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0))))) is different from false [2022-01-28 13:37:32,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_303) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ (select .cse1 (+ .cse2 c_~queue~0.offset)) c_~d~0 (select .cse1 (+ .cse2 c_~queue~0.offset 4)))) c_~W~0)))) (and (or (< c_~back~0 0) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) (<= c_~n~0 c_~back~0) (= (mod c_~v_assert~0 256) 0)) .cse0)) is different from false [2022-01-28 13:37:33,830 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_303) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ (select .cse1 (+ .cse2 c_~queue~0.offset)) c_~d~0 (select .cse1 (+ .cse2 c_~queue~0.offset 4)))) c_~W~0)))) (and .cse0 (or (< c_~back~0 0) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0) (= (mod c_~v_assert~0 256) 0) (<= |c_thread1Thread1of1ForFork1_~w~0#1| 0)))) is different from false [2022-01-28 13:37:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:47,209 INFO L93 Difference]: Finished difference Result 36423 states and 112206 transitions. [2022-01-28 13:37:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-01-28 13:37:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.70873786407767) internal successors, (382), 103 states have internal predecessors, (382), 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 148 [2022-01-28 13:37:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:47,286 INFO L225 Difference]: With dead ends: 36423 [2022-01-28 13:37:47,286 INFO L226 Difference]: Without dead ends: 31854 [2022-01-28 13:37:47,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 268 SyntacticMatches, 57 SemanticMatches, 287 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 33519 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=9642, Invalid=70687, Unknown=63, NotChecked=2840, Total=83232 [2022-01-28 13:37:47,290 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 6836 mSDsluCounter, 22788 mSDsCounter, 0 mSdLazyCounter, 10052 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6836 SdHoareTripleChecker+Valid, 19755 SdHoareTripleChecker+Invalid, 19032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 10052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8362 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:47,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6836 Valid, 19755 Invalid, 19032 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [618 Valid, 10052 Invalid, 0 Unknown, 8362 Unchecked, 5.0s Time] [2022-01-28 13:37:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31854 states. [2022-01-28 13:37:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31854 to 7342. [2022-01-28 13:37:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7342 states, 7341 states have (on average 2.957635199564092) internal successors, (21712), 7341 states have internal predecessors, (21712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 21712 transitions. [2022-01-28 13:37:47,610 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 21712 transitions. Word has length 148 [2022-01-28 13:37:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:47,611 INFO L470 AbstractCegarLoop]: Abstraction has 7342 states and 21712 transitions. [2022-01-28 13:37:47,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.70873786407767) internal successors, (382), 103 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 21712 transitions. [2022-01-28 13:37:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:37:47,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:47,628 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:37:47,759 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-01-28 13:37:47,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:47,948 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:37:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash -837744407, now seen corresponding path program 7 times [2022-01-28 13:37:47,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:47,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098507847] [2022-01-28 13:37:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:47,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:49,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098507847] [2022-01-28 13:37:49,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098507847] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139835170] [2022-01-28 13:37:49,578 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:37:49,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:49,579 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-01-28 13:37:49,580 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-01-28 13:37:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-28 13:37:49,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:51,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-28 13:37:51,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:37:52,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:52,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-28 13:37:52,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:52,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-01-28 13:37:53,200 INFO L354 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-28 13:37:53,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-01-28 13:37:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:53,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:53,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int))) (<= (+ |c_thread2Thread1of1ForFork2_~temp~0#1| c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)) is different from false [2022-01-28 13:37:53,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse0 c_~queue~0.offset 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ .cse0 c_~queue~0.offset)) c_~d~0)) c_~W~0)) is different from false [2022-01-28 13:37:53,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse1 c_~queue~0.offset 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ .cse1 c_~queue~0.offset)))) c_~W~0)) is different from false [2022-01-28 13:37:56,124 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:56,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-01-28 13:37:56,165 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:37:56,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15286 treesize of output 13722 [2022-01-28 13:37:56,235 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:37:56,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13670 treesize of output 12494 [2022-01-28 13:37:56,280 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:37:56,280 INFO L388 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 12406 treesize of output 9974 [2022-01-28 13:37:56,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9974 treesize of output 8182 [2022-01-28 13:38:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-01-28 13:38:09,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139835170] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:09,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:09,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 42, 41] total 109 [2022-01-28 13:38:09,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938003689] [2022-01-28 13:38:09,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:09,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-01-28 13:38:09,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-01-28 13:38:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=10317, Unknown=13, NotChecked=630, Total=11772 [2022-01-28 13:38:09,699 INFO L87 Difference]: Start difference. First operand 7342 states and 21712 transitions. Second operand has 109 states, 109 states have (on average 3.3944954128440368) internal successors, (370), 109 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:36,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (<= c_~front~0 c_~back~0)) (.cse14 (<= c_~n~0 (+ c_~back~0 1))) (.cse7 (<= c_~d~0 0))) (let ((.cse13 (or .cse14 .cse7)) (.cse8 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (.cse15 (or .cse14 .cse9)) (.cse16 (or .cse14 (<= c_~n~0 (+ 2 c_~front~0)))) (.cse10 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (let ((.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse3 (and .cse13 (or .cse14 .cse8) .cse15 .cse16 (or .cse14 .cse10))) (.cse5 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse18 (* c_~front~0 4))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse18 c_~queue~0.offset 4)) c_~d~0 (select (select .cse17 c_~queue~0.base) (+ .cse18 c_~queue~0.offset)))) c_~W~0))) (.cse0 (< c_~back~0 0)) (.cse11 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (and .cse13 (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse15 .cse16)) (.cse12 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (.cse2 (= (mod c_~v_assert~0 256) 0))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) .cse1 .cse2) (or .cse0 .cse3 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 c_~v_assert~0) (<= c_~v_assert~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~d~0 0) .cse5 (or .cse0 (let ((.cse6 (<= 1 c_~back~0))) (and (or .cse6 (<= 0 c_~front~0)) (or .cse6 .cse7) (or .cse6 .cse8) (or .cse6 .cse9) (or .cse10 .cse6)))) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 .cse3 .cse11 .cse12 .cse2) (<= c_~d~0 c_~W~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) .cse7 (or .cse0 .cse11 .cse12 .cse2 (and .cse13 (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse15 .cse16)) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse0 .cse11 .cse1 .cse12 .cse2))))) is different from false [2022-01-28 13:38:37,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse2 c_~queue~0.offset 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ .cse2 c_~queue~0.offset)))) c_~W~0)))) (and .cse0 (or (< c_~back~0 0) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) (<= c_~n~0 c_~back~0)))) is different from false [2022-01-28 13:38:38,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (<= c_~front~0 c_~back~0)) (.cse14 (<= c_~n~0 (+ c_~back~0 1))) (.cse7 (<= c_~d~0 0))) (let ((.cse13 (or .cse14 .cse7)) (.cse8 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (.cse15 (or .cse14 .cse9)) (.cse16 (or .cse14 (<= c_~n~0 (+ 2 c_~front~0)))) (.cse10 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (let ((.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse3 (and .cse13 (or .cse14 .cse8) .cse15 .cse16 (or .cse14 .cse10))) (.cse5 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse18 (* c_~front~0 4))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse18 c_~queue~0.offset 4)) c_~d~0 (select (select .cse17 c_~queue~0.base) (+ .cse18 c_~queue~0.offset)))) c_~W~0))) (.cse0 (< c_~back~0 0)) (.cse11 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (and .cse13 (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse15 .cse16)) (.cse12 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (.cse2 (= (mod c_~v_assert~0 256) 0))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) .cse1 .cse2) (or .cse0 .cse3 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 c_~v_assert~0) (<= c_~v_assert~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~d~0 0) .cse5 (or .cse0 (let ((.cse6 (<= 1 c_~back~0))) (and (or .cse6 (<= 0 c_~front~0)) (or .cse6 .cse7) (or .cse6 .cse8) (or .cse6 .cse9) (or .cse10 .cse6)))) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 .cse3 .cse11 .cse12 .cse2) .cse7 (or .cse0 .cse11 .cse12 .cse2 (and .cse13 (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse15 .cse16)) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse0 .cse11 .cse1 .cse12 .cse2))))) is different from false [2022-01-28 13:38:38,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse2 c_~queue~0.offset 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ .cse2 c_~queue~0.offset)))) c_~W~0)))) (and .cse0 (or (< c_~back~0 0) .cse0 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0) (<= |c_thread1Thread1of1ForFork1_~w~0#1| 0)))) is different from false [2022-01-28 13:38:40,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (<= c_~front~0 c_~back~0)) (.cse14 (<= c_~n~0 (+ c_~back~0 1))) (.cse7 (<= c_~d~0 0))) (let ((.cse13 (or .cse14 .cse7)) (.cse8 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (.cse15 (or .cse14 .cse9)) (.cse16 (or .cse14 (<= c_~n~0 (+ 2 c_~front~0)))) (.cse10 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (let ((.cse4 (+ |c_#StackHeapBarrier| 1)) (.cse3 (and .cse13 (or .cse14 .cse8) .cse15 .cse16 (or .cse14 .cse10))) (.cse5 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse18 (* c_~front~0 4))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse18 c_~queue~0.offset 4)) c_~d~0 (select (select .cse17 c_~queue~0.base) (+ .cse18 c_~queue~0.offset)))) c_~W~0))) (.cse0 (< c_~back~0 0)) (.cse11 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (and .cse13 (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (or .cse14 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse15 .cse16)) (.cse12 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (.cse2 (= (mod c_~v_assert~0 256) 0))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) .cse1 .cse2) (or .cse0 .cse3 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 c_~v_assert~0) (<= c_~v_assert~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~d~0 0) .cse5 (or .cse0 (let ((.cse6 (<= 1 c_~back~0))) (and (or .cse6 (<= 0 c_~front~0)) (or .cse6 .cse7) (or .cse6 .cse8) (or .cse6 .cse9) (or .cse10 .cse6)))) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 .cse3 .cse11 .cse12 .cse2) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) .cse7 (or .cse0 .cse11 .cse12 .cse2 (and .cse13 (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (or .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse15 .cse16)) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse0 .cse11 .cse1 .cse12 .cse2))))) is different from false [2022-01-28 13:38:44,256 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~back~0 0)) (.cse0 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse4 (* c_~front~0 4))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse4 c_~queue~0.offset 4)) c_~d~0 (select (select .cse3 c_~queue~0.base) (+ .cse4 c_~queue~0.offset)))) c_~W~0)))) (and .cse0 (or .cse1 (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (<= 0 c_~front~0)) (or .cse2 (<= c_~d~0 0)) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (or .cse2 (<= c_~front~0 c_~back~0)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2)))) (or .cse1 .cse0 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)))) is different from false [2022-01-28 13:38:47,231 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~back~0 0)) (.cse0 (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_343)) (.cse4 (* c_~front~0 4))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) (+ .cse4 c_~queue~0.offset 4)) c_~d~0 (select (select .cse3 c_~queue~0.base) (+ .cse4 c_~queue~0.offset)))) c_~W~0)))) (and (< 0 (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256)) .cse0 (or .cse1 (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (<= 0 c_~front~0)) (or .cse2 (<= c_~d~0 0)) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (or .cse2 (<= c_~front~0 c_~back~0)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2)))) (or .cse1 .cse0 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= c_~n~0 c_~back~0)))) is different from false [2022-01-28 13:38:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:55,209 INFO L93 Difference]: Finished difference Result 42690 states and 129146 transitions. [2022-01-28 13:38:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-01-28 13:38:55,210 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.3944954128440368) internal successors, (370), 109 states have internal predecessors, (370), 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 148 [2022-01-28 13:38:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:55,316 INFO L225 Difference]: With dead ends: 42690 [2022-01-28 13:38:55,316 INFO L226 Difference]: Without dead ends: 39594 [2022-01-28 13:38:55,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 301 SyntacticMatches, 64 SemanticMatches, 309 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 37033 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=11730, Invalid=78570, Unknown=40, NotChecked=6070, Total=96410 [2022-01-28 13:38:55,321 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 7482 mSDsluCounter, 26013 mSDsCounter, 0 mSdLazyCounter, 9821 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7482 SdHoareTripleChecker+Valid, 22500 SdHoareTripleChecker+Invalid, 24734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 9821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14448 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:55,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7482 Valid, 22500 Invalid, 24734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [465 Valid, 9821 Invalid, 0 Unknown, 14448 Unchecked, 4.9s Time] [2022-01-28 13:38:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39594 states. [2022-01-28 13:38:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39594 to 9504. [2022-01-28 13:38:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9504 states, 9503 states have (on average 2.9783226349573817) internal successors, (28303), 9503 states have internal predecessors, (28303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9504 states to 9504 states and 28303 transitions. [2022-01-28 13:38:55,752 INFO L78 Accepts]: Start accepts. Automaton has 9504 states and 28303 transitions. Word has length 148 [2022-01-28 13:38:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:55,754 INFO L470 AbstractCegarLoop]: Abstraction has 9504 states and 28303 transitions. [2022-01-28 13:38:55,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.3944954128440368) internal successors, (370), 109 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 9504 states and 28303 transitions. [2022-01-28 13:38:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:38:55,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:55,772 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:38:55,796 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-01-28 13:38:55,995 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,SelfDestructingSolverStorable11 [2022-01-28 13:38:55,995 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-28 13:38:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:55,995 INFO L85 PathProgramCache]: Analyzing trace with hash 667664069, now seen corresponding path program 8 times [2022-01-28 13:38:55,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49261721] [2022-01-28 13:38:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:55,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:57,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:57,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49261721] [2022-01-28 13:38:57,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49261721] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933201230] [2022-01-28 13:38:57,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:38:57,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:57,419 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-01-28 13:38:57,420 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-01-28 13:38:57,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:38:57,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:57,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-28 13:38:57,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:57,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:38:57,587 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-28 13:38:57,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-28 13:38:57,635 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-28 13:38:57,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-28 13:38:58,475 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-28 13:38:58,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:38:59,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-28 13:38:59,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:39:00,716 INFO L388 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 29 treesize of output 29 [2022-01-28 13:39:01,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:39:01,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-01-28 13:39:01,207 INFO L354 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-28 13:39:01,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-01-28 13:39:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:01,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:01,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (<= (+ |c_thread2Thread1of1ForFork2_~temp~0#1| c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_388) c_~queue~0.base) (+ (* c_~front~0 4) c_~queue~0.offset))) c_~W~0)) is different from false [2022-01-28 13:39:01,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select |c_#memory_int| c_~queue~0.base) (+ .cse0 c_~queue~0.offset)) c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_388) c_~queue~0.base) (+ .cse0 c_~queue~0.offset 4)))) c_~W~0)) is different from false [2022-01-28 13:39:01,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_387)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ .cse1 c_~queue~0.offset)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_388) c_~queue~0.base) (+ .cse1 c_~queue~0.offset 4)))) c_~W~0)) is different from false [2022-01-28 13:39:03,857 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:03,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-01-28 13:39:03,904 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:39:03,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15286 treesize of output 13722 [2022-01-28 13:39:03,974 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:39:03,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13670 treesize of output 12494 [2022-01-28 13:39:04,018 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:39:04,019 INFO L388 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 12406 treesize of output 9974 [2022-01-28 13:39:04,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9974 treesize of output 8182 Received shutdown request... [2022-01-28 13:48:44,302 WARN L243 SmtUtils]: Removed 2 from assertion stack [2022-01-28 13:48:44,304 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-28 13:48:44,314 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-28 13:48:44,314 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-01-28 13:48:44,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-28 13:48:44,504 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,SelfDestructingSolverStorable12 [2022-01-28 13:48:44,505 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 2ms.. [2022-01-28 13:48:44,506 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-28 13:48:44,506 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-28 13:48:44,507 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-28 13:48:44,509 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1] [2022-01-28 13:48:44,511 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 13:48:44,511 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 13:48:44,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 01:48:44 BasicIcfg [2022-01-28 13:48:44,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 13:48:44,513 INFO L158 Benchmark]: Toolchain (without parser) took 785910.62ms. Allocated memory was 179.3MB in the beginning and 891.3MB in the end (delta: 712.0MB). Free memory was 126.6MB in the beginning and 416.0MB in the end (delta: -289.4MB). Peak memory consumption was 682.9MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,513 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 13:48:44,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.77ms. Allocated memory was 179.3MB in the beginning and 217.1MB in the end (delta: 37.7MB). Free memory was 126.4MB in the beginning and 191.2MB in the end (delta: -64.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.64ms. Allocated memory is still 217.1MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,514 INFO L158 Benchmark]: Boogie Preprocessor took 36.84ms. Allocated memory is still 217.1MB. Free memory was 189.1MB in the beginning and 187.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,514 INFO L158 Benchmark]: RCFGBuilder took 492.65ms. Allocated memory is still 217.1MB. Free memory was 187.5MB in the beginning and 168.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,515 INFO L158 Benchmark]: TraceAbstraction took 784965.71ms. Allocated memory was 217.1MB in the beginning and 891.3MB in the end (delta: 674.2MB). Free memory was 168.1MB in the beginning and 416.0MB in the end (delta: -247.9MB). Peak memory consumption was 685.6MB. Max. memory is 8.0GB. [2022-01-28 13:48:44,520 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.13ms. Allocated memory is still 179.3MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 351.77ms. Allocated memory was 179.3MB in the beginning and 217.1MB in the end (delta: 37.7MB). Free memory was 126.4MB in the beginning and 191.2MB in the end (delta: -64.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.64ms. Allocated memory is still 217.1MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.84ms. Allocated memory is still 217.1MB. Free memory was 189.1MB in the beginning and 187.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 492.65ms. Allocated memory is still 217.1MB. Free memory was 187.5MB in the beginning and 168.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 784965.71ms. Allocated memory was 217.1MB in the beginning and 891.3MB in the end (delta: 674.2MB). Free memory was 168.1MB in the beginning and 416.0MB in the end (delta: -247.9MB). Peak memory consumption was 685.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 2ms.. - TimeoutResultAtElement [Line: 110]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 2ms.. - TimeoutResultAtElement [Line: 109]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 2ms.. - TimeoutResultAtElement [Line: 108]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 2ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 784.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.2s, AutomataDifference: 134.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34802 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34802 mSDsluCounter, 82196 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37124 IncrementalHoareTripleChecker+Unchecked, 92695 mSDsCounter, 2334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36767 IncrementalHoareTripleChecker+Invalid, 76225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2334 mSolverCounterUnsat, 2731 mSDtfsCounter, 36767 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3525 GetRequests, 2030 SyntacticMatches, 211 SemanticMatches, 1284 ConstructedPredicates, 21 IntricatePredicates, 4 DeprecatedPredicates, 123837 ImplicationChecksByTransitivity, 123.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9504occurred in iteration=12, InterpolantAutomatonStates: 908, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 116527 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2631 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3687 ConstructedInterpolants, 254 QuantifiedInterpolants, 55442 SizeOfPredicates, 202 NumberOfNonLiveVariables, 2636 ConjunctsInSsa, 341 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 77/273 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