/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 --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:16:01,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:16:01,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:16:01,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:16:01,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:16:01,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:16:01,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:16:01,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:16:01,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:16:01,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:16:01,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:16:01,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:16:01,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:16:01,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:16:01,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:16:01,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:16:01,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:16:01,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:16:01,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:16:01,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:16:01,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:16:01,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:16:01,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:16:01,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:16:01,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:16:01,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:16:01,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:16:01,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:16:01,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:16:01,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:16:01,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:16:01,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:16:01,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:16:01,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:16:01,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:16:01,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:16:01,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:16:01,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:16:01,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:16:01,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:16:01,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:16:01,535 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-09-16 10:16:01,556 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:16:01,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:16:01,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:16:01,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:16:01,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:16:01,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:16:01,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:16:01,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:16:01,558 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:16:01,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:16:01,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:16:01,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:16:01,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:01,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:16:01,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:16:01,561 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 10:16:01,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:16:01,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:16:01,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:16:01,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:16:01,769 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:16:01,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-09-16 10:16:01,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e387df2c6/d459173afcae49c29ce77ec30e2ac3ba/FLAG560914c82 [2022-09-16 10:16:02,272 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:16:02,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-09-16 10:16:02,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e387df2c6/d459173afcae49c29ce77ec30e2ac3ba/FLAG560914c82 [2022-09-16 10:16:02,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e387df2c6/d459173afcae49c29ce77ec30e2ac3ba [2022-09-16 10:16:02,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:16:02,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:16:02,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:02,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:16:02,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:16:02,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e700426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02, skipping insertion in model container [2022-09-16 10:16:02,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:16:02,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:16:02,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-09-16 10:16:02,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-09-16 10:16:02,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-09-16 10:16:02,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:02,762 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:16:02,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-09-16 10:16:02,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-09-16 10:16:02,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-09-16 10:16:02,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:16:02,823 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:16:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02 WrapperNode [2022-09-16 10:16:02,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:16:02,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:02,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:16:02,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:16:02,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,867 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2022-09-16 10:16:02,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:16:02,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:16:02,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:16:02,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:16:02,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:16:02,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:16:02,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:16:02,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:16:02,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (1/1) ... [2022-09-16 10:16:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:16:02,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:02,918 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-09-16 10:16:02,922 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-09-16 10:16:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 10:16:02,948 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 10:16:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:16:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:16:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:16:02,951 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 10:16:03,084 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:16:03,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:16:03,461 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:16:03,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:16:03,468 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 10:16:03,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:03 BoogieIcfgContainer [2022-09-16 10:16:03,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:16:03,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:16:03,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:16:03,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:16:03,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:16:02" (1/3) ... [2022-09-16 10:16:03,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3efa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:03, skipping insertion in model container [2022-09-16 10:16:03,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:16:02" (2/3) ... [2022-09-16 10:16:03,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3efa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:16:03, skipping insertion in model container [2022-09-16 10:16:03,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:16:03" (3/3) ... [2022-09-16 10:16:03,480 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-09-16 10:16:03,485 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:16:03,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:16:03,493 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-09-16 10:16:03,493 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:16:03,586 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 10:16:03,621 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 299 places, 307 transitions, 630 flow [2022-09-16 10:16:04,569 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36624 states, 36534 states have (on average 2.8423660152187002) internal successors, (103843), 36623 states have internal predecessors, (103843), 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-09-16 10:16:04,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:16:04,604 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f05829f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:16:04,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-09-16 10:16:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 36624 states, 36534 states have (on average 2.8423660152187002) internal successors, (103843), 36623 states have internal predecessors, (103843), 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-09-16 10:16:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-09-16 10:16:04,696 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:04,697 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:04,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 454497233, now seen corresponding path program 1 times [2022-09-16 10:16:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185998907] [2022-09-16 10:16:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:04,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185998907] [2022-09-16 10:16:05,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185998907] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:05,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:05,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 10:16:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746860745] [2022-09-16 10:16:05,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:05,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:16:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:16:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:16:05,198 INFO L87 Difference]: Start difference. First operand has 36624 states, 36534 states have (on average 2.8423660152187002) internal successors, (103843), 36623 states have internal predecessors, (103843), 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 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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-09-16 10:16:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:05,955 INFO L93 Difference]: Finished difference Result 35821 states and 100051 transitions. [2022-09-16 10:16:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:16:05,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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 78 [2022-09-16 10:16:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:06,231 INFO L225 Difference]: With dead ends: 35821 [2022-09-16 10:16:06,232 INFO L226 Difference]: Without dead ends: 35740 [2022-09-16 10:16:06,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:16:06,236 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 570 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:06,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1765 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:16:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35740 states. [2022-09-16 10:16:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35740 to 35740. [2022-09-16 10:16:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35740 states, 35632 states have (on average 2.801498652896273) internal successors, (99823), 35739 states have internal predecessors, (99823), 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-09-16 10:16:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35740 states to 35740 states and 99823 transitions. [2022-09-16 10:16:07,605 INFO L78 Accepts]: Start accepts. Automaton has 35740 states and 99823 transitions. Word has length 78 [2022-09-16 10:16:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:07,605 INFO L495 AbstractCegarLoop]: Abstraction has 35740 states and 99823 transitions. [2022-09-16 10:16:07,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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-09-16 10:16:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35740 states and 99823 transitions. [2022-09-16 10:16:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-09-16 10:16:07,611 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:07,611 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:07,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:16:07,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1481397607, now seen corresponding path program 1 times [2022-09-16 10:16:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:07,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841134655] [2022-09-16 10:16:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841134655] [2022-09-16 10:16:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841134655] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:07,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638194902] [2022-09-16 10:16:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:07,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:07,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:07,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:07,733 INFO L87 Difference]: Start difference. First operand 35740 states and 99823 transitions. Second operand has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 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-09-16 10:16:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:08,297 INFO L93 Difference]: Finished difference Result 66382 states and 186173 transitions. [2022-09-16 10:16:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2022-09-16 10:16:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:08,707 INFO L225 Difference]: With dead ends: 66382 [2022-09-16 10:16:08,707 INFO L226 Difference]: Without dead ends: 66382 [2022-09-16 10:16:08,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:08,709 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 489 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:08,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1388 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66382 states. [2022-09-16 10:16:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66382 to 61612. [2022-09-16 10:16:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61612 states, 61504 states have (on average 2.8545948231009364) internal successors, (175569), 61611 states have internal predecessors, (175569), 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-09-16 10:16:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61612 states to 61612 states and 175569 transitions. [2022-09-16 10:16:10,546 INFO L78 Accepts]: Start accepts. Automaton has 61612 states and 175569 transitions. Word has length 79 [2022-09-16 10:16:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:10,547 INFO L495 AbstractCegarLoop]: Abstraction has 61612 states and 175569 transitions. [2022-09-16 10:16:10,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 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-09-16 10:16:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 61612 states and 175569 transitions. [2022-09-16 10:16:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-09-16 10:16:10,550 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:10,550 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:10,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 10:16:10,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1906593081, now seen corresponding path program 1 times [2022-09-16 10:16:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:10,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546127003] [2022-09-16 10:16:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:17,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546127003] [2022-09-16 10:16:17,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546127003] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:17,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:17,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:16:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846378073] [2022-09-16 10:16:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:17,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:16:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:16:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:16:17,010 INFO L87 Difference]: Start difference. First operand 61612 states and 175569 transitions. Second operand has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 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-09-16 10:16:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:21,328 INFO L93 Difference]: Finished difference Result 64320 states and 183235 transitions. [2022-09-16 10:16:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:21,329 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 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 83 [2022-09-16 10:16:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:21,542 INFO L225 Difference]: With dead ends: 64320 [2022-09-16 10:16:21,542 INFO L226 Difference]: Without dead ends: 64320 [2022-09-16 10:16:21,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 10:16:21,544 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 671 mSDsluCounter, 3775 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:21,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 4177 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-09-16 10:16:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64320 states. [2022-09-16 10:16:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64320 to 62961. [2022-09-16 10:16:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62961 states, 62853 states have (on average 2.8541517509108556) internal successors, (179392), 62960 states have internal predecessors, (179392), 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-09-16 10:16:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62961 states to 62961 states and 179392 transitions. [2022-09-16 10:16:23,093 INFO L78 Accepts]: Start accepts. Automaton has 62961 states and 179392 transitions. Word has length 83 [2022-09-16 10:16:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 62961 states and 179392 transitions. [2022-09-16 10:16:23,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 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-09-16 10:16:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62961 states and 179392 transitions. [2022-09-16 10:16:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-09-16 10:16:23,097 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:23,097 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 10:16:23,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -547193272, now seen corresponding path program 1 times [2022-09-16 10:16:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876617338] [2022-09-16 10:16:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:23,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876617338] [2022-09-16 10:16:23,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876617338] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:23,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:23,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:16:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683272777] [2022-09-16 10:16:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:23,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:16:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:16:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:16:23,645 INFO L87 Difference]: Start difference. First operand 62961 states and 179392 transitions. Second operand has 20 states, 19 states have (on average 4.631578947368421) internal successors, (88), 20 states have internal predecessors, (88), 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-09-16 10:16:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:25,299 INFO L93 Difference]: Finished difference Result 70707 states and 201119 transitions. [2022-09-16 10:16:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 10:16:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.631578947368421) internal successors, (88), 20 states have internal predecessors, (88), 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 88 [2022-09-16 10:16:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:26,026 INFO L225 Difference]: With dead ends: 70707 [2022-09-16 10:16:26,026 INFO L226 Difference]: Without dead ends: 70707 [2022-09-16 10:16:26,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2022-09-16 10:16:26,027 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2637 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:26,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2637 Valid, 4055 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:16:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70707 states. [2022-09-16 10:16:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70707 to 65160. [2022-09-16 10:16:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65160 states, 65052 states have (on average 2.8508731476357374) internal successors, (185455), 65159 states have internal predecessors, (185455), 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-09-16 10:16:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65160 states to 65160 states and 185455 transitions. [2022-09-16 10:16:27,882 INFO L78 Accepts]: Start accepts. Automaton has 65160 states and 185455 transitions. Word has length 88 [2022-09-16 10:16:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:27,883 INFO L495 AbstractCegarLoop]: Abstraction has 65160 states and 185455 transitions. [2022-09-16 10:16:27,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.631578947368421) internal successors, (88), 20 states have internal predecessors, (88), 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-09-16 10:16:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65160 states and 185455 transitions. [2022-09-16 10:16:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 10:16:27,894 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:27,895 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 10:16:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 10:16:27,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 628043758, now seen corresponding path program 1 times [2022-09-16 10:16:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:27,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342548947] [2022-09-16 10:16:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:16:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:27,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342548947] [2022-09-16 10:16:27,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342548947] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:27,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:27,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616564577] [2022-09-16 10:16:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:27,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:27,984 INFO L87 Difference]: Start difference. First operand 65160 states and 185455 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-09-16 10:16:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:28,285 INFO L93 Difference]: Finished difference Result 64537 states and 183724 transitions. [2022-09-16 10:16:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2022-09-16 10:16:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:28,671 INFO L225 Difference]: With dead ends: 64537 [2022-09-16 10:16:28,671 INFO L226 Difference]: Without dead ends: 64537 [2022-09-16 10:16:28,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:28,672 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 491 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:28,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1324 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64537 states. [2022-09-16 10:16:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64537 to 64537. [2022-09-16 10:16:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64537 states, 64443 states have (on average 2.850953555855562) internal successors, (183724), 64536 states have internal predecessors, (183724), 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-09-16 10:16:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64537 states to 64537 states and 183724 transitions. [2022-09-16 10:16:30,419 INFO L78 Accepts]: Start accepts. Automaton has 64537 states and 183724 transitions. Word has length 89 [2022-09-16 10:16:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:30,420 INFO L495 AbstractCegarLoop]: Abstraction has 64537 states and 183724 transitions. [2022-09-16 10:16:30,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-09-16 10:16:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 64537 states and 183724 transitions. [2022-09-16 10:16:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 10:16:30,424 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:30,424 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 10:16:30,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1701251284, now seen corresponding path program 1 times [2022-09-16 10:16:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:30,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799468076] [2022-09-16 10:16:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:30,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799468076] [2022-09-16 10:16:30,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799468076] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:30,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:30,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634918256] [2022-09-16 10:16:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:30,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:16:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:16:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:16:30,468 INFO L87 Difference]: Start difference. First operand 64537 states and 183724 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-09-16 10:16:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:30,651 INFO L93 Difference]: Finished difference Result 42945 states and 120509 transitions. [2022-09-16 10:16:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:16:30,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2022-09-16 10:16:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:30,762 INFO L225 Difference]: With dead ends: 42945 [2022-09-16 10:16:30,762 INFO L226 Difference]: Without dead ends: 42945 [2022-09-16 10:16:30,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:16:30,763 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 164 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:30,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42945 states. [2022-09-16 10:16:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42945 to 41986. [2022-09-16 10:16:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41986 states, 41920 states have (on average 2.8227337786259543) internal successors, (118329), 41985 states have internal predecessors, (118329), 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-09-16 10:16:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41986 states to 41986 states and 118329 transitions. [2022-09-16 10:16:31,779 INFO L78 Accepts]: Start accepts. Automaton has 41986 states and 118329 transitions. Word has length 90 [2022-09-16 10:16:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:31,779 INFO L495 AbstractCegarLoop]: Abstraction has 41986 states and 118329 transitions. [2022-09-16 10:16:31,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-09-16 10:16:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 41986 states and 118329 transitions. [2022-09-16 10:16:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 10:16:31,782 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:31,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:16:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 10:16:31,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2005479111, now seen corresponding path program 1 times [2022-09-16 10:16:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:31,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445589335] [2022-09-16 10:16:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:31,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:31,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445589335] [2022-09-16 10:16:31,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445589335] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:16:31,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019430809] [2022-09-16 10:16:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:31,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:16:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:31,820 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-09-16 10:16:31,835 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-09-16 10:16:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:31,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:16:31,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:16:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:31,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:16:31,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019430809] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:31,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:16:31,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:16:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166358575] [2022-09-16 10:16:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:31,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:16:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:31,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:16:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:16:31,999 INFO L87 Difference]: Start difference. First operand 41986 states and 118329 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09-16 10:16:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:32,513 INFO L93 Difference]: Finished difference Result 44731 states and 124463 transitions. [2022-09-16 10:16:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:16:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 90 [2022-09-16 10:16:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:32,616 INFO L225 Difference]: With dead ends: 44731 [2022-09-16 10:16:32,617 INFO L226 Difference]: Without dead ends: 43624 [2022-09-16 10:16:32,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:16:32,617 INFO L413 NwaCegarLoop]: 888 mSDtfsCounter, 824 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:32,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2530 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:16:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43624 states. [2022-09-16 10:16:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43624 to 25036. [2022-09-16 10:16:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 24982 states have (on average 2.7744776238892004) internal successors, (69312), 25035 states have internal predecessors, (69312), 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-09-16 10:16:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 69312 transitions. [2022-09-16 10:16:33,478 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 69312 transitions. Word has length 90 [2022-09-16 10:16:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 25036 states and 69312 transitions. [2022-09-16 10:16:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-09-16 10:16:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 69312 transitions. [2022-09-16 10:16:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-09-16 10:16:33,481 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:33,482 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:33,500 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-09-16 10:16:33,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:16:33,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -520551856, now seen corresponding path program 1 times [2022-09-16 10:16:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573382334] [2022-09-16 10:16:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:35,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573382334] [2022-09-16 10:16:35,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573382334] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:35,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:35,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946071849] [2022-09-16 10:16:35,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:35,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:35,768 INFO L87 Difference]: Start difference. First operand 25036 states and 69312 transitions. Second operand has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 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-09-16 10:16:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:37,483 INFO L93 Difference]: Finished difference Result 25440 states and 70426 transitions. [2022-09-16 10:16:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:16:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 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 93 [2022-09-16 10:16:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:37,543 INFO L225 Difference]: With dead ends: 25440 [2022-09-16 10:16:37,543 INFO L226 Difference]: Without dead ends: 25440 [2022-09-16 10:16:37,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:16:37,544 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 566 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:37,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 3129 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-09-16 10:16:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25440 states. [2022-09-16 10:16:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25440 to 25233. [2022-09-16 10:16:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25233 states, 25179 states have (on average 2.7744946185313157) internal successors, (69859), 25232 states have internal predecessors, (69859), 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-09-16 10:16:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25233 states to 25233 states and 69859 transitions. [2022-09-16 10:16:38,126 INFO L78 Accepts]: Start accepts. Automaton has 25233 states and 69859 transitions. Word has length 93 [2022-09-16 10:16:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:38,126 INFO L495 AbstractCegarLoop]: Abstraction has 25233 states and 69859 transitions. [2022-09-16 10:16:38,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 states have internal predecessors, (93), 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-09-16 10:16:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25233 states and 69859 transitions. [2022-09-16 10:16:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 10:16:38,130 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:38,130 INFO L195 NwaCegarLoop]: 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] [2022-09-16 10:16:38,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 10:16:38,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2089017199, now seen corresponding path program 1 times [2022-09-16 10:16:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795912561] [2022-09-16 10:16:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:38,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:38,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795912561] [2022-09-16 10:16:38,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795912561] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:38,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:38,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:16:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492686321] [2022-09-16 10:16:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:16:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:16:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:16:38,497 INFO L87 Difference]: Start difference. First operand 25233 states and 69859 transitions. Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 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-09-16 10:16:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:39,402 INFO L93 Difference]: Finished difference Result 25095 states and 69481 transitions. [2022-09-16 10:16:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:16:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 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 98 [2022-09-16 10:16:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:39,450 INFO L225 Difference]: With dead ends: 25095 [2022-09-16 10:16:39,451 INFO L226 Difference]: Without dead ends: 25095 [2022-09-16 10:16:39,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=750, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 10:16:39,451 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1226 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:39,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 1817 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:16:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25095 states. [2022-09-16 10:16:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25095 to 24888. [2022-09-16 10:16:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24888 states, 24836 states have (on average 2.7747624416170074) internal successors, (68914), 24887 states have internal predecessors, (68914), 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-09-16 10:16:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24888 states to 24888 states and 68914 transitions. [2022-09-16 10:16:40,040 INFO L78 Accepts]: Start accepts. Automaton has 24888 states and 68914 transitions. Word has length 98 [2022-09-16 10:16:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:40,041 INFO L495 AbstractCegarLoop]: Abstraction has 24888 states and 68914 transitions. [2022-09-16 10:16:40,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 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-09-16 10:16:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 24888 states and 68914 transitions. [2022-09-16 10:16:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-09-16 10:16:40,063 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:40,064 INFO L195 NwaCegarLoop]: 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-09-16 10:16:40,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:16:40,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1500400150, now seen corresponding path program 1 times [2022-09-16 10:16:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:40,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177582453] [2022-09-16 10:16:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177582453] [2022-09-16 10:16:40,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177582453] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:40,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:40,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111685369] [2022-09-16 10:16:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:40,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:40,093 INFO L87 Difference]: Start difference. First operand 24888 states and 68914 transitions. Second operand has 4 states, 3 states have (on average 41.0) internal successors, (123), 4 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-09-16 10:16:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:40,237 INFO L93 Difference]: Finished difference Result 30458 states and 84177 transitions. [2022-09-16 10:16:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 41.0) internal successors, (123), 4 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-09-16 10:16:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:40,306 INFO L225 Difference]: With dead ends: 30458 [2022-09-16 10:16:40,306 INFO L226 Difference]: Without dead ends: 30458 [2022-09-16 10:16:40,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:40,307 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 274 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:40,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 919 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30458 states. [2022-09-16 10:16:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30458 to 29514. [2022-09-16 10:16:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29514 states, 29462 states have (on average 2.779478650465006) internal successors, (81889), 29513 states have internal predecessors, (81889), 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-09-16 10:16:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29514 states to 29514 states and 81889 transitions. [2022-09-16 10:16:40,910 INFO L78 Accepts]: Start accepts. Automaton has 29514 states and 81889 transitions. Word has length 123 [2022-09-16 10:16:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:40,910 INFO L495 AbstractCegarLoop]: Abstraction has 29514 states and 81889 transitions. [2022-09-16 10:16:40,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.0) internal successors, (123), 4 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-09-16 10:16:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29514 states and 81889 transitions. [2022-09-16 10:16:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-09-16 10:16:40,918 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:40,919 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 10:16:40,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 10:16:40,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1793340255, now seen corresponding path program 1 times [2022-09-16 10:16:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:40,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287759768] [2022-09-16 10:16:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:16:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:40,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287759768] [2022-09-16 10:16:40,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287759768] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:40,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:40,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:16:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638692274] [2022-09-16 10:16:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:40,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:16:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:16:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:16:40,962 INFO L87 Difference]: Start difference. First operand 29514 states and 81889 transitions. Second operand has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 4 states have internal predecessors, (133), 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-09-16 10:16:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:41,244 INFO L93 Difference]: Finished difference Result 28858 states and 80079 transitions. [2022-09-16 10:16:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:16:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 4 states have internal predecessors, (133), 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 133 [2022-09-16 10:16:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:41,306 INFO L225 Difference]: With dead ends: 28858 [2022-09-16 10:16:41,306 INFO L226 Difference]: Without dead ends: 28858 [2022-09-16 10:16:41,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:16:41,307 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 277 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:41,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 861 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28858 states. [2022-09-16 10:16:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28858 to 28858. [2022-09-16 10:16:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28858 states, 28818 states have (on average 2.7787840932750365) internal successors, (80079), 28857 states have internal predecessors, (80079), 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-09-16 10:16:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28858 states to 28858 states and 80079 transitions. [2022-09-16 10:16:41,936 INFO L78 Accepts]: Start accepts. Automaton has 28858 states and 80079 transitions. Word has length 133 [2022-09-16 10:16:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:41,936 INFO L495 AbstractCegarLoop]: Abstraction has 28858 states and 80079 transitions. [2022-09-16 10:16:41,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 4 states have internal predecessors, (133), 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-09-16 10:16:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28858 states and 80079 transitions. [2022-09-16 10:16:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-09-16 10:16:41,945 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:41,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:16:41,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 10:16:41,946 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash -241026140, now seen corresponding path program 1 times [2022-09-16 10:16:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:41,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867450033] [2022-09-16 10:16:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:42,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867450033] [2022-09-16 10:16:42,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867450033] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:16:42,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087000848] [2022-09-16 10:16:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:16:42,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:42,006 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-09-16 10:16:42,011 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-09-16 10:16:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:42,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:16:42,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:16:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:42,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:16:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087000848] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:42,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:16:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:16:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644052733] [2022-09-16 10:16:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:42,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:16:42,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:42,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:16:42,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:16:42,148 INFO L87 Difference]: Start difference. First operand 28858 states and 80079 transitions. Second operand has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 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-09-16 10:16:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:42,300 INFO L93 Difference]: Finished difference Result 29146 states and 80557 transitions. [2022-09-16 10:16:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:16:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 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-09-16 10:16:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:42,364 INFO L225 Difference]: With dead ends: 29146 [2022-09-16 10:16:42,365 INFO L226 Difference]: Without dead ends: 29146 [2022-09-16 10:16:42,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:16:42,365 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 484 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:42,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1763 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:16:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29146 states. [2022-09-16 10:16:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29146 to 23576. [2022-09-16 10:16:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23576 states, 23548 states have (on average 2.7728044844572786) internal successors, (65294), 23575 states have internal predecessors, (65294), 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-09-16 10:16:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23576 states to 23576 states and 65294 transitions. [2022-09-16 10:16:43,008 INFO L78 Accepts]: Start accepts. Automaton has 23576 states and 65294 transitions. Word has length 134 [2022-09-16 10:16:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:43,008 INFO L495 AbstractCegarLoop]: Abstraction has 23576 states and 65294 transitions. [2022-09-16 10:16:43,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 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-09-16 10:16:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23576 states and 65294 transitions. [2022-09-16 10:16:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-09-16 10:16:43,017 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:43,017 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-09-16 10:16:43,037 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-09-16 10:16:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-09-16 10:16:43,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 127294419, now seen corresponding path program 1 times [2022-09-16 10:16:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:43,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346680589] [2022-09-16 10:16:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346680589] [2022-09-16 10:16:43,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346680589] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:43,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:43,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:16:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577003737] [2022-09-16 10:16:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:43,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 10:16:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 10:16:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-09-16 10:16:43,523 INFO L87 Difference]: Start difference. First operand 23576 states and 65294 transitions. Second operand has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 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-09-16 10:16:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:44,250 INFO L93 Difference]: Finished difference Result 23704 states and 65647 transitions. [2022-09-16 10:16:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 10:16:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 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 135 [2022-09-16 10:16:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:44,293 INFO L225 Difference]: With dead ends: 23704 [2022-09-16 10:16:44,293 INFO L226 Difference]: Without dead ends: 23704 [2022-09-16 10:16:44,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:16:44,293 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 978 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:44,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1772 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:16:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23704 states. [2022-09-16 10:16:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23704 to 23635. [2022-09-16 10:16:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23635 states, 23607 states have (on average 2.772821620705723) internal successors, (65458), 23634 states have internal predecessors, (65458), 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-09-16 10:16:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23635 states to 23635 states and 65458 transitions. [2022-09-16 10:16:44,770 INFO L78 Accepts]: Start accepts. Automaton has 23635 states and 65458 transitions. Word has length 135 [2022-09-16 10:16:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:44,770 INFO L495 AbstractCegarLoop]: Abstraction has 23635 states and 65458 transitions. [2022-09-16 10:16:44,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 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-09-16 10:16:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 23635 states and 65458 transitions. [2022-09-16 10:16:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-09-16 10:16:44,779 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:44,779 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-16 10:16:44,779 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1225713452, now seen corresponding path program 1 times [2022-09-16 10:16:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487771752] [2022-09-16 10:16:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:47,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487771752] [2022-09-16 10:16:47,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487771752] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:47,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:47,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-16 10:16:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023771541] [2022-09-16 10:16:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:47,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-09-16 10:16:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-09-16 10:16:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:16:47,779 INFO L87 Difference]: Start difference. First operand 23635 states and 65458 transitions. Second operand has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 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-09-16 10:16:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:49,215 INFO L93 Difference]: Finished difference Result 24394 states and 67537 transitions. [2022-09-16 10:16:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 10:16:49,215 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 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 140 [2022-09-16 10:16:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:49,258 INFO L225 Difference]: With dead ends: 24394 [2022-09-16 10:16:49,259 INFO L226 Difference]: Without dead ends: 24394 [2022-09-16 10:16:49,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2022-09-16 10:16:49,259 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 950 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:49,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 2727 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 10:16:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24394 states. [2022-09-16 10:16:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24394 to 23842. [2022-09-16 10:16:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23842 states, 23814 states have (on average 2.7725287645922565) internal successors, (66025), 23841 states have internal predecessors, (66025), 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-09-16 10:16:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23842 states to 23842 states and 66025 transitions. [2022-09-16 10:16:49,731 INFO L78 Accepts]: Start accepts. Automaton has 23842 states and 66025 transitions. Word has length 140 [2022-09-16 10:16:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:49,731 INFO L495 AbstractCegarLoop]: Abstraction has 23842 states and 66025 transitions. [2022-09-16 10:16:49,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 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-09-16 10:16:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23842 states and 66025 transitions. [2022-09-16 10:16:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-09-16 10:16:49,741 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:49,741 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:49,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 10:16:49,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1043131918, now seen corresponding path program 2 times [2022-09-16 10:16:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:49,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360092831] [2022-09-16 10:16:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360092831] [2022-09-16 10:16:50,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360092831] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:50,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:50,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:16:50,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455303229] [2022-09-16 10:16:50,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:50,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:16:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:16:50,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:16:50,082 INFO L87 Difference]: Start difference. First operand 23842 states and 66025 transitions. Second operand has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 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-09-16 10:16:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:50,783 INFO L93 Difference]: Finished difference Result 23704 states and 65578 transitions. [2022-09-16 10:16:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:16:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 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 140 [2022-09-16 10:16:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:50,830 INFO L225 Difference]: With dead ends: 23704 [2022-09-16 10:16:50,830 INFO L226 Difference]: Without dead ends: 23704 [2022-09-16 10:16:50,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:16:50,833 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1312 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:50,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 1718 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:16:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23704 states. [2022-09-16 10:16:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23704 to 23428. [2022-09-16 10:16:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23428 states, 23400 states have (on average 2.77017094017094) internal successors, (64822), 23427 states have internal predecessors, (64822), 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-09-16 10:16:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23428 states to 23428 states and 64822 transitions. [2022-09-16 10:16:51,365 INFO L78 Accepts]: Start accepts. Automaton has 23428 states and 64822 transitions. Word has length 140 [2022-09-16 10:16:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:51,365 INFO L495 AbstractCegarLoop]: Abstraction has 23428 states and 64822 transitions. [2022-09-16 10:16:51,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 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-09-16 10:16:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23428 states and 64822 transitions. [2022-09-16 10:16:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-09-16 10:16:51,373 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:51,373 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:51,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-16 10:16:51,373 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash 21270236, now seen corresponding path program 1 times [2022-09-16 10:16:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:51,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930764294] [2022-09-16 10:16:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930764294] [2022-09-16 10:16:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930764294] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:52,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-09-16 10:16:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857361664] [2022-09-16 10:16:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-09-16 10:16:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-09-16 10:16:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:16:52,250 INFO L87 Difference]: Start difference. First operand 23428 states and 64822 transitions. Second operand has 31 states, 30 states have (on average 4.7) internal successors, (141), 31 states have internal predecessors, (141), 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-09-16 10:16:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:54,666 INFO L93 Difference]: Finished difference Result 24320 states and 67269 transitions. [2022-09-16 10:16:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 10:16:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.7) internal successors, (141), 31 states have internal predecessors, (141), 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-09-16 10:16:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:54,709 INFO L225 Difference]: With dead ends: 24320 [2022-09-16 10:16:54,709 INFO L226 Difference]: Without dead ends: 24320 [2022-09-16 10:16:54,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=761, Invalid=3399, Unknown=0, NotChecked=0, Total=4160 [2022-09-16 10:16:54,710 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 2492 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2492 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:54,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2492 Valid, 5005 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:16:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24320 states. [2022-09-16 10:16:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24320 to 23561. [2022-09-16 10:16:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23561 states, 23533 states have (on average 2.7701525517358605) internal successors, (65190), 23560 states have internal predecessors, (65190), 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-09-16 10:16:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23561 states to 23561 states and 65190 transitions. [2022-09-16 10:16:55,098 INFO L78 Accepts]: Start accepts. Automaton has 23561 states and 65190 transitions. Word has length 141 [2022-09-16 10:16:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:55,099 INFO L495 AbstractCegarLoop]: Abstraction has 23561 states and 65190 transitions. [2022-09-16 10:16:55,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.7) internal successors, (141), 31 states have internal predecessors, (141), 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-09-16 10:16:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 65190 transitions. [2022-09-16 10:16:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-09-16 10:16:55,107 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:55,107 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:55,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-16 10:16:55,107 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 659378135, now seen corresponding path program 1 times [2022-09-16 10:16:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:55,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271501421] [2022-09-16 10:16:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271501421] [2022-09-16 10:16:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271501421] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:16:55,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:16:55,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-16 10:16:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699310536] [2022-09-16 10:16:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:16:55,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 10:16:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 10:16:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-09-16 10:16:55,506 INFO L87 Difference]: Start difference. First operand 23561 states and 65190 transitions. Second operand has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 23 states have internal predecessors, (142), 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-09-16 10:16:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:58,206 INFO L93 Difference]: Finished difference Result 71058 states and 198673 transitions. [2022-09-16 10:16:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 10:16:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 23 states have internal predecessors, (142), 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 142 [2022-09-16 10:16:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:58,365 INFO L225 Difference]: With dead ends: 71058 [2022-09-16 10:16:58,365 INFO L226 Difference]: Without dead ends: 71058 [2022-09-16 10:16:58,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=945, Invalid=2595, Unknown=0, NotChecked=0, Total=3540 [2022-09-16 10:16:58,367 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 5688 mSDsluCounter, 8789 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5688 SdHoareTripleChecker+Valid, 9619 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:58,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5688 Valid, 9619 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-09-16 10:16:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71058 states. [2022-09-16 10:16:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71058 to 42184. [2022-09-16 10:16:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42184 states, 42156 states have (on average 2.816419963943448) internal successors, (118729), 42183 states have internal predecessors, (118729), 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-09-16 10:16:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42184 states to 42184 states and 118729 transitions. [2022-09-16 10:16:59,530 INFO L78 Accepts]: Start accepts. Automaton has 42184 states and 118729 transitions. Word has length 142 [2022-09-16 10:16:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:59,530 INFO L495 AbstractCegarLoop]: Abstraction has 42184 states and 118729 transitions. [2022-09-16 10:16:59,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 23 states have internal predecessors, (142), 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-09-16 10:16:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 42184 states and 118729 transitions. [2022-09-16 10:16:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-09-16 10:16:59,546 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:59,546 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:16:59,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-16 10:16:59,546 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1942210333, now seen corresponding path program 1 times [2022-09-16 10:16:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279002355] [2022-09-16 10:16:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:00,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279002355] [2022-09-16 10:17:00,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279002355] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:00,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:00,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-09-16 10:17:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975273762] [2022-09-16 10:17:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:00,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-16 10:17:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-16 10:17:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-09-16 10:17:00,712 INFO L87 Difference]: Start difference. First operand 42184 states and 118729 transitions. Second operand has 34 states, 33 states have (on average 4.424242424242424) internal successors, (146), 34 states have internal predecessors, (146), 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-09-16 10:17:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:03,393 INFO L93 Difference]: Finished difference Result 45183 states and 127064 transitions. [2022-09-16 10:17:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 10:17:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.424242424242424) internal successors, (146), 34 states have internal predecessors, (146), 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 146 [2022-09-16 10:17:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:03,485 INFO L225 Difference]: With dead ends: 45183 [2022-09-16 10:17:03,485 INFO L226 Difference]: Without dead ends: 45183 [2022-09-16 10:17:03,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=857, Invalid=3699, Unknown=0, NotChecked=0, Total=4556 [2022-09-16 10:17:03,486 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 4213 mSDsluCounter, 5945 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 6455 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:03,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 6455 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:17:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45183 states. [2022-09-16 10:17:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45183 to 44629. [2022-09-16 10:17:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44629 states, 44601 states have (on average 2.814779937669559) internal successors, (125542), 44628 states have internal predecessors, (125542), 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-09-16 10:17:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44629 states to 44629 states and 125542 transitions. [2022-09-16 10:17:04,298 INFO L78 Accepts]: Start accepts. Automaton has 44629 states and 125542 transitions. Word has length 146 [2022-09-16 10:17:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:04,299 INFO L495 AbstractCegarLoop]: Abstraction has 44629 states and 125542 transitions. [2022-09-16 10:17:04,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.424242424242424) internal successors, (146), 34 states have internal predecessors, (146), 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-09-16 10:17:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44629 states and 125542 transitions. [2022-09-16 10:17:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-09-16 10:17:04,312 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:04,312 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-16 10:17:04,312 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1539066072, now seen corresponding path program 1 times [2022-09-16 10:17:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:04,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499098955] [2022-09-16 10:17:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:04,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499098955] [2022-09-16 10:17:04,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499098955] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:04,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:04,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-16 10:17:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890099647] [2022-09-16 10:17:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:04,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 10:17:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 10:17:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-09-16 10:17:04,819 INFO L87 Difference]: Start difference. First operand 44629 states and 125542 transitions. Second operand has 23 states, 22 states have (on average 6.681818181818182) internal successors, (147), 23 states have internal predecessors, (147), 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-09-16 10:17:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:07,461 INFO L93 Difference]: Finished difference Result 73675 states and 206984 transitions. [2022-09-16 10:17:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 10:17:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.681818181818182) internal successors, (147), 23 states have internal predecessors, (147), 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 147 [2022-09-16 10:17:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:07,630 INFO L225 Difference]: With dead ends: 73675 [2022-09-16 10:17:07,631 INFO L226 Difference]: Without dead ends: 73675 [2022-09-16 10:17:07,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=904, Invalid=2518, Unknown=0, NotChecked=0, Total=3422 [2022-09-16 10:17:07,632 INFO L413 NwaCegarLoop]: 842 mSDtfsCounter, 5236 mSDsluCounter, 8187 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 9010 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:07,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 9010 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-09-16 10:17:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73675 states. [2022-09-16 10:17:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73675 to 36078. [2022-09-16 10:17:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36078 states, 36050 states have (on average 2.8104022191400833) internal successors, (101315), 36077 states have internal predecessors, (101315), 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-09-16 10:17:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36078 states to 36078 states and 101315 transitions. [2022-09-16 10:17:08,590 INFO L78 Accepts]: Start accepts. Automaton has 36078 states and 101315 transitions. Word has length 147 [2022-09-16 10:17:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:08,590 INFO L495 AbstractCegarLoop]: Abstraction has 36078 states and 101315 transitions. [2022-09-16 10:17:08,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.681818181818182) internal successors, (147), 23 states have internal predecessors, (147), 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-09-16 10:17:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36078 states and 101315 transitions. [2022-09-16 10:17:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-09-16 10:17:08,599 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:08,599 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:08,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-16 10:17:08,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 701951941, now seen corresponding path program 1 times [2022-09-16 10:17:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847875751] [2022-09-16 10:17:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:09,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847875751] [2022-09-16 10:17:09,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847875751] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:09,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:09,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 10:17:09,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408500254] [2022-09-16 10:17:09,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:09,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 10:17:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 10:17:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:17:09,073 INFO L87 Difference]: Start difference. First operand 36078 states and 101315 transitions. Second operand has 27 states, 26 states have (on average 5.8076923076923075) internal successors, (151), 27 states have internal predecessors, (151), 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-09-16 10:17:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:11,107 INFO L93 Difference]: Finished difference Result 52275 states and 146373 transitions. [2022-09-16 10:17:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 10:17:11,107 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.8076923076923075) internal successors, (151), 27 states have internal predecessors, (151), 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 151 [2022-09-16 10:17:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:11,329 INFO L225 Difference]: With dead ends: 52275 [2022-09-16 10:17:11,329 INFO L226 Difference]: Without dead ends: 52275 [2022-09-16 10:17:11,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=746, Invalid=2794, Unknown=0, NotChecked=0, Total=3540 [2022-09-16 10:17:11,330 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 2867 mSDsluCounter, 5268 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:11,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2867 Valid, 5833 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 10:17:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52275 states. [2022-09-16 10:17:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52275 to 48715. [2022-09-16 10:17:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48715 states, 48687 states have (on average 2.810010885862756) internal successors, (136811), 48714 states have internal predecessors, (136811), 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-09-16 10:17:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48715 states to 48715 states and 136811 transitions. [2022-09-16 10:17:12,201 INFO L78 Accepts]: Start accepts. Automaton has 48715 states and 136811 transitions. Word has length 151 [2022-09-16 10:17:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:12,201 INFO L495 AbstractCegarLoop]: Abstraction has 48715 states and 136811 transitions. [2022-09-16 10:17:12,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.8076923076923075) internal successors, (151), 27 states have internal predecessors, (151), 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-09-16 10:17:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 48715 states and 136811 transitions. [2022-09-16 10:17:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-09-16 10:17:12,215 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:12,215 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:17:12,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-16 10:17:12,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 285674528, now seen corresponding path program 1 times [2022-09-16 10:17:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:12,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75890743] [2022-09-16 10:17:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:12,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:12,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75890743] [2022-09-16 10:17:12,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75890743] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:12,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:12,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-16 10:17:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147465296] [2022-09-16 10:17:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:12,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-16 10:17:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:12,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-16 10:17:12,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-09-16 10:17:12,540 INFO L87 Difference]: Start difference. First operand 48715 states and 136811 transitions. Second operand has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 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-09-16 10:17:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:15,694 INFO L93 Difference]: Finished difference Result 96102 states and 270158 transitions. [2022-09-16 10:17:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 10:17:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 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 152 [2022-09-16 10:17:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:15,927 INFO L225 Difference]: With dead ends: 96102 [2022-09-16 10:17:15,927 INFO L226 Difference]: Without dead ends: 96102 [2022-09-16 10:17:15,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=969, Invalid=2691, Unknown=0, NotChecked=0, Total=3660 [2022-09-16 10:17:15,928 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 5696 mSDsluCounter, 8937 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 9854 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:15,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 9854 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-09-16 10:17:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96102 states. [2022-09-16 10:17:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96102 to 72180. [2022-09-16 10:17:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72180 states, 72152 states have (on average 2.8341418117307904) internal successors, (204489), 72179 states have internal predecessors, (204489), 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-09-16 10:17:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72180 states to 72180 states and 204489 transitions. [2022-09-16 10:17:17,655 INFO L78 Accepts]: Start accepts. Automaton has 72180 states and 204489 transitions. Word has length 152 [2022-09-16 10:17:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:17,655 INFO L495 AbstractCegarLoop]: Abstraction has 72180 states and 204489 transitions. [2022-09-16 10:17:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 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-09-16 10:17:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72180 states and 204489 transitions. [2022-09-16 10:17:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-09-16 10:17:17,677 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:17,677 INFO L195 NwaCegarLoop]: 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, 1, 1, 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-09-16 10:17:17,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-16 10:17:17,677 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1631483194, now seen corresponding path program 1 times [2022-09-16 10:17:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:17,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037748433] [2022-09-16 10:17:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:18,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037748433] [2022-09-16 10:17:18,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037748433] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:18,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-09-16 10:17:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954617995] [2022-09-16 10:17:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-09-16 10:17:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-09-16 10:17:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:18,325 INFO L87 Difference]: Start difference. First operand 72180 states and 204489 transitions. Second operand has 29 states, 28 states have (on average 5.571428571428571) internal successors, (156), 29 states have internal predecessors, (156), 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-09-16 10:17:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:20,953 INFO L93 Difference]: Finished difference Result 91188 states and 258119 transitions. [2022-09-16 10:17:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 10:17:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.571428571428571) internal successors, (156), 29 states have internal predecessors, (156), 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 156 [2022-09-16 10:17:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:21,167 INFO L225 Difference]: With dead ends: 91188 [2022-09-16 10:17:21,167 INFO L226 Difference]: Without dead ends: 91188 [2022-09-16 10:17:21,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=669, Invalid=2523, Unknown=0, NotChecked=0, Total=3192 [2022-09-16 10:17:21,168 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 3581 mSDsluCounter, 6285 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3581 SdHoareTripleChecker+Valid, 6870 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:21,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3581 Valid, 6870 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:17:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91188 states. [2022-09-16 10:17:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91188 to 75470. [2022-09-16 10:17:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75470 states, 75442 states have (on average 2.8397709498687735) internal successors, (214238), 75469 states have internal predecessors, (214238), 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-09-16 10:17:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75470 states to 75470 states and 214238 transitions. [2022-09-16 10:17:23,105 INFO L78 Accepts]: Start accepts. Automaton has 75470 states and 214238 transitions. Word has length 156 [2022-09-16 10:17:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:23,105 INFO L495 AbstractCegarLoop]: Abstraction has 75470 states and 214238 transitions. [2022-09-16 10:17:23,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.571428571428571) internal successors, (156), 29 states have internal predecessors, (156), 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-09-16 10:17:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 75470 states and 214238 transitions. [2022-09-16 10:17:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-09-16 10:17:23,121 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:23,121 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 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-09-16 10:17:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-16 10:17:23,121 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1750925831, now seen corresponding path program 1 times [2022-09-16 10:17:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661336292] [2022-09-16 10:17:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:23,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661336292] [2022-09-16 10:17:23,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661336292] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:23,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:23,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 10:17:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796996842] [2022-09-16 10:17:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 10:17:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:23,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 10:17:23,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:17:23,635 INFO L87 Difference]: Start difference. First operand 75470 states and 214238 transitions. Second operand has 27 states, 26 states have (on average 6.038461538461538) internal successors, (157), 27 states have internal predecessors, (157), 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-09-16 10:17:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:27,750 INFO L93 Difference]: Finished difference Result 96956 states and 273634 transitions. [2022-09-16 10:17:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 10:17:27,751 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 6.038461538461538) internal successors, (157), 27 states have internal predecessors, (157), 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 157 [2022-09-16 10:17:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:27,969 INFO L225 Difference]: With dead ends: 96956 [2022-09-16 10:17:27,969 INFO L226 Difference]: Without dead ends: 96956 [2022-09-16 10:17:27,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1231, Invalid=3191, Unknown=0, NotChecked=0, Total=4422 [2022-09-16 10:17:27,971 INFO L413 NwaCegarLoop]: 866 mSDtfsCounter, 5390 mSDsluCounter, 9657 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5390 SdHoareTripleChecker+Valid, 10500 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:27,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5390 Valid, 10500 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-09-16 10:17:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96956 states. [2022-09-16 10:17:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96956 to 57558. [2022-09-16 10:17:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57558 states, 57530 states have (on average 2.841265426733878) internal successors, (163458), 57557 states have internal predecessors, (163458), 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-09-16 10:17:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57558 states to 57558 states and 163458 transitions. [2022-09-16 10:17:29,375 INFO L78 Accepts]: Start accepts. Automaton has 57558 states and 163458 transitions. Word has length 157 [2022-09-16 10:17:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:29,375 INFO L495 AbstractCegarLoop]: Abstraction has 57558 states and 163458 transitions. [2022-09-16 10:17:29,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 6.038461538461538) internal successors, (157), 27 states have internal predecessors, (157), 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-09-16 10:17:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 57558 states and 163458 transitions. [2022-09-16 10:17:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-09-16 10:17:29,389 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:29,390 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:29,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-16 10:17:29,390 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 626409745, now seen corresponding path program 1 times [2022-09-16 10:17:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564022284] [2022-09-16 10:17:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:29,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:29,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564022284] [2022-09-16 10:17:29,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564022284] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:29,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:29,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:17:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427837132] [2022-09-16 10:17:29,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:29,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:17:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:17:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:17:29,435 INFO L87 Difference]: Start difference. First operand 57558 states and 163458 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09-16 10:17:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:29,494 INFO L93 Difference]: Finished difference Result 16151 states and 44133 transitions. [2022-09-16 10:17:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:17:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 184 [2022-09-16 10:17:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:29,521 INFO L225 Difference]: With dead ends: 16151 [2022-09-16 10:17:29,521 INFO L226 Difference]: Without dead ends: 14279 [2022-09-16 10:17:29,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:17:29,522 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 90 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:29,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 485 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:17:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14279 states. [2022-09-16 10:17:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14279 to 11743. [2022-09-16 10:17:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11743 states, 11735 states have (on average 2.714188325521943) internal successors, (31851), 11742 states have internal predecessors, (31851), 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-09-16 10:17:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11743 states to 11743 states and 31851 transitions. [2022-09-16 10:17:29,907 INFO L78 Accepts]: Start accepts. Automaton has 11743 states and 31851 transitions. Word has length 184 [2022-09-16 10:17:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:29,907 INFO L495 AbstractCegarLoop]: Abstraction has 11743 states and 31851 transitions. [2022-09-16 10:17:29,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09-16 10:17:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11743 states and 31851 transitions. [2022-09-16 10:17:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-09-16 10:17:29,916 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:29,916 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:29,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-09-16 10:17:29,917 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash 260477447, now seen corresponding path program 1 times [2022-09-16 10:17:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:29,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227886157] [2022-09-16 10:17:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:29,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227886157] [2022-09-16 10:17:29,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227886157] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:29,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:29,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:17:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450739580] [2022-09-16 10:17:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:29,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:17:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:29,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:17:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:17:29,943 INFO L87 Difference]: Start difference. First operand 11743 states and 31851 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-09-16 10:17:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:29,980 INFO L93 Difference]: Finished difference Result 9559 states and 24985 transitions. [2022-09-16 10:17:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:17:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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 186 [2022-09-16 10:17:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:29,994 INFO L225 Difference]: With dead ends: 9559 [2022-09-16 10:17:29,994 INFO L226 Difference]: Without dead ends: 9559 [2022-09-16 10:17:29,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:17:29,995 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 178 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:29,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 380 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:17:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2022-09-16 10:17:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 9559. [2022-09-16 10:17:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9559 states, 9543 states have (on average 2.618149428900765) internal successors, (24985), 9558 states have internal predecessors, (24985), 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-09-16 10:17:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9559 states to 9559 states and 24985 transitions. [2022-09-16 10:17:30,122 INFO L78 Accepts]: Start accepts. Automaton has 9559 states and 24985 transitions. Word has length 186 [2022-09-16 10:17:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:30,122 INFO L495 AbstractCegarLoop]: Abstraction has 9559 states and 24985 transitions. [2022-09-16 10:17:30,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-09-16 10:17:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9559 states and 24985 transitions. [2022-09-16 10:17:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-09-16 10:17:30,130 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:30,130 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:30,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-09-16 10:17:30,131 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1676404306, now seen corresponding path program 1 times [2022-09-16 10:17:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:30,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866540447] [2022-09-16 10:17:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:30,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866540447] [2022-09-16 10:17:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866540447] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:30,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:17:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040086149] [2022-09-16 10:17:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:17:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:17:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:17:30,530 INFO L87 Difference]: Start difference. First operand 9559 states and 24985 transitions. Second operand has 18 states, 17 states have (on average 11.0) internal successors, (187), 18 states have internal predecessors, (187), 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-09-16 10:17:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:31,279 INFO L93 Difference]: Finished difference Result 15141 states and 39760 transitions. [2022-09-16 10:17:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:17:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 11.0) internal successors, (187), 18 states have internal predecessors, (187), 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 187 [2022-09-16 10:17:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:31,304 INFO L225 Difference]: With dead ends: 15141 [2022-09-16 10:17:31,304 INFO L226 Difference]: Without dead ends: 15141 [2022-09-16 10:17:31,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=899, Unknown=0, NotChecked=0, Total=1260 [2022-09-16 10:17:31,305 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 2942 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:31,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 2473 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:17:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15141 states. [2022-09-16 10:17:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15141 to 11357. [2022-09-16 10:17:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11357 states, 11341 states have (on average 2.6213737765629133) internal successors, (29729), 11356 states have internal predecessors, (29729), 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-09-16 10:17:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 29729 transitions. [2022-09-16 10:17:31,471 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 29729 transitions. Word has length 187 [2022-09-16 10:17:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:31,472 INFO L495 AbstractCegarLoop]: Abstraction has 11357 states and 29729 transitions. [2022-09-16 10:17:31,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 11.0) internal successors, (187), 18 states have internal predecessors, (187), 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-09-16 10:17:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 29729 transitions. [2022-09-16 10:17:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-09-16 10:17:31,481 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:31,481 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:31,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-09-16 10:17:31,481 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash -10149608, now seen corresponding path program 2 times [2022-09-16 10:17:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:31,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452597296] [2022-09-16 10:17:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:31,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452597296] [2022-09-16 10:17:31,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452597296] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:31,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:31,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:17:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630681911] [2022-09-16 10:17:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:31,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:17:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:31,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:17:31,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:17:31,909 INFO L87 Difference]: Start difference. First operand 11357 states and 29729 transitions. Second operand has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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-09-16 10:17:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:32,648 INFO L93 Difference]: Finished difference Result 11314 states and 29617 transitions. [2022-09-16 10:17:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:17:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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 187 [2022-09-16 10:17:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:32,677 INFO L225 Difference]: With dead ends: 11314 [2022-09-16 10:17:32,677 INFO L226 Difference]: Without dead ends: 11314 [2022-09-16 10:17:32,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=1003, Unknown=0, NotChecked=0, Total=1406 [2022-09-16 10:17:32,679 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 1738 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:32,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 2427 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:17:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11314 states. [2022-09-16 10:17:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11314 to 9516. [2022-09-16 10:17:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9502 states have (on average 2.61765944011787) internal successors, (24873), 9515 states have internal predecessors, (24873), 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-09-16 10:17:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24873 transitions. [2022-09-16 10:17:32,823 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24873 transitions. Word has length 187 [2022-09-16 10:17:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:32,823 INFO L495 AbstractCegarLoop]: Abstraction has 9516 states and 24873 transitions. [2022-09-16 10:17:32,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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-09-16 10:17:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24873 transitions. [2022-09-16 10:17:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-09-16 10:17:32,831 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:32,831 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:32,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-09-16 10:17:32,831 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash -428925048, now seen corresponding path program 1 times [2022-09-16 10:17:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447055908] [2022-09-16 10:17:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:33,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447055908] [2022-09-16 10:17:33,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447055908] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:33,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:33,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 10:17:33,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109620070] [2022-09-16 10:17:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:33,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 10:17:33,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:33,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 10:17:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:17:33,397 INFO L87 Difference]: Start difference. First operand 9516 states and 24873 transitions. Second operand has 27 states, 26 states have (on average 7.230769230769231) internal successors, (188), 27 states have internal predecessors, (188), 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-09-16 10:17:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:36,065 INFO L93 Difference]: Finished difference Result 23554 states and 62075 transitions. [2022-09-16 10:17:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 10:17:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 7.230769230769231) internal successors, (188), 27 states have internal predecessors, (188), 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 188 [2022-09-16 10:17:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:36,104 INFO L225 Difference]: With dead ends: 23554 [2022-09-16 10:17:36,104 INFO L226 Difference]: Without dead ends: 23554 [2022-09-16 10:17:36,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1027, Invalid=3803, Unknown=0, NotChecked=0, Total=4830 [2022-09-16 10:17:36,105 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 4321 mSDsluCounter, 7373 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 7826 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:36,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 7826 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-09-16 10:17:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2022-09-16 10:17:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 16439. [2022-09-16 10:17:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16439 states, 16425 states have (on average 2.655342465753425) internal successors, (43614), 16438 states have internal predecessors, (43614), 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-09-16 10:17:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16439 states to 16439 states and 43614 transitions. [2022-09-16 10:17:36,421 INFO L78 Accepts]: Start accepts. Automaton has 16439 states and 43614 transitions. Word has length 188 [2022-09-16 10:17:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:36,421 INFO L495 AbstractCegarLoop]: Abstraction has 16439 states and 43614 transitions. [2022-09-16 10:17:36,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 7.230769230769231) internal successors, (188), 27 states have internal predecessors, (188), 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-09-16 10:17:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16439 states and 43614 transitions. [2022-09-16 10:17:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-09-16 10:17:36,435 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:36,435 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-09-16 10:17:36,436 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 469148848, now seen corresponding path program 2 times [2022-09-16 10:17:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985989520] [2022-09-16 10:17:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:37,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985989520] [2022-09-16 10:17:37,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985989520] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:37,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:37,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-09-16 10:17:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846677953] [2022-09-16 10:17:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-09-16 10:17:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-09-16 10:17:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:17:37,085 INFO L87 Difference]: Start difference. First operand 16439 states and 43614 transitions. Second operand has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 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-09-16 10:17:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:38,561 INFO L93 Difference]: Finished difference Result 16055 states and 42490 transitions. [2022-09-16 10:17:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:17:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 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 188 [2022-09-16 10:17:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:38,586 INFO L225 Difference]: With dead ends: 16055 [2022-09-16 10:17:38,586 INFO L226 Difference]: Without dead ends: 16055 [2022-09-16 10:17:38,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2022-09-16 10:17:38,587 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 2422 mSDsluCounter, 3791 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 4173 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:38,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2422 Valid, 4173 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 10:17:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16055 states. [2022-09-16 10:17:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16055 to 13779. [2022-09-16 10:17:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13779 states, 13765 states have (on average 2.6512895023610605) internal successors, (36495), 13778 states have internal predecessors, (36495), 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-09-16 10:17:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13779 states to 13779 states and 36495 transitions. [2022-09-16 10:17:38,820 INFO L78 Accepts]: Start accepts. Automaton has 13779 states and 36495 transitions. Word has length 188 [2022-09-16 10:17:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:38,820 INFO L495 AbstractCegarLoop]: Abstraction has 13779 states and 36495 transitions. [2022-09-16 10:17:38,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 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-09-16 10:17:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 13779 states and 36495 transitions. [2022-09-16 10:17:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-09-16 10:17:38,828 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:38,828 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-09-16 10:17:38,829 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1814302689, now seen corresponding path program 1 times [2022-09-16 10:17:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061847498] [2022-09-16 10:17:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:39,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061847498] [2022-09-16 10:17:39,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061847498] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:39,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:39,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-09-16 10:17:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69049539] [2022-09-16 10:17:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:39,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-09-16 10:17:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-09-16 10:17:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-09-16 10:17:39,323 INFO L87 Difference]: Start difference. First operand 13779 states and 36495 transitions. Second operand has 26 states, 25 states have (on average 7.76) internal successors, (194), 26 states have internal predecessors, (194), 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-09-16 10:17:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:42,562 INFO L93 Difference]: Finished difference Result 28819 states and 76024 transitions. [2022-09-16 10:17:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-09-16 10:17:42,566 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.76) internal successors, (194), 26 states have internal predecessors, (194), 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 194 [2022-09-16 10:17:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:42,611 INFO L225 Difference]: With dead ends: 28819 [2022-09-16 10:17:42,611 INFO L226 Difference]: Without dead ends: 28819 [2022-09-16 10:17:42,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1484, Invalid=5488, Unknown=0, NotChecked=0, Total=6972 [2022-09-16 10:17:42,613 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 4186 mSDsluCounter, 7551 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 7955 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:42,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 7955 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-09-16 10:17:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2022-09-16 10:17:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 17115. [2022-09-16 10:17:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17115 states, 17101 states have (on average 2.648675516051693) internal successors, (45295), 17114 states have internal predecessors, (45295), 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-09-16 10:17:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17115 states to 17115 states and 45295 transitions. [2022-09-16 10:17:42,900 INFO L78 Accepts]: Start accepts. Automaton has 17115 states and 45295 transitions. Word has length 194 [2022-09-16 10:17:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:42,900 INFO L495 AbstractCegarLoop]: Abstraction has 17115 states and 45295 transitions. [2022-09-16 10:17:42,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.76) internal successors, (194), 26 states have internal predecessors, (194), 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-09-16 10:17:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 17115 states and 45295 transitions. [2022-09-16 10:17:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-09-16 10:17:42,913 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:42,913 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:42,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-09-16 10:17:42,914 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:42,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 686094151, now seen corresponding path program 2 times [2022-09-16 10:17:42,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:42,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070525785] [2022-09-16 10:17:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:44,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070525785] [2022-09-16 10:17:44,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070525785] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:44,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:44,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-09-16 10:17:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456361318] [2022-09-16 10:17:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:44,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-09-16 10:17:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-09-16 10:17:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2022-09-16 10:17:44,069 INFO L87 Difference]: Start difference. First operand 17115 states and 45295 transitions. Second operand has 38 states, 37 states have (on average 5.243243243243243) internal successors, (194), 38 states have internal predecessors, (194), 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-09-16 10:17:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:48,214 INFO L93 Difference]: Finished difference Result 22849 states and 60559 transitions. [2022-09-16 10:17:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 10:17:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 5.243243243243243) internal successors, (194), 38 states have internal predecessors, (194), 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 194 [2022-09-16 10:17:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:48,254 INFO L225 Difference]: With dead ends: 22849 [2022-09-16 10:17:48,254 INFO L226 Difference]: Without dead ends: 22849 [2022-09-16 10:17:48,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1025, Invalid=4675, Unknown=0, NotChecked=0, Total=5700 [2022-09-16 10:17:48,255 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 4029 mSDsluCounter, 6968 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4029 SdHoareTripleChecker+Valid, 7278 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:48,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4029 Valid, 7278 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-09-16 10:17:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22849 states. [2022-09-16 10:17:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22849 to 14315. [2022-09-16 10:17:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14315 states, 14301 states have (on average 2.6485560450318157) internal successors, (37877), 14314 states have internal predecessors, (37877), 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-09-16 10:17:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 37877 transitions. [2022-09-16 10:17:48,518 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 37877 transitions. Word has length 194 [2022-09-16 10:17:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:48,518 INFO L495 AbstractCegarLoop]: Abstraction has 14315 states and 37877 transitions. [2022-09-16 10:17:48,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 5.243243243243243) internal successors, (194), 38 states have internal predecessors, (194), 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-09-16 10:17:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 37877 transitions. [2022-09-16 10:17:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-09-16 10:17:48,529 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:48,529 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-09-16 10:17:48,529 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -459161792, now seen corresponding path program 1 times [2022-09-16 10:17:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510904268] [2022-09-16 10:17:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:17:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:17:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:17:50,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510904268] [2022-09-16 10:17:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510904268] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:17:50,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:17:50,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-09-16 10:17:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288461997] [2022-09-16 10:17:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:17:50,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-09-16 10:17:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:17:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-09-16 10:17:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2022-09-16 10:17:50,153 INFO L87 Difference]: Start difference. First operand 14315 states and 37877 transitions. Second operand has 36 states, 35 states have (on average 5.8) internal successors, (203), 36 states have internal predecessors, (203), 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-09-16 10:17:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:17:53,625 INFO L93 Difference]: Finished difference Result 16408 states and 43414 transitions. [2022-09-16 10:17:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 10:17:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.8) internal successors, (203), 36 states have internal predecessors, (203), 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 203 [2022-09-16 10:17:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:17:53,652 INFO L225 Difference]: With dead ends: 16408 [2022-09-16 10:17:53,653 INFO L226 Difference]: Without dead ends: 15820 [2022-09-16 10:17:53,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=793, Invalid=3629, Unknown=0, NotChecked=0, Total=4422 [2022-09-16 10:17:53,654 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 3228 mSDsluCounter, 5185 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:17:53,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 5500 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-09-16 10:17:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15820 states. [2022-09-16 10:17:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15820 to 15680. [2022-09-16 10:17:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15680 states, 15666 states have (on average 2.642537980339589) internal successors, (41398), 15679 states have internal predecessors, (41398), 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-09-16 10:17:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15680 states to 15680 states and 41398 transitions. [2022-09-16 10:17:53,880 INFO L78 Accepts]: Start accepts. Automaton has 15680 states and 41398 transitions. Word has length 203 [2022-09-16 10:17:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:17:53,881 INFO L495 AbstractCegarLoop]: Abstraction has 15680 states and 41398 transitions. [2022-09-16 10:17:53,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.8) internal successors, (203), 36 states have internal predecessors, (203), 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-09-16 10:17:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15680 states and 41398 transitions. [2022-09-16 10:17:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-09-16 10:17:53,892 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:17:53,893 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:17:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-09-16 10:17:53,893 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:17:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:17:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1939717640, now seen corresponding path program 1 times [2022-09-16 10:17:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:17:53,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357887940] [2022-09-16 10:17:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:17:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:17:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357887940] [2022-09-16 10:18:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357887940] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:18:08,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:18:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-09-16 10:18:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817522169] [2022-09-16 10:18:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:18:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-09-16 10:18:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-09-16 10:18:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2022-09-16 10:18:08,820 INFO L87 Difference]: Start difference. First operand 15680 states and 41398 transitions. Second operand has 36 states, 36 states have (on average 6.555555555555555) internal successors, (236), 36 states have internal predecessors, (236), 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-09-16 10:18:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:18:14,223 INFO L93 Difference]: Finished difference Result 19678 states and 51987 transitions. [2022-09-16 10:18:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 10:18:14,223 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.555555555555555) internal successors, (236), 36 states have internal predecessors, (236), 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 236 [2022-09-16 10:18:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:18:14,251 INFO L225 Difference]: With dead ends: 19678 [2022-09-16 10:18:14,251 INFO L226 Difference]: Without dead ends: 19678 [2022-09-16 10:18:14,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=663, Invalid=3759, Unknown=0, NotChecked=0, Total=4422 [2022-09-16 10:18:14,252 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 2218 mSDsluCounter, 6059 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 6411 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:18:14,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 6411 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-09-16 10:18:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19678 states. [2022-09-16 10:18:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19678 to 19510. [2022-09-16 10:18:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19510 states, 19496 states have (on average 2.644080837094789) internal successors, (51549), 19509 states have internal predecessors, (51549), 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-09-16 10:18:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 51549 transitions. [2022-09-16 10:18:14,510 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 51549 transitions. Word has length 236 [2022-09-16 10:18:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:18:14,511 INFO L495 AbstractCegarLoop]: Abstraction has 19510 states and 51549 transitions. [2022-09-16 10:18:14,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.555555555555555) internal successors, (236), 36 states have internal predecessors, (236), 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-09-16 10:18:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 51549 transitions. [2022-09-16 10:18:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-09-16 10:18:14,529 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:18:14,529 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:18:14,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-09-16 10:18:14,529 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:18:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:18:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1453568112, now seen corresponding path program 2 times [2022-09-16 10:18:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:18:14,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328926671] [2022-09-16 10:18:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:18:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:15,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328926671] [2022-09-16 10:18:15,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328926671] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:18:15,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91079548] [2022-09-16 10:18:15,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:18:15,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:18:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:18:15,659 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-09-16 10:18:15,659 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-09-16 10:18:15,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:18:15,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:18:15,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 110 conjunts are in the unsatisfiable core [2022-09-16 10:18:15,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:15,978 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:18:15,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:18:16,021 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:18:16,021 INFO L390 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 11 treesize of output 11 [2022-09-16 10:18:16,206 INFO L390 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 13 treesize of output 9 [2022-09-16 10:18:16,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:18:16,498 INFO L390 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 16 treesize of output 18 [2022-09-16 10:18:16,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:16,777 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-09-16 10:18:16,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-16 10:18:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:16,835 INFO L390 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 23 treesize of output 22 [2022-09-16 10:18:17,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-09-16 10:18:17,075 INFO L390 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 16 treesize of output 18 [2022-09-16 10:18:17,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:17,161 INFO L390 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 16 treesize of output 18 [2022-09-16 10:18:17,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:17,505 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-09-16 10:18:17,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-16 10:18:17,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:17,595 INFO L390 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 23 treesize of output 22 [2022-09-16 10:18:17,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:17,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:18:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:17,906 INFO L390 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 25 treesize of output 25 [2022-09-16 10:18:18,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:18,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:18,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:18:18,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:18,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-09-16 10:18:18,630 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:18:18,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 10:18:18,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:18,676 INFO L390 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 28 treesize of output 10 [2022-09-16 10:18:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:18,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:56,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_1324)) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:23:48,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:23:48,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1319 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 10:23:48,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1319) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-09-16 10:23:48,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-09-16 10:23:48,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (not (<= v_ArrVal_1317 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-09-16 10:23:48,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< 2147483647 v_ArrVal_1317))))) is different from false [2022-09-16 10:23:48,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (< 2147483647 v_ArrVal_1317))))) is different from false [2022-09-16 10:23:48,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< 2147483647 v_ArrVal_1317))))))) is different from false [2022-09-16 10:23:48,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1316)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1319) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-09-16 10:23:48,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_1319) (< 2147483647 v_ArrVal_1317)))))) is different from false [2022-09-16 10:23:49,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1319) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))))))))) is different from false [2022-09-16 10:23:49,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1319) (< (select .cse2 .cse4) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse2 .cse4 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse4) 2147483647) (< 2147483647 v_ArrVal_1317))))))) is different from false [2022-09-16 10:23:49,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= v_ArrVal_1311 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse3))) (< 2147483647 v_ArrVal_1317))))))) is different from false [2022-09-16 10:23:49,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1311) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse3))) (< 2147483647 v_ArrVal_1317))))))) is different from false [2022-09-16 10:23:49,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1311) (< 2147483647 v_ArrVal_1317)))))))) is different from false [2022-09-16 10:23:50,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310) .cse6 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1319) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1311) (< 2147483647 v_ArrVal_1317)))))))) is different from false [2022-09-16 10:23:50,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1307)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310) .cse6 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1319) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1311)))))))) is different from false [2022-09-16 10:23:50,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310) .cse6 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1319) (< (select .cse0 .cse3) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))) (< 2147483647 v_ArrVal_1317) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1311)))))))))) is different from false [2022-09-16 10:23:50,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1310) .cse1 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse4 .cse3))) (< (select .cse4 .cse5) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse3))) (< 2147483647 v_ArrVal_1317) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1311))))))))) is different from false [2022-09-16 10:23:50,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1310) .cse3 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse6 .cse3))))))))))) is different from false [2022-09-16 10:23:51,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1310) .cse1 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1319) (< (select .cse4 .cse5) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse4 .cse1))) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse5) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse1)))))))))))) is different from false [2022-09-16 10:23:52,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1305 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1305)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1310) .cse1 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1311) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse1))) (< (select .cse0 .cse6) (+ v_ArrVal_1322 1)) (< 2147483647 v_ArrVal_1317) (< (select (store (store (store .cse0 .cse6 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse6) 2147483647)))))))))) is different from false [2022-09-16 10:23:52,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:52,510 INFO L390 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 2 case distinctions, treesize of input 727 treesize of output 477 [2022-09-16 10:23:52,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:52,568 INFO L390 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 2463 treesize of output 2461 [2022-09-16 10:23:52,601 INFO L390 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 1784 treesize of output 1688 [2022-09-16 10:23:52,631 INFO L390 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 1505 treesize of output 1457 [2022-09-16 10:23:52,667 INFO L390 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 825 treesize of output 817 [2022-09-16 10:23:52,697 INFO L390 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 1336 treesize of output 1312 [2022-09-16 10:23:52,760 INFO L390 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 8 treesize of output 4 [2022-09-16 10:23:52,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:52,933 INFO L390 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 424 treesize of output 420 [2022-09-16 10:23:55,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:23:55,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 10:23:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-09-16 10:23:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91079548] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:23:55,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:23:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40, 43] total 120 [2022-09-16 10:23:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395325152] [2022-09-16 10:23:55,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:23:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-09-16 10:23:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:23:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-09-16 10:23:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=8813, Unknown=187, NotChecked=4922, Total=14520 [2022-09-16 10:23:55,699 INFO L87 Difference]: Start difference. First operand 19510 states and 51549 transitions. Second operand has 121 states, 120 states have (on average 5.541666666666667) internal successors, (665), 121 states have internal predecessors, (665), 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-09-16 10:24:05,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_1310) .cse2 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1317) .cse2 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1319) (< (select .cse5 .cse6) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse2))) (< (select (store (store (store .cse5 .cse6 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse6) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse2)))))))))))) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:24:06,048 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 3204) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1310) .cse1 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1319) (< (select .cse4 .cse5) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse4 .cse1))) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse5) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse1)))))))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-16 10:24:06,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_1310) .cse2 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1317) .cse2 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1319) (< (select .cse5 .cse6) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse2))) (< (select (store (store (store .cse5 .cse6 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse6) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse2)))))))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:24:07,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1306))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_1310) .cse2 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1317) .cse2 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1319) (< (select .cse5 .cse6) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse2))) (< (select (store (store (store .cse5 .cse6 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse6) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse2)))))))))))) (let ((.cse10 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and .cse10 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 3204)) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 3204))) (and (not .cse10) (= (select .cse0 3204) 0)))) (<= |c_~#stored_elements~0.base| 6) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) is different from false [2022-09-16 10:24:08,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1310) .cse3 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1311) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse6 .cse3))))))))))) (= 7 |c_~#queue~0.base|) (<= (select .cse8 (+ |c_~#queue~0.offset| 3204)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse8 3204) 0) (<= |c_~#stored_elements~0.base| 6) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204)))) is different from false [2022-09-16 10:24:09,448 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1310) .cse1 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse4 .cse3))) (< (select .cse4 .cse5) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse3))) (< 2147483647 v_ArrVal_1317) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1311))))))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 3204) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 3204))) is different from false [2022-09-16 10:24:11,456 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1307 Int) (v_ArrVal_1317 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_1307)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310) .cse6 v_ArrVal_1311)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1313) |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1319) (< (select .cse0 .cse3) (+ v_ArrVal_1322 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))) (< 2147483647 v_ArrVal_1317) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1311)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse8)) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse8) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:24:49,004 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3204) 1) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1319 Int) (v_ArrVal_1314 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1314))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_1317) .cse2 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1319) (< (select .cse3 .cse4) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse2))) (< (select (store (store (store .cse3 .cse4 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse4) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:24:49,756 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3204) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1317) .cse2 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))) (< (select (store (store (store .cse3 .cse4 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse2))) (< (select .cse3 .cse4) (+ v_ArrVal_1322 1)) (< (+ 1 (select .cse5 .cse2)) v_ArrVal_1319) (< 2147483647 v_ArrVal_1317)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 10:24:50,487 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_1319) (< 2147483647 v_ArrVal_1317)))))) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|) 3204) 1) (= |c_t1Thread1of1ForFork0_empty_#in~q#1.base| |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-16 10:24:51,204 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_empty_~q#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_1316)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_1319) (< 2147483647 v_ArrVal_1317)))))) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) 3204) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-16 10:24:52,280 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1316)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1317) .cse1 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1319) (< (select .cse2 .cse3) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse4 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse3) 2147483647) (< 2147483647 v_ArrVal_1317) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 3204) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-16 10:24:56,642 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1319 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int) (v_ArrVal_1326 Int) (v_ArrVal_1317 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1317) .cse3 v_ArrVal_1319)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1322 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1319) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1322) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1324) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) .cse1) 2147483647) (< 2147483647 v_ArrVal_1317))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-16 10:25:47,651 WARN L233 SmtUtils]: Spent 21.75s on a formula simplification. DAG size of input: 69 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:25:49,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) 2147483646) (= |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_1324)) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) (<= (select .cse1 (+ |c_~#queue~0.offset| 3204)) 2) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 10:26:10,605 WARN L233 SmtUtils]: Spent 21.31s on a formula simplification. DAG size of input: 67 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:26:11,200 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) 2147483646) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_1324)) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_1326) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 2) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|)) is different from false [2022-09-16 10:26:37,339 WARN L233 SmtUtils]: Spent 26.07s on a formula simplification. DAG size of input: 65 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:27:30,916 WARN L233 SmtUtils]: Spent 23.77s on a formula simplification. DAG size of input: 67 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:27:52,874 WARN L233 SmtUtils]: Spent 21.90s on a formula simplification. DAG size of input: 65 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:28:17,950 WARN L233 SmtUtils]: Spent 24.95s on a formula simplification. DAG size of input: 63 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:28:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:28:19,446 INFO L93 Difference]: Finished difference Result 71791 states and 189811 transitions. [2022-09-16 10:28:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-09-16 10:28:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 120 states have (on average 5.541666666666667) internal successors, (665), 121 states have internal predecessors, (665), 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 236 [2022-09-16 10:28:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:28:19,580 INFO L225 Difference]: With dead ends: 71791 [2022-09-16 10:28:19,580 INFO L226 Difference]: Without dead ends: 71791 [2022-09-16 10:28:19,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 417 SyntacticMatches, 26 SemanticMatches, 266 ConstructedPredicates, 38 IntricatePredicates, 7 DeprecatedPredicates, 20789 ImplicationChecksByTransitivity, 589.3s TimeCoverageRelationStatistics Valid=4456, Invalid=48119, Unknown=247, NotChecked=18734, Total=71556 [2022-09-16 10:28:19,587 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 6564 mSDsluCounter, 39405 mSDsCounter, 0 mSdLazyCounter, 8034 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6564 SdHoareTripleChecker+Valid, 39600 SdHoareTripleChecker+Invalid, 52534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 8034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44214 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:28:19,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6564 Valid, 39600 Invalid, 52534 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [286 Valid, 8034 Invalid, 0 Unknown, 44214 Unchecked, 4.1s Time] [2022-09-16 10:28:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71791 states. [2022-09-16 10:28:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71791 to 34230. [2022-09-16 10:28:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34230 states, 34216 states have (on average 2.670358896422726) internal successors, (91369), 34229 states have internal predecessors, (91369), 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-09-16 10:28:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34230 states to 34230 states and 91369 transitions. [2022-09-16 10:28:20,498 INFO L78 Accepts]: Start accepts. Automaton has 34230 states and 91369 transitions. Word has length 236 [2022-09-16 10:28:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:28:20,498 INFO L495 AbstractCegarLoop]: Abstraction has 34230 states and 91369 transitions. [2022-09-16 10:28:20,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 120 states have (on average 5.541666666666667) internal successors, (665), 121 states have internal predecessors, (665), 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-09-16 10:28:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34230 states and 91369 transitions. [2022-09-16 10:28:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-09-16 10:28:20,535 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:28:20,536 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:28:20,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-16 10:28:20,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:28:20,736 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:28:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:28:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -152654784, now seen corresponding path program 3 times [2022-09-16 10:28:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:28:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411444421] [2022-09-16 10:28:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:28:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:28:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:28:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:28:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:28:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411444421] [2022-09-16 10:28:22,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411444421] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:28:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770627583] [2022-09-16 10:28:22,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 10:28:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:28:22,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:28:22,141 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-09-16 10:28:22,141 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-09-16 10:28:22,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 10:28:22,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:28:22,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 97 conjunts are in the unsatisfiable core [2022-09-16 10:28:22,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:28:22,483 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:28:22,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:28:22,520 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:28:22,521 INFO L390 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 11 treesize of output 11 [2022-09-16 10:28:22,656 INFO L390 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 13 treesize of output 9 [2022-09-16 10:28:22,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:28:23,121 INFO L390 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 31 treesize of output 29 [2022-09-16 10:28:23,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:23,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:28:23,480 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:28:23,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-09-16 10:28:23,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:23,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:23,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-09-16 10:28:23,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:23,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 30 [2022-09-16 10:28:23,858 INFO L390 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 25 treesize of output 25 [2022-09-16 10:28:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:23,971 INFO L390 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 25 treesize of output 25 [2022-09-16 10:28:24,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:24,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:28:24,397 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 10:28:24,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 10:28:24,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:24,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:24,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-09-16 10:28:24,610 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:24,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2022-09-16 10:28:24,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:24,716 INFO L390 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 16 treesize of output 18 [2022-09-16 10:28:24,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:28:24,874 INFO L390 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 19 treesize of output 7 [2022-09-16 10:28:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:28:24,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:28:24,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770627583] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:28:24,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:28:24,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [44] total 75 [2022-09-16 10:28:24,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648633693] [2022-09-16 10:28:24,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:28:24,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-09-16 10:28:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:28:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-09-16 10:28:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=5161, Unknown=0, NotChecked=0, Total=5550 [2022-09-16 10:28:24,905 INFO L87 Difference]: Start difference. First operand 34230 states and 91369 transitions. Second operand has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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-09-16 10:28:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:28:26,738 INFO L93 Difference]: Finished difference Result 32930 states and 87692 transitions. [2022-09-16 10:28:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 10:28:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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 236 [2022-09-16 10:28:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:28:27,052 INFO L225 Difference]: With dead ends: 32930 [2022-09-16 10:28:27,052 INFO L226 Difference]: Without dead ends: 32930 [2022-09-16 10:28:27,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3896 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=946, Invalid=8954, Unknown=0, NotChecked=0, Total=9900 [2022-09-16 10:28:27,053 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 2630 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2630 SdHoareTripleChecker+Valid, 3798 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:28:27,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2630 Valid, 3798 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 10:28:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32930 states. [2022-09-16 10:28:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32930 to 24068. [2022-09-16 10:28:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24068 states, 24054 states have (on average 2.667290263573626) internal successors, (64159), 24067 states have internal predecessors, (64159), 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-09-16 10:28:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24068 states to 24068 states and 64159 transitions. [2022-09-16 10:28:27,425 INFO L78 Accepts]: Start accepts. Automaton has 24068 states and 64159 transitions. Word has length 236 [2022-09-16 10:28:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:28:27,425 INFO L495 AbstractCegarLoop]: Abstraction has 24068 states and 64159 transitions. [2022-09-16 10:28:27,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.151515151515151) internal successors, (236), 33 states have internal predecessors, (236), 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-09-16 10:28:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 24068 states and 64159 transitions. [2022-09-16 10:28:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-09-16 10:28:27,443 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:28:27,443 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:28:27,461 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-09-16 10:28:27,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:28:27,651 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:28:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:28:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1080782447, now seen corresponding path program 1 times [2022-09-16 10:28:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:28:27,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353464917] [2022-09-16 10:28:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:28:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:28:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:28:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:28:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:28:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353464917] [2022-09-16 10:28:29,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353464917] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:28:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565288868] [2022-09-16 10:28:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:28:29,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:28:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:28:29,121 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-09-16 10:28:29,122 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-09-16 10:28:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:28:29,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 86 conjunts are in the unsatisfiable core [2022-09-16 10:28:29,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:28:29,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-09-16 10:28:29,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:29,843 INFO L390 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 17 treesize of output 19 [2022-09-16 10:28:30,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:28:30,156 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 10:28:30,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-09-16 10:28:30,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:30,246 INFO L390 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 24 treesize of output 23 [2022-09-16 10:28:30,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:30,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2022-09-16 10:28:30,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:30,629 INFO L390 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 26 treesize of output 26 [2022-09-16 10:28:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:28:30,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:28:30,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-09-16 10:28:31,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:31,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-09-16 10:28:31,616 INFO L356 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2022-09-16 10:28:31,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 49 [2022-09-16 10:28:31,664 INFO L390 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 19 treesize of output 7 [2022-09-16 10:28:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:28:31,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:28:39,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204)))) v_ArrVal_1582) .cse1) 2147483647)))) is different from false [2022-09-16 10:28:39,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1))))) is different from false [2022-09-16 10:28:39,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_1582) .cse1) 2147483647)))) is different from false [2022-09-16 10:28:39,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1))))) is different from false [2022-09-16 10:28:39,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1573) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (not (<= v_ArrVal_1573 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2022-09-16 10:28:39,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1573) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1))))) is different from false [2022-09-16 10:28:39,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1571)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1573) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1))))) is different from false [2022-09-16 10:28:39,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1571)))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1573) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1))))) is different from false [2022-09-16 10:28:39,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse4 .cse3))) v_ArrVal_1571)))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1573) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647)))) is different from false [2022-09-16 10:28:39,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1571)))) (store (store .cse3 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647))))) is different from false [2022-09-16 10:28:39,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1569))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse2))) v_ArrVal_1571)))) (store (store .cse4 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647) (< 2147483647 v_ArrVal_1573))))) is different from false [2022-09-16 10:28:39,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1569))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1571)))) (store (store .cse4 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1573) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647))))) is different from false [2022-09-16 10:28:39,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1569))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1571)))) (store (store .cse4 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647) (< 2147483647 v_ArrVal_1573) (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)))))) is different from false [2022-09-16 10:28:40,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1569))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1571)))) (store (store .cse4 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647))))) is different from false [2022-09-16 10:28:40,033 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1571 Int) (v_ArrVal_1582 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1573 Int) (v_ArrVal_1578 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1569))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1571)))) (store (store .cse4 .cse1 v_ArrVal_1573) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1578 1)) (< 2147483647 v_ArrVal_1573) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1578) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1580) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1582) .cse1) 2147483647))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-09-16 10:28:40,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:40,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 524 treesize of output 260 [2022-09-16 10:28:40,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:40,066 INFO L390 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 320 treesize of output 314 [2022-09-16 10:28:40,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:40,075 INFO L390 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 299 treesize of output 275 [2022-09-16 10:28:40,082 INFO L390 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 74 treesize of output 66 [2022-09-16 10:28:40,090 INFO L390 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 7 treesize of output 3 [2022-09-16 10:28:40,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:28:40,128 INFO L390 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 87 treesize of output 83 [2022-09-16 10:28:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-09-16 10:28:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565288868] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:28:40,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:28:40,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 32, 33] total 102 [2022-09-16 10:28:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403069697] [2022-09-16 10:28:40,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:28:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-09-16 10:28:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:28:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-09-16 10:28:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=7173, Unknown=21, NotChecked=2790, Total=10506 [2022-09-16 10:28:40,449 INFO L87 Difference]: Start difference. First operand 24068 states and 64159 transitions. Second operand has 103 states, 102 states have (on average 6.696078431372549) internal successors, (683), 103 states have internal predecessors, (683), 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-09-16 10:28:58,146 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 56 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:29:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:29:01,363 INFO L93 Difference]: Finished difference Result 48669 states and 129916 transitions. [2022-09-16 10:29:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-09-16 10:29:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 102 states have (on average 6.696078431372549) internal successors, (683), 103 states have internal predecessors, (683), 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 242 [2022-09-16 10:29:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:29:01,455 INFO L225 Difference]: With dead ends: 48669 [2022-09-16 10:29:01,455 INFO L226 Difference]: Without dead ends: 48669 [2022-09-16 10:29:01,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 434 SyntacticMatches, 23 SemanticMatches, 168 ConstructedPredicates, 15 IntricatePredicates, 2 DeprecatedPredicates, 8344 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=2751, Invalid=21157, Unknown=22, NotChecked=4800, Total=28730 [2022-09-16 10:29:01,457 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 7507 mSDsluCounter, 21968 mSDsCounter, 0 mSdLazyCounter, 4384 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7507 SdHoareTripleChecker+Valid, 22431 SdHoareTripleChecker+Invalid, 19836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 4384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14972 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:29:01,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7507 Valid, 22431 Invalid, 19836 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [480 Valid, 4384 Invalid, 0 Unknown, 14972 Unchecked, 2.3s Time] [2022-09-16 10:29:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48669 states. [2022-09-16 10:29:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48669 to 26747. [2022-09-16 10:29:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26747 states, 26733 states have (on average 2.668537014177234) internal successors, (71338), 26746 states have internal predecessors, (71338), 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-09-16 10:29:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26747 states to 26747 states and 71338 transitions. [2022-09-16 10:29:02,033 INFO L78 Accepts]: Start accepts. Automaton has 26747 states and 71338 transitions. Word has length 242 [2022-09-16 10:29:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:29:02,033 INFO L495 AbstractCegarLoop]: Abstraction has 26747 states and 71338 transitions. [2022-09-16 10:29:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 6.696078431372549) internal successors, (683), 103 states have internal predecessors, (683), 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-09-16 10:29:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26747 states and 71338 transitions. [2022-09-16 10:29:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-09-16 10:29:02,053 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:29:02,053 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 10:29:02,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-16 10:29:02,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-09-16 10:29:02,255 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:29:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:29:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1581518983, now seen corresponding path program 2 times [2022-09-16 10:29:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:29:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901239915] [2022-09-16 10:29:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:29:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:29:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:29:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:29:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:29:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901239915] [2022-09-16 10:29:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901239915] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:29:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322693754] [2022-09-16 10:29:03,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:29:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:29:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:29:03,638 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-09-16 10:29:03,640 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-09-16 10:29:03,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:29:03,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:29:03,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 109 conjunts are in the unsatisfiable core [2022-09-16 10:29:03,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:29:03,946 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:29:03,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:29:03,986 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:29:03,986 INFO L390 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 11 treesize of output 11 [2022-09-16 10:29:04,139 INFO L390 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 13 treesize of output 9 [2022-09-16 10:29:04,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:29:04,440 INFO L390 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 16 treesize of output 18 [2022-09-16 10:29:04,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:29:04,753 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-09-16 10:29:04,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-16 10:29:04,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:29:04,815 INFO L390 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 23 treesize of output 22 [2022-09-16 10:29:05,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-09-16 10:29:05,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:29:05,121 INFO L390 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 16 treesize of output 18 [2022-09-16 10:29:05,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:29:05,575 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-09-16 10:29:05,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-16 10:29:05,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:29:05,700 INFO L390 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 23 treesize of output 22 [2022-09-16 10:29:06,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-09-16 10:29:06,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:29:06,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:29:06,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:29:06,368 INFO L390 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 25 treesize of output 25 [2022-09-16 10:29:06,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:29:06,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:29:06,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 10:29:06,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:29:06,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-09-16 10:29:07,215 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:29:07,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 10:29:07,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:29:07,282 INFO L390 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 28 treesize of output 10 [2022-09-16 10:29:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:29:07,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-09-16 10:29:45,984 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-09-16 10:29:45,984 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 10:29:46,073 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-09-16 10:29:46,101 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-09-16 10:29:46,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-09-16 10:29:46,274 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. [2022-09-16 10:29:46,275 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-09-16 10:29:46,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-09-16 10:29:46,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-09-16 10:29:46,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-09-16 10:29:46,280 INFO L444 BasicCegarLoop]: Path program histogram: [3, 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] [2022-09-16 10:29:46,291 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 10:29:46,291 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 10:29:46,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 10:29:46 BasicIcfg [2022-09-16 10:29:46,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 10:29:46,296 INFO L158 Benchmark]: Toolchain (without parser) took 823989.53ms. Allocated memory was 177.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 119.4MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-09-16 10:29:46,296 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 10:29:46,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.10ms. Allocated memory was 177.2MB in the beginning and 219.2MB in the end (delta: 41.9MB). Free memory was 119.3MB in the beginning and 173.0MB in the end (delta: -53.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-09-16 10:29:46,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.52ms. Allocated memory is still 219.2MB. Free memory was 173.0MB in the beginning and 169.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 10:29:46,296 INFO L158 Benchmark]: Boogie Preprocessor took 21.03ms. Allocated memory is still 219.2MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 10:29:46,297 INFO L158 Benchmark]: RCFGBuilder took 580.37ms. Allocated memory is still 219.2MB. Free memory was 167.8MB in the beginning and 144.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-09-16 10:29:46,297 INFO L158 Benchmark]: TraceAbstraction took 822824.81ms. Allocated memory was 219.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 144.2MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-09-16 10:29:46,298 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.10ms. Allocated memory was 177.2MB in the beginning and 219.2MB in the end (delta: 41.9MB). Free memory was 119.3MB in the beginning and 173.0MB in the end (delta: -53.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.52ms. Allocated memory is still 219.2MB. Free memory was 173.0MB in the beginning and 169.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.03ms. Allocated memory is still 219.2MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.37ms. Allocated memory is still 219.2MB. Free memory was 167.8MB in the beginning and 144.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 822824.81ms. Allocated memory was 219.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 144.2MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.9GB. 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: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while NwaCegarLoop was analyzing trace of length 243 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 496 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 822.6s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.5s, AutomataDifference: 350.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89129 SdHoareTripleChecker+Valid, 25.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89129 mSDsluCounter, 204259 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 59186 IncrementalHoareTripleChecker+Unchecked, 188260 mSDsCounter, 4308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44831 IncrementalHoareTripleChecker+Invalid, 108325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4308 mSolverCounterUnsat, 17234 mSDtfsCounter, 44831 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3338 GetRequests, 1531 SyntacticMatches, 53 SemanticMatches, 1754 ConstructedPredicates, 53 IntricatePredicates, 9 DeprecatedPredicates, 47133 ImplicationChecksByTransitivity, 660.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75470occurred in iteration=22, InterpolantAutomatonStates: 1041, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 295830 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 395.5s InterpolantComputationTime, 6384 NumberOfCodeBlocks, 6384 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 6819 ConstructedInterpolants, 340 QuantifiedInterpolants, 176119 SizeOfPredicates, 127 NumberOfNonLiveVariables, 2176 ConjunctsInSsa, 303 ConjunctsInUnsatCore, 43 InterpolantComputations, 34 PerfectInterpolantSequences, 87/236 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