/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:13:36,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:13:36,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:13:36,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:13:36,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:13:36,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:13:36,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:13:36,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:13:36,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:13:36,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:13:36,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:13:36,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:13:36,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:13:36,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:13:36,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:13:36,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:13:36,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:13:36,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:13:36,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:13:36,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:13:36,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:13:36,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:13:36,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:13:36,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:13:36,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:13:36,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:13:36,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:13:36,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:13:36,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:13:37,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:13:37,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:13:37,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:13:37,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:13:37,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:13:37,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:13:37,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:13:37,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:13:37,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:13:37,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:13:37,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:13:37,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:13:37,009 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:13:37,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:13:37,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:13:37,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:13:37,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:13:37,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:13:37,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:13:37,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:13:37,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:13:37,045 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:13:37,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:13:37,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:13:37,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:13:37,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:13:37,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:13:37,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:13:37,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:13:37,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:13:37,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:13:37,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:13:37,049 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:13:37,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:13:37,049 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:13:37,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:13:37,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:13:37,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:13:37,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:13:37,307 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:13:37,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2022-09-16 10:13:37,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26855d24e/d27fd8dcef82484cbe1a8a53ff460226/FLAG85c6c7a2b [2022-09-16 10:13:37,823 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:13:37,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2022-09-16 10:13:37,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26855d24e/d27fd8dcef82484cbe1a8a53ff460226/FLAG85c6c7a2b [2022-09-16 10:13:38,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26855d24e/d27fd8dcef82484cbe1a8a53ff460226 [2022-09-16 10:13:38,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:13:38,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:13:38,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:13:38,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:13:38,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:13:38,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c286d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38, skipping insertion in model container [2022-09-16 10:13:38,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:13:38,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:13:38,604 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.i[43284,43297] [2022-09-16 10:13:38,608 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.i[43491,43504] [2022-09-16 10:13:38,610 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.i[43772,43785] [2022-09-16 10:13:38,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:13:38,633 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:13:38,677 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.i[43284,43297] [2022-09-16 10:13:38,678 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.i[43491,43504] [2022-09-16 10:13:38,681 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.i[43772,43785] [2022-09-16 10:13:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:13:38,729 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:13:38,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38 WrapperNode [2022-09-16 10:13:38,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:13:38,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:13:38,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:13:38,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:13:38,739 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:13:38" (1/1) ... [2022-09-16 10:13:38,768 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:13:38" (1/1) ... [2022-09-16 10:13:38,798 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2022-09-16 10:13:38,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:13:38,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:13:38,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:13:38,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:13:38,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:13:38,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:13:38,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:13:38,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:13:38,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (1/1) ... [2022-09-16 10:13:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:13:38,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:13:38,870 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:13:38,874 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:13:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 10:13:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 10:13:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 10:13:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 10:13:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:13:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:13:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:13:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:13:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 10:13:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:13:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:13:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:13:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:13:38,904 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:13:39,051 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:13:39,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:13:39,445 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:13:39,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:13:39,456 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 10:13:39,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:13:39 BoogieIcfgContainer [2022-09-16 10:13:39,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:13:39,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:13:39,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:13:39,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:13:39,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:13:38" (1/3) ... [2022-09-16 10:13:39,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed09efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:13:39, skipping insertion in model container [2022-09-16 10:13:39,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:13:38" (2/3) ... [2022-09-16 10:13:39,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed09efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:13:39, skipping insertion in model container [2022-09-16 10:13:39,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:13:39" (3/3) ... [2022-09-16 10:13:39,471 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-09-16 10:13:39,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:13:39,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:13:39,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-09-16 10:13:39,491 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:13:39,615 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 10:13:39,655 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 299 places, 307 transitions, 630 flow [2022-09-16 10:13:40,856 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36621 states, 36531 states have (on average 2.842489940050916) internal successors, (103839), 36620 states have internal predecessors, (103839), 0 states have call successors, (0), 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:13:40,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:13:40,892 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;@6c8dc326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:13:40,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-09-16 10:13:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 36621 states, 36531 states have (on average 2.842489940050916) internal successors, (103839), 36620 states have internal predecessors, (103839), 0 states have call successors, (0), 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:13:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-09-16 10:13:41,148 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:13:41,149 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:13:41,150 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:13:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:13:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash -144585435, now seen corresponding path program 1 times [2022-09-16 10:13:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:13:41,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682416517] [2022-09-16 10:13:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:13:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:13:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:13:41,707 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:13:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:13:41,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682416517] [2022-09-16 10:13:41,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682416517] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:13:41,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:13:41,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 10:13:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107277024] [2022-09-16 10:13:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:13:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:13:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:13:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:13:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:13:41,833 INFO L87 Difference]: Start difference. First operand has 36621 states, 36531 states have (on average 2.842489940050916) internal successors, (103839), 36620 states have internal predecessors, (103839), 0 states have call successors, (0), 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:13:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:13:42,890 INFO L93 Difference]: Finished difference Result 35821 states and 100051 transitions. [2022-09-16 10:13:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:13:42,893 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:13:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:13:43,220 INFO L225 Difference]: With dead ends: 35821 [2022-09-16 10:13:43,220 INFO L226 Difference]: Without dead ends: 35740 [2022-09-16 10:13:43,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:13:43,235 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 547 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:13:43,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1825 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:13:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35740 states. [2022-09-16 10:13:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35740 to 35740. [2022-09-16 10:13:44,671 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:13:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35740 states to 35740 states and 99823 transitions. [2022-09-16 10:13:45,175 INFO L78 Accepts]: Start accepts. Automaton has 35740 states and 99823 transitions. Word has length 78 [2022-09-16 10:13:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:13:45,176 INFO L495 AbstractCegarLoop]: Abstraction has 35740 states and 99823 transitions. [2022-09-16 10:13:45,176 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:13:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35740 states and 99823 transitions. [2022-09-16 10:13:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-09-16 10:13:45,178 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:13:45,179 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:13:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:13:45,179 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:13:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:13:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1258785616, now seen corresponding path program 1 times [2022-09-16 10:13:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:13:45,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933056152] [2022-09-16 10:13:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:13:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:13:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:13:45,270 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:13:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:13:45,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933056152] [2022-09-16 10:13:45,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933056152] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:13:45,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:13:45,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:13:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271320775] [2022-09-16 10:13:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:13:45,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:13:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:13:45,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:13:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:13:45,275 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:13:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:13:46,235 INFO L93 Difference]: Finished difference Result 66382 states and 186173 transitions. [2022-09-16 10:13:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:13:46,236 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:13:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:13:46,680 INFO L225 Difference]: With dead ends: 66382 [2022-09-16 10:13:46,681 INFO L226 Difference]: Without dead ends: 66382 [2022-09-16 10:13:46,681 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:13:46,682 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:13:46,683 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:13:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66382 states. [2022-09-16 10:13:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66382 to 61612. [2022-09-16 10:13:48,789 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:13:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61612 states to 61612 states and 175569 transitions. [2022-09-16 10:13:49,294 INFO L78 Accepts]: Start accepts. Automaton has 61612 states and 175569 transitions. Word has length 79 [2022-09-16 10:13:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:13:49,295 INFO L495 AbstractCegarLoop]: Abstraction has 61612 states and 175569 transitions. [2022-09-16 10:13:49,295 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:13:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 61612 states and 175569 transitions. [2022-09-16 10:13:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-09-16 10:13:49,298 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:13:49,299 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:13:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 10:13:49,299 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:13:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:13:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1744336020, now seen corresponding path program 1 times [2022-09-16 10:13:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:13:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134452533] [2022-09-16 10:13:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:13:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:13:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:13:57,331 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:13:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:13:57,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134452533] [2022-09-16 10:13:57,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134452533] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:13:57,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:13:57,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:13:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143476936] [2022-09-16 10:13:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:13:57,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:13:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:13:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:13:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:13:57,334 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:14:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:01,824 INFO L93 Difference]: Finished difference Result 64320 states and 183235 transitions. [2022-09-16 10:14:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:14:01,824 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:14:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:02,255 INFO L225 Difference]: With dead ends: 64320 [2022-09-16 10:14:02,255 INFO L226 Difference]: Without dead ends: 64320 [2022-09-16 10:14:02,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 10:14:02,257 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 687 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:02,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 3545 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-09-16 10:14:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64320 states. [2022-09-16 10:14:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64320 to 62961. [2022-09-16 10:14:03,859 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:14:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62961 states to 62961 states and 179392 transitions. [2022-09-16 10:14:04,293 INFO L78 Accepts]: Start accepts. Automaton has 62961 states and 179392 transitions. Word has length 83 [2022-09-16 10:14:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:04,294 INFO L495 AbstractCegarLoop]: Abstraction has 62961 states and 179392 transitions. [2022-09-16 10:14:04,294 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:14:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62961 states and 179392 transitions. [2022-09-16 10:14:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-09-16 10:14:04,298 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:04,298 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:14:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 10:14:04,299 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:14:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 842887034, now seen corresponding path program 1 times [2022-09-16 10:14:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789370173] [2022-09-16 10:14:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:05,022 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:14:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:05,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789370173] [2022-09-16 10:14:05,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789370173] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:05,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:05,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:14:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956654889] [2022-09-16 10:14:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:05,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:14:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:14:05,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:14:05,025 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:14:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:07,237 INFO L93 Difference]: Finished difference Result 70707 states and 201119 transitions. [2022-09-16 10:14:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:14:07,238 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:14:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:07,474 INFO L225 Difference]: With dead ends: 70707 [2022-09-16 10:14:07,474 INFO L226 Difference]: Without dead ends: 70707 [2022-09-16 10:14:07,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 10:14:07,476 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2987 mSDsluCounter, 2704 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2987 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:07,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2987 Valid, 3190 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-09-16 10:14:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70707 states. [2022-09-16 10:14:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70707 to 65160. [2022-09-16 10:14:09,224 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:14:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65160 states to 65160 states and 185455 transitions. [2022-09-16 10:14:09,470 INFO L78 Accepts]: Start accepts. Automaton has 65160 states and 185455 transitions. Word has length 88 [2022-09-16 10:14:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:09,471 INFO L495 AbstractCegarLoop]: Abstraction has 65160 states and 185455 transitions. [2022-09-16 10:14:09,471 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:14:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 65160 states and 185455 transitions. [2022-09-16 10:14:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 10:14:09,475 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:09,476 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:14:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 10:14:09,476 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:14:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 473094309, now seen corresponding path program 1 times [2022-09-16 10:14:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:09,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779199827] [2022-09-16 10:14:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:09,543 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:14:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:09,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779199827] [2022-09-16 10:14:09,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779199827] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:09,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:09,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:14:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140048405] [2022-09-16 10:14:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:09,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:14:09,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:09,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:14:09,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:14:09,547 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:14:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:10,182 INFO L93 Difference]: Finished difference Result 64537 states and 183724 transitions. [2022-09-16 10:14:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:14:10,183 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:14:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:10,390 INFO L225 Difference]: With dead ends: 64537 [2022-09-16 10:14:10,393 INFO L226 Difference]: Without dead ends: 64537 [2022-09-16 10:14:10,394 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:14:10,395 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:14:10,395 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:14:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64537 states. [2022-09-16 10:14:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64537 to 64537. [2022-09-16 10:14:12,197 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:14:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64537 states to 64537 states and 183724 transitions. [2022-09-16 10:14:12,429 INFO L78 Accepts]: Start accepts. Automaton has 64537 states and 183724 transitions. Word has length 89 [2022-09-16 10:14:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:12,429 INFO L495 AbstractCegarLoop]: Abstraction has 64537 states and 183724 transitions. [2022-09-16 10:14:12,429 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:14:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 64537 states and 183724 transitions. [2022-09-16 10:14:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 10:14:12,433 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:12,434 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:14:12,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 10:14:12,434 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:14:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1192785660, now seen corresponding path program 1 times [2022-09-16 10:14:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:12,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742673883] [2022-09-16 10:14:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:12,485 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:14:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742673883] [2022-09-16 10:14:12,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742673883] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:12,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:14:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168005648] [2022-09-16 10:14:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:14:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:14:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:14:12,487 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:14:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:13,068 INFO L93 Difference]: Finished difference Result 42945 states and 120509 transitions. [2022-09-16 10:14:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:14:13,068 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:14:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:13,198 INFO L225 Difference]: With dead ends: 42945 [2022-09-16 10:14:13,198 INFO L226 Difference]: Without dead ends: 42945 [2022-09-16 10:14:13,199 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:14:13,199 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:14:13,200 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:14:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42945 states. [2022-09-16 10:14:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42945 to 41986. [2022-09-16 10:14:14,114 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:14:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41986 states to 41986 states and 118329 transitions. [2022-09-16 10:14:14,252 INFO L78 Accepts]: Start accepts. Automaton has 41986 states and 118329 transitions. Word has length 90 [2022-09-16 10:14:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:14,252 INFO L495 AbstractCegarLoop]: Abstraction has 41986 states and 118329 transitions. [2022-09-16 10:14:14,252 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:14:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41986 states and 118329 transitions. [2022-09-16 10:14:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 10:14:14,256 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:14,256 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:14:14,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 10:14:14,256 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:14:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1781022561, now seen corresponding path program 1 times [2022-09-16 10:14:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:14,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977995733] [2022-09-16 10:14:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:14,325 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:14:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977995733] [2022-09-16 10:14:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977995733] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:14:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604648986] [2022-09-16 10:14:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:14:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:14:14,328 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:14:14,336 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:14:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:14,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:14:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:14:14,812 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:14:14,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:14:14,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604648986] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:14,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:14:14,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:14:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109950495] [2022-09-16 10:14:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:14,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:14:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:14:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:14:14,814 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:14:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:15,126 INFO L93 Difference]: Finished difference Result 44731 states and 124463 transitions. [2022-09-16 10:14:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:14:15,126 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:14:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:15,277 INFO L225 Difference]: With dead ends: 44731 [2022-09-16 10:14:15,277 INFO L226 Difference]: Without dead ends: 43624 [2022-09-16 10:14:15,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:14:15,278 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.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:15,278 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.0s Time] [2022-09-16 10:14:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43624 states. [2022-09-16 10:14:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43624 to 25036. [2022-09-16 10:14:16,033 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:14:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 69312 transitions. [2022-09-16 10:14:16,101 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 69312 transitions. Word has length 90 [2022-09-16 10:14:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:16,101 INFO L495 AbstractCegarLoop]: Abstraction has 25036 states and 69312 transitions. [2022-09-16 10:14:16,102 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:14:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 69312 transitions. [2022-09-16 10:14:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-09-16 10:14:16,105 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:16,105 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:14:16,132 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:14:16,319 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:14:16,320 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:14:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -429721795, now seen corresponding path program 1 times [2022-09-16 10:14:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:16,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743443122] [2022-09-16 10:14:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:18,461 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:14:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:18,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743443122] [2022-09-16 10:14:18,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743443122] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:18,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:18,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:14:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235520509] [2022-09-16 10:14:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:14:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:14:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:14:18,464 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:14:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:19,758 INFO L93 Difference]: Finished difference Result 25440 states and 70426 transitions. [2022-09-16 10:14:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 10:14:19,759 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:14:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:19,820 INFO L225 Difference]: With dead ends: 25440 [2022-09-16 10:14:19,821 INFO L226 Difference]: Without dead ends: 25440 [2022-09-16 10:14:19,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:14:19,822 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 544 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:19,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2369 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:14:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25440 states. [2022-09-16 10:14:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25440 to 25233. [2022-09-16 10:14:20,309 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:14:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25233 states to 25233 states and 69859 transitions. [2022-09-16 10:14:20,389 INFO L78 Accepts]: Start accepts. Automaton has 25233 states and 69859 transitions. Word has length 93 [2022-09-16 10:14:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:20,389 INFO L495 AbstractCegarLoop]: Abstraction has 25233 states and 69859 transitions. [2022-09-16 10:14:20,389 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:14:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25233 states and 69859 transitions. [2022-09-16 10:14:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 10:14:20,499 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:20,499 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:14:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 10:14:20,499 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:14:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -944764253, now seen corresponding path program 1 times [2022-09-16 10:14:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446337999] [2022-09-16 10:14:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:20,997 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:14:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:20,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446337999] [2022-09-16 10:14:20,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446337999] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:20,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:20,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:14:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377877111] [2022-09-16 10:14:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:20,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:14:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:14:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:14:21,000 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:14:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:22,088 INFO L93 Difference]: Finished difference Result 25095 states and 69481 transitions. [2022-09-16 10:14:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 10:14:22,088 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:14:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:22,142 INFO L225 Difference]: With dead ends: 25095 [2022-09-16 10:14:22,143 INFO L226 Difference]: Without dead ends: 25095 [2022-09-16 10:14:22,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2022-09-16 10:14:22,144 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1279 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:22,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2026 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:14:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25095 states. [2022-09-16 10:14:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25095 to 24888. [2022-09-16 10:14:22,645 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:14:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24888 states to 24888 states and 68914 transitions. [2022-09-16 10:14:22,705 INFO L78 Accepts]: Start accepts. Automaton has 24888 states and 68914 transitions. Word has length 98 [2022-09-16 10:14:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:22,705 INFO L495 AbstractCegarLoop]: Abstraction has 24888 states and 68914 transitions. [2022-09-16 10:14:22,705 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:14:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24888 states and 68914 transitions. [2022-09-16 10:14:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-09-16 10:14:22,715 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:22,715 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:14:22,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:14:22,715 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:14:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash -82127817, now seen corresponding path program 1 times [2022-09-16 10:14:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:22,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535561446] [2022-09-16 10:14:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:22,755 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:14:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:22,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535561446] [2022-09-16 10:14:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535561446] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:14:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454600560] [2022-09-16 10:14:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:14:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:14:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:14:22,757 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:14:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:23,060 INFO L93 Difference]: Finished difference Result 30458 states and 84177 transitions. [2022-09-16 10:14:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:14:23,060 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:14:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:23,129 INFO L225 Difference]: With dead ends: 30458 [2022-09-16 10:14:23,130 INFO L226 Difference]: Without dead ends: 30458 [2022-09-16 10:14:23,130 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:14:23,130 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:14:23,131 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:14:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30458 states. [2022-09-16 10:14:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30458 to 29514. [2022-09-16 10:14:23,826 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:14:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29514 states to 29514 states and 81889 transitions. [2022-09-16 10:14:23,919 INFO L78 Accepts]: Start accepts. Automaton has 29514 states and 81889 transitions. Word has length 123 [2022-09-16 10:14:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:23,920 INFO L495 AbstractCegarLoop]: Abstraction has 29514 states and 81889 transitions. [2022-09-16 10:14:23,920 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:14:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29514 states and 81889 transitions. [2022-09-16 10:14:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-09-16 10:14:23,933 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:23,934 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:14:23,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 10:14:23,934 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:14:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -690953012, now seen corresponding path program 1 times [2022-09-16 10:14:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:23,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777507747] [2022-09-16 10:14:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:23,981 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:14:23,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:23,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777507747] [2022-09-16 10:14:23,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777507747] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:23,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:23,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:14:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486636497] [2022-09-16 10:14:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:23,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:14:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:14:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:14:23,983 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:14:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:24,136 INFO L93 Difference]: Finished difference Result 28858 states and 80079 transitions. [2022-09-16 10:14:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:14:24,137 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:14:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:24,201 INFO L225 Difference]: With dead ends: 28858 [2022-09-16 10:14:24,202 INFO L226 Difference]: Without dead ends: 28858 [2022-09-16 10:14:24,202 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:14:24,203 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:14:24,203 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:14:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28858 states. [2022-09-16 10:14:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28858 to 28858. [2022-09-16 10:14:24,868 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:14:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28858 states to 28858 states and 80079 transitions. [2022-09-16 10:14:24,950 INFO L78 Accepts]: Start accepts. Automaton has 28858 states and 80079 transitions. Word has length 133 [2022-09-16 10:14:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:24,950 INFO L495 AbstractCegarLoop]: Abstraction has 28858 states and 80079 transitions. [2022-09-16 10:14:24,950 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:14:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28858 states and 80079 transitions. [2022-09-16 10:14:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-09-16 10:14:24,961 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:24,961 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:14:24,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 10:14:24,962 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:14:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 55293910, now seen corresponding path program 1 times [2022-09-16 10:14:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546046285] [2022-09-16 10:14:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:25,022 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:14:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:25,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546046285] [2022-09-16 10:14:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546046285] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:14:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139099620] [2022-09-16 10:14:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:25,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:14:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:14:25,028 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:14:25,030 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:14:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:25,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:14:25,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:14:25,195 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:14:25,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:14:25,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139099620] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:25,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:14:25,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:14:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830644547] [2022-09-16 10:14:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:25,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:14:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:14:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:14:25,197 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:14:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:25,659 INFO L93 Difference]: Finished difference Result 29146 states and 80557 transitions. [2022-09-16 10:14:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:14:25,660 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:14:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:25,754 INFO L225 Difference]: With dead ends: 29146 [2022-09-16 10:14:25,755 INFO L226 Difference]: Without dead ends: 29146 [2022-09-16 10:14:25,755 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:14:25,756 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 484 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:25,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1437 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:14:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29146 states. [2022-09-16 10:14:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29146 to 23576. [2022-09-16 10:14:26,326 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:14:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23576 states to 23576 states and 65294 transitions. [2022-09-16 10:14:26,602 INFO L78 Accepts]: Start accepts. Automaton has 23576 states and 65294 transitions. Word has length 134 [2022-09-16 10:14:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:26,602 INFO L495 AbstractCegarLoop]: Abstraction has 23576 states and 65294 transitions. [2022-09-16 10:14:26,602 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:14:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 23576 states and 65294 transitions. [2022-09-16 10:14:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-09-16 10:14:26,612 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:26,612 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:14:26,629 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:14:26,812 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:14:26,813 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:14:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash 723281376, now seen corresponding path program 1 times [2022-09-16 10:14:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:26,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35506653] [2022-09-16 10:14:26,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:27,188 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:14:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:27,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35506653] [2022-09-16 10:14:27,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35506653] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:27,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:27,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 10:14:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448554952] [2022-09-16 10:14:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:27,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 10:14:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 10:14:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-09-16 10:14:27,190 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:14:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:27,927 INFO L93 Difference]: Finished difference Result 23704 states and 65647 transitions. [2022-09-16 10:14:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 10:14:27,927 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:14:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:27,976 INFO L225 Difference]: With dead ends: 23704 [2022-09-16 10:14:27,977 INFO L226 Difference]: Without dead ends: 23704 [2022-09-16 10:14:27,977 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:14:27,977 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 1049 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:27,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1790 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:14:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23704 states. [2022-09-16 10:14:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23704 to 23635. [2022-09-16 10:14:28,532 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:14:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23635 states to 23635 states and 65458 transitions. [2022-09-16 10:14:28,601 INFO L78 Accepts]: Start accepts. Automaton has 23635 states and 65458 transitions. Word has length 135 [2022-09-16 10:14:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:28,602 INFO L495 AbstractCegarLoop]: Abstraction has 23635 states and 65458 transitions. [2022-09-16 10:14:28,602 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:14:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 23635 states and 65458 transitions. [2022-09-16 10:14:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-09-16 10:14:28,614 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:28,614 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:14:28,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-16 10:14:28,614 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:14:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1332992454, now seen corresponding path program 1 times [2022-09-16 10:14:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:28,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256340660] [2022-09-16 10:14:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:33,632 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:14:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256340660] [2022-09-16 10:14:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256340660] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:33,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-16 10:14:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939340065] [2022-09-16 10:14:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:33,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-09-16 10:14:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-09-16 10:14:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:14:33,635 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:14:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:36,405 INFO L93 Difference]: Finished difference Result 24808 states and 68671 transitions. [2022-09-16 10:14:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 10:14:36,405 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:14:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:36,488 INFO L225 Difference]: With dead ends: 24808 [2022-09-16 10:14:36,488 INFO L226 Difference]: Without dead ends: 24808 [2022-09-16 10:14:36,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2022-09-16 10:14:36,489 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 793 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:36,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 3545 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-09-16 10:14:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2022-09-16 10:14:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 23842. [2022-09-16 10:14:37,028 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:14:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23842 states to 23842 states and 66025 transitions. [2022-09-16 10:14:37,089 INFO L78 Accepts]: Start accepts. Automaton has 23842 states and 66025 transitions. Word has length 140 [2022-09-16 10:14:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:37,090 INFO L495 AbstractCegarLoop]: Abstraction has 23842 states and 66025 transitions. [2022-09-16 10:14:37,090 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:14:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 23842 states and 66025 transitions. [2022-09-16 10:14:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-09-16 10:14:37,102 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:37,102 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:14:37,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 10:14:37,103 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:14:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1855050088, now seen corresponding path program 2 times [2022-09-16 10:14:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098198821] [2022-09-16 10:14:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:37,555 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:14:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098198821] [2022-09-16 10:14:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098198821] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:37,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:37,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 10:14:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344442769] [2022-09-16 10:14:37,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:14:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:14:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:14:37,557 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:14:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:38,389 INFO L93 Difference]: Finished difference Result 23704 states and 65578 transitions. [2022-09-16 10:14:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:14:38,390 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:14:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:38,437 INFO L225 Difference]: With dead ends: 23704 [2022-09-16 10:14:38,437 INFO L226 Difference]: Without dead ends: 23704 [2022-09-16 10:14:38,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:14:38,438 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1467 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:38,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1266 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:14:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23704 states. [2022-09-16 10:14:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23704 to 23428. [2022-09-16 10:14:38,975 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:14:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23428 states to 23428 states and 64822 transitions. [2022-09-16 10:14:39,033 INFO L78 Accepts]: Start accepts. Automaton has 23428 states and 64822 transitions. Word has length 140 [2022-09-16 10:14:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:39,033 INFO L495 AbstractCegarLoop]: Abstraction has 23428 states and 64822 transitions. [2022-09-16 10:14:39,033 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:14:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 23428 states and 64822 transitions. [2022-09-16 10:14:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-09-16 10:14:39,042 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:39,042 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:14:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-16 10:14:39,042 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:14:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1802980663, now seen corresponding path program 1 times [2022-09-16 10:14:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660094631] [2022-09-16 10:14:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:40,000 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:14:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660094631] [2022-09-16 10:14:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660094631] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:40,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:40,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-09-16 10:14:40,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128134201] [2022-09-16 10:14:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-09-16 10:14:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-09-16 10:14:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-09-16 10:14:40,002 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:14:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:42,365 INFO L93 Difference]: Finished difference Result 24320 states and 67269 transitions. [2022-09-16 10:14:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 10:14:42,365 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:14:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:42,413 INFO L225 Difference]: With dead ends: 24320 [2022-09-16 10:14:42,414 INFO L226 Difference]: Without dead ends: 24320 [2022-09-16 10:14:42,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=761, Invalid=3399, Unknown=0, NotChecked=0, Total=4160 [2022-09-16 10:14:42,415 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 1943 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:42,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 3265 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:14:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24320 states. [2022-09-16 10:14:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24320 to 23561. [2022-09-16 10:14:42,866 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:14:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23561 states to 23561 states and 65190 transitions. [2022-09-16 10:14:42,922 INFO L78 Accepts]: Start accepts. Automaton has 23561 states and 65190 transitions. Word has length 141 [2022-09-16 10:14:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:42,922 INFO L495 AbstractCegarLoop]: Abstraction has 23561 states and 65190 transitions. [2022-09-16 10:14:42,922 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:14:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 65190 transitions. [2022-09-16 10:14:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-09-16 10:14:42,931 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:42,931 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:14:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-16 10:14:42,931 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:14:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -57824887, now seen corresponding path program 1 times [2022-09-16 10:14:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:42,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455906177] [2022-09-16 10:14:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:43,359 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:14:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:43,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455906177] [2022-09-16 10:14:43,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455906177] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:43,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:43,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-16 10:14:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295603827] [2022-09-16 10:14:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:43,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 10:14:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 10:14:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-09-16 10:14:43,361 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:14:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:46,504 INFO L93 Difference]: Finished difference Result 71058 states and 198673 transitions. [2022-09-16 10:14:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 10:14:46,504 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:14:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:46,722 INFO L225 Difference]: With dead ends: 71058 [2022-09-16 10:14:46,722 INFO L226 Difference]: Without dead ends: 71058 [2022-09-16 10:14:46,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=945, Invalid=2595, Unknown=0, NotChecked=0, Total=3540 [2022-09-16 10:14:46,723 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 5655 mSDsluCounter, 8431 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5655 SdHoareTripleChecker+Valid, 9236 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:46,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5655 Valid, 9236 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-09-16 10:14:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71058 states. [2022-09-16 10:14:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71058 to 42184. [2022-09-16 10:14:48,014 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:14:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42184 states to 42184 states and 118729 transitions. [2022-09-16 10:14:48,132 INFO L78 Accepts]: Start accepts. Automaton has 42184 states and 118729 transitions. Word has length 142 [2022-09-16 10:14:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:48,132 INFO L495 AbstractCegarLoop]: Abstraction has 42184 states and 118729 transitions. [2022-09-16 10:14:48,132 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:14:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42184 states and 118729 transitions. [2022-09-16 10:14:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-09-16 10:14:48,149 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:48,149 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:14:48,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-16 10:14:48,149 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:14:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -820567505, now seen corresponding path program 1 times [2022-09-16 10:14:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403222879] [2022-09-16 10:14:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:49,589 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:14:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:49,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403222879] [2022-09-16 10:14:49,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403222879] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:49,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:49,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-09-16 10:14:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578927369] [2022-09-16 10:14:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:49,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-16 10:14:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-16 10:14:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2022-09-16 10:14:49,591 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:14:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:52,446 INFO L93 Difference]: Finished difference Result 45183 states and 127064 transitions. [2022-09-16 10:14:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 10:14:52,447 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:14:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:52,556 INFO L225 Difference]: With dead ends: 45183 [2022-09-16 10:14:52,556 INFO L226 Difference]: Without dead ends: 45183 [2022-09-16 10:14:52,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=926, Invalid=3766, Unknown=0, NotChecked=0, Total=4692 [2022-09-16 10:14:52,558 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 4314 mSDsluCounter, 5009 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4314 SdHoareTripleChecker+Valid, 5525 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:52,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 5525 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 10:14:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45183 states. [2022-09-16 10:14:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45183 to 44629. [2022-09-16 10:14:53,597 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:14:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44629 states to 44629 states and 125542 transitions. [2022-09-16 10:14:53,716 INFO L78 Accepts]: Start accepts. Automaton has 44629 states and 125542 transitions. Word has length 146 [2022-09-16 10:14:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:53,716 INFO L495 AbstractCegarLoop]: Abstraction has 44629 states and 125542 transitions. [2022-09-16 10:14:53,716 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:14:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44629 states and 125542 transitions. [2022-09-16 10:14:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-09-16 10:14:53,731 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:53,731 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:14:53,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-16 10:14:53,731 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:14:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1643961903, now seen corresponding path program 1 times [2022-09-16 10:14:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:53,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473710392] [2022-09-16 10:14:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:53,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:54,142 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:14:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473710392] [2022-09-16 10:14:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473710392] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:54,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:54,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-16 10:14:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975457641] [2022-09-16 10:14:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:54,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 10:14:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 10:14:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-09-16 10:14:54,144 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:14:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:14:57,210 INFO L93 Difference]: Finished difference Result 73675 states and 206984 transitions. [2022-09-16 10:14:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 10:14:57,211 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:14:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:14:57,426 INFO L225 Difference]: With dead ends: 73675 [2022-09-16 10:14:57,426 INFO L226 Difference]: Without dead ends: 73675 [2022-09-16 10:14:57,427 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:14:57,427 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 3579 mSDsluCounter, 8264 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3579 SdHoareTripleChecker+Valid, 9061 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:14:57,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3579 Valid, 9061 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-09-16 10:14:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73675 states. [2022-09-16 10:14:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73675 to 36078. [2022-09-16 10:14:58,465 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:14:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36078 states to 36078 states and 101315 transitions. [2022-09-16 10:14:58,564 INFO L78 Accepts]: Start accepts. Automaton has 36078 states and 101315 transitions. Word has length 147 [2022-09-16 10:14:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:14:58,564 INFO L495 AbstractCegarLoop]: Abstraction has 36078 states and 101315 transitions. [2022-09-16 10:14:58,564 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:14:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36078 states and 101315 transitions. [2022-09-16 10:14:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-09-16 10:14:58,574 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:14:58,575 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:14:58,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-16 10:14:58,575 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:14:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:14:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1831608018, now seen corresponding path program 1 times [2022-09-16 10:14:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:14:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324915387] [2022-09-16 10:14:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:14:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:14:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:14:59,415 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:14:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:14:59,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324915387] [2022-09-16 10:14:59,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324915387] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:14:59,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:14:59,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 10:14:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613324832] [2022-09-16 10:14:59,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:14:59,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 10:14:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:14:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 10:14:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:14:59,417 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:15:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:01,588 INFO L93 Difference]: Finished difference Result 52275 states and 146373 transitions. [2022-09-16 10:15:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 10:15:01,588 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:15:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:01,737 INFO L225 Difference]: With dead ends: 52275 [2022-09-16 10:15:01,738 INFO L226 Difference]: Without dead ends: 52275 [2022-09-16 10:15:01,738 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:15:01,739 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 2989 mSDsluCounter, 5048 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 5614 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:01,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2989 Valid, 5614 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 10:15:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52275 states. [2022-09-16 10:15:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52275 to 48715. [2022-09-16 10:15:02,719 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:15:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48715 states to 48715 states and 136811 transitions. [2022-09-16 10:15:03,132 INFO L78 Accepts]: Start accepts. Automaton has 48715 states and 136811 transitions. Word has length 151 [2022-09-16 10:15:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 48715 states and 136811 transitions. [2022-09-16 10:15:03,133 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:15:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 48715 states and 136811 transitions. [2022-09-16 10:15:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-09-16 10:15:03,154 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:03,154 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:15:03,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-16 10:15:03,155 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:15:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash 945274546, now seen corresponding path program 1 times [2022-09-16 10:15:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:03,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374782498] [2022-09-16 10:15:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:03,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:03,560 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:15:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:03,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374782498] [2022-09-16 10:15:03,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374782498] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-16 10:15:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957612049] [2022-09-16 10:15:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-16 10:15:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-16 10:15:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-09-16 10:15:03,562 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:15:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:07,004 INFO L93 Difference]: Finished difference Result 96102 states and 270158 transitions. [2022-09-16 10:15:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 10:15:07,004 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:15:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:07,307 INFO L225 Difference]: With dead ends: 96102 [2022-09-16 10:15:07,307 INFO L226 Difference]: Without dead ends: 96102 [2022-09-16 10:15:07,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=969, Invalid=2691, Unknown=0, NotChecked=0, Total=3660 [2022-09-16 10:15:07,309 INFO L413 NwaCegarLoop]: 907 mSDtfsCounter, 5146 mSDsluCounter, 9117 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 10009 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:07,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 10009 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-09-16 10:15:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96102 states. [2022-09-16 10:15:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96102 to 72180. [2022-09-16 10:15:09,160 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:15:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72180 states to 72180 states and 204489 transitions. [2022-09-16 10:15:09,364 INFO L78 Accepts]: Start accepts. Automaton has 72180 states and 204489 transitions. Word has length 152 [2022-09-16 10:15:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:09,365 INFO L495 AbstractCegarLoop]: Abstraction has 72180 states and 204489 transitions. [2022-09-16 10:15:09,365 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:15:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 72180 states and 204489 transitions. [2022-09-16 10:15:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-09-16 10:15:09,392 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:09,392 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:15:09,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-16 10:15:09,393 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:15:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -891615560, now seen corresponding path program 1 times [2022-09-16 10:15:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:09,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711114881] [2022-09-16 10:15:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:10,693 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:15:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:10,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711114881] [2022-09-16 10:15:10,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711114881] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:10,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:10,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-09-16 10:15:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090721446] [2022-09-16 10:15:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:10,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-09-16 10:15:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-09-16 10:15:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:15:10,695 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:15:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:14,611 INFO L93 Difference]: Finished difference Result 100038 states and 282860 transitions. [2022-09-16 10:15:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 10:15:14,612 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:15:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:14,937 INFO L225 Difference]: With dead ends: 100038 [2022-09-16 10:15:14,937 INFO L226 Difference]: Without dead ends: 100038 [2022-09-16 10:15:14,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=855, Invalid=3051, Unknown=0, NotChecked=0, Total=3906 [2022-09-16 10:15:14,938 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 4000 mSDsluCounter, 6795 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4000 SdHoareTripleChecker+Valid, 7381 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:14,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4000 Valid, 7381 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-09-16 10:15:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100038 states. [2022-09-16 10:15:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100038 to 77173. [2022-09-16 10:15:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77173 states, 77145 states have (on average 2.8406896104737833) internal successors, (219145), 77172 states have internal predecessors, (219145), 0 states have call successors, (0), 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:15:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77173 states to 77173 states and 219145 transitions. [2022-09-16 10:15:17,414 INFO L78 Accepts]: Start accepts. Automaton has 77173 states and 219145 transitions. Word has length 156 [2022-09-16 10:15:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:17,414 INFO L495 AbstractCegarLoop]: Abstraction has 77173 states and 219145 transitions. [2022-09-16 10:15:17,414 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:15:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 77173 states and 219145 transitions. [2022-09-16 10:15:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-09-16 10:15:17,437 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:17,437 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:15:17,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-16 10:15:17,437 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash 319105232, now seen corresponding path program 2 times [2022-09-16 10:15:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266371877] [2022-09-16 10:15:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:17,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:18,386 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:15:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:18,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266371877] [2022-09-16 10:15:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266371877] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-09-16 10:15:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128308060] [2022-09-16 10:15:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:18,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-16 10:15:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:18,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-16 10:15:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2022-09-16 10:15:18,388 INFO L87 Difference]: Start difference. First operand 77173 states and 219145 transitions. Second operand has 34 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 34 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:15:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:21,754 INFO L93 Difference]: Finished difference Result 79108 states and 224377 transitions. [2022-09-16 10:15:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 10:15:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 34 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:15:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:22,109 INFO L225 Difference]: With dead ends: 79108 [2022-09-16 10:15:22,109 INFO L226 Difference]: Without dead ends: 79108 [2022-09-16 10:15:22,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=800, Invalid=3360, Unknown=0, NotChecked=0, Total=4160 [2022-09-16 10:15:22,110 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 3299 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 7316 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:22,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 7316 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-09-16 10:15:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79108 states. [2022-09-16 10:15:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79108 to 77172. [2022-09-16 10:15:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77172 states, 77144 states have (on average 2.8405060665767916) internal successors, (219128), 77171 states have internal predecessors, (219128), 0 states have call successors, (0), 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:15:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77172 states to 77172 states and 219128 transitions. [2022-09-16 10:15:24,522 INFO L78 Accepts]: Start accepts. Automaton has 77172 states and 219128 transitions. Word has length 156 [2022-09-16 10:15:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:24,522 INFO L495 AbstractCegarLoop]: Abstraction has 77172 states and 219128 transitions. [2022-09-16 10:15:24,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 34 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:15:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 77172 states and 219128 transitions. [2022-09-16 10:15:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-09-16 10:15:24,553 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:24,553 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:15:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-16 10:15:24,554 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 332141134, now seen corresponding path program 1 times [2022-09-16 10:15:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:24,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497337127] [2022-09-16 10:15:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:25,151 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:15:25,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:25,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497337127] [2022-09-16 10:15:25,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497337127] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:25,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:25,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 10:15:25,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641770898] [2022-09-16 10:15:25,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:25,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 10:15:25,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:25,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 10:15:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:15:25,154 INFO L87 Difference]: Start difference. First operand 77172 states and 219128 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:15:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:29,606 INFO L93 Difference]: Finished difference Result 98738 states and 278752 transitions. [2022-09-16 10:15:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 10:15:29,606 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:15:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:29,926 INFO L225 Difference]: With dead ends: 98738 [2022-09-16 10:15:29,927 INFO L226 Difference]: Without dead ends: 98738 [2022-09-16 10:15:29,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1231, Invalid=3191, Unknown=0, NotChecked=0, Total=4422 [2022-09-16 10:15:29,928 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 5711 mSDsluCounter, 8890 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5711 SdHoareTripleChecker+Valid, 9710 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:29,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5711 Valid, 9710 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-09-16 10:15:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98738 states. [2022-09-16 10:15:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98738 to 59260. [2022-09-16 10:15:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59260 states, 59232 states have (on average 2.842179902755267) internal successors, (168348), 59259 states have internal predecessors, (168348), 0 states have call successors, (0), 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:15:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59260 states to 59260 states and 168348 transitions. [2022-09-16 10:15:31,774 INFO L78 Accepts]: Start accepts. Automaton has 59260 states and 168348 transitions. Word has length 157 [2022-09-16 10:15:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:31,774 INFO L495 AbstractCegarLoop]: Abstraction has 59260 states and 168348 transitions. [2022-09-16 10:15:31,774 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:15:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 59260 states and 168348 transitions. [2022-09-16 10:15:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-09-16 10:15:31,796 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:31,797 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:15:31,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-09-16 10:15:31,797 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -405804637, now seen corresponding path program 1 times [2022-09-16 10:15:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008515318] [2022-09-16 10:15:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:32,206 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:15:32,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:32,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008515318] [2022-09-16 10:15:32,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008515318] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:32,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:32,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:15:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840952270] [2022-09-16 10:15:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:32,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:15:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:15:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:15:32,208 INFO L87 Difference]: Start difference. First operand 59260 states and 168348 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:15:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:32,316 INFO L93 Difference]: Finished difference Result 17289 states and 47318 transitions. [2022-09-16 10:15:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:15:32,317 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:15:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:32,356 INFO L225 Difference]: With dead ends: 17289 [2022-09-16 10:15:32,356 INFO L226 Difference]: Without dead ends: 15225 [2022-09-16 10:15:32,357 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:15:32,358 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:15:32,362 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:15:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2022-09-16 10:15:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 11743. [2022-09-16 10:15:32,587 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:15:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11743 states to 11743 states and 31851 transitions. [2022-09-16 10:15:32,612 INFO L78 Accepts]: Start accepts. Automaton has 11743 states and 31851 transitions. Word has length 184 [2022-09-16 10:15:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:32,612 INFO L495 AbstractCegarLoop]: Abstraction has 11743 states and 31851 transitions. [2022-09-16 10:15:32,612 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:15:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11743 states and 31851 transitions. [2022-09-16 10:15:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-09-16 10:15:32,623 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:32,623 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:15:32,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-09-16 10:15:32,624 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:15:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -830893071, now seen corresponding path program 1 times [2022-09-16 10:15:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:32,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514098316] [2022-09-16 10:15:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:32,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:32,663 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:15:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:32,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514098316] [2022-09-16 10:15:32,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514098316] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:32,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:32,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:15:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763656043] [2022-09-16 10:15:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:32,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:15:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:15:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:15:32,665 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:15:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:32,726 INFO L93 Difference]: Finished difference Result 9559 states and 24985 transitions. [2022-09-16 10:15:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:15:32,726 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:15:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:32,749 INFO L225 Difference]: With dead ends: 9559 [2022-09-16 10:15:32,749 INFO L226 Difference]: Without dead ends: 9559 [2022-09-16 10:15:32,750 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:15:32,750 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 176 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 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:15:32,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 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:15:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2022-09-16 10:15:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 9559. [2022-09-16 10:15:32,937 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:15:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9559 states to 9559 states and 24985 transitions. [2022-09-16 10:15:33,208 INFO L78 Accepts]: Start accepts. Automaton has 9559 states and 24985 transitions. Word has length 186 [2022-09-16 10:15:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:33,209 INFO L495 AbstractCegarLoop]: Abstraction has 9559 states and 24985 transitions. [2022-09-16 10:15:33,209 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:15:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 9559 states and 24985 transitions. [2022-09-16 10:15:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-09-16 10:15:33,221 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:33,221 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:15:33,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-09-16 10:15:33,221 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:15:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1716800193, now seen corresponding path program 1 times [2022-09-16 10:15:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012072659] [2022-09-16 10:15:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:33,449 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:15:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:33,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012072659] [2022-09-16 10:15:33,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012072659] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:33,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:33,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-16 10:15:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508162113] [2022-09-16 10:15:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:33,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-16 10:15:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-16 10:15:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-09-16 10:15:33,452 INFO L87 Difference]: Start difference. First operand 9559 states and 24985 transitions. Second operand has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 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:15:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:34,244 INFO L93 Difference]: Finished difference Result 15085 states and 39614 transitions. [2022-09-16 10:15:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:15:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 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:15:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:34,271 INFO L225 Difference]: With dead ends: 15085 [2022-09-16 10:15:34,272 INFO L226 Difference]: Without dead ends: 15085 [2022-09-16 10:15:34,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2022-09-16 10:15:34,273 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 1772 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:34,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 2599 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:15:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15085 states. [2022-09-16 10:15:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15085 to 11357. [2022-09-16 10:15:34,464 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:15:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 29729 transitions. [2022-09-16 10:15:34,488 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 29729 transitions. Word has length 187 [2022-09-16 10:15:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:34,488 INFO L495 AbstractCegarLoop]: Abstraction has 11357 states and 29729 transitions. [2022-09-16 10:15:34,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 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:15:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 29729 transitions. [2022-09-16 10:15:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-09-16 10:15:34,500 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:34,500 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:15:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-09-16 10:15:34,500 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1245142767, now seen corresponding path program 2 times [2022-09-16 10:15:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:34,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910701553] [2022-09-16 10:15:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:34,995 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:15:34,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:34,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910701553] [2022-09-16 10:15:34,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910701553] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:34,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:34,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 10:15:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662762018] [2022-09-16 10:15:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:34,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 10:15:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 10:15:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:15:34,997 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:15:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:35,800 INFO L93 Difference]: Finished difference Result 11314 states and 29617 transitions. [2022-09-16 10:15:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 10:15:35,801 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:15:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:35,820 INFO L225 Difference]: With dead ends: 11314 [2022-09-16 10:15:35,821 INFO L226 Difference]: Without dead ends: 11314 [2022-09-16 10:15:35,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 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:15:35,822 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 1914 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:35,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 2402 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:15:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11314 states. [2022-09-16 10:15:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11314 to 9516. [2022-09-16 10:15:35,973 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:15:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24873 transitions. [2022-09-16 10:15:35,993 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24873 transitions. Word has length 187 [2022-09-16 10:15:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 9516 states and 24873 transitions. [2022-09-16 10:15:35,993 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:15:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24873 transitions. [2022-09-16 10:15:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-09-16 10:15:36,003 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:36,003 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:15:36,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-09-16 10:15:36,003 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:15:36,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1681197546, now seen corresponding path program 1 times [2022-09-16 10:15:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:36,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687992137] [2022-09-16 10:15:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:36,608 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:15:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:36,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687992137] [2022-09-16 10:15:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687992137] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-09-16 10:15:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495640155] [2022-09-16 10:15:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:36,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 10:15:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 10:15:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-09-16 10:15:36,610 INFO L87 Difference]: Start difference. First operand 9516 states and 24873 transitions. Second operand has 25 states, 24 states have (on average 7.833333333333333) internal successors, (188), 25 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:15:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:39,448 INFO L93 Difference]: Finished difference Result 23554 states and 62075 transitions. [2022-09-16 10:15:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 10:15:39,449 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.833333333333333) internal successors, (188), 25 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:15:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:39,492 INFO L225 Difference]: With dead ends: 23554 [2022-09-16 10:15:39,492 INFO L226 Difference]: Without dead ends: 23554 [2022-09-16 10:15:39,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=859, Invalid=3301, Unknown=0, NotChecked=0, Total=4160 [2022-09-16 10:15:39,494 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 2963 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 8748 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:39,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2963 Valid, 8748 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-09-16 10:15:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2022-09-16 10:15:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 16439. [2022-09-16 10:15:39,811 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:15:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16439 states to 16439 states and 43614 transitions. [2022-09-16 10:15:39,848 INFO L78 Accepts]: Start accepts. Automaton has 16439 states and 43614 transitions. Word has length 188 [2022-09-16 10:15:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:39,848 INFO L495 AbstractCegarLoop]: Abstraction has 16439 states and 43614 transitions. [2022-09-16 10:15:39,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.833333333333333) internal successors, (188), 25 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:15:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16439 states and 43614 transitions. [2022-09-16 10:15:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-09-16 10:15:39,864 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:39,864 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:15:39,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-09-16 10:15:39,864 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:15:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1806550442, now seen corresponding path program 2 times [2022-09-16 10:15:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:39,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630329391] [2022-09-16 10:15:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:40,632 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:15:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630329391] [2022-09-16 10:15:40,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630329391] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:40,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:40,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-09-16 10:15:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360443695] [2022-09-16 10:15:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:40,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-09-16 10:15:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-09-16 10:15:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-09-16 10:15:40,635 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:15:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:42,360 INFO L93 Difference]: Finished difference Result 16055 states and 42490 transitions. [2022-09-16 10:15:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:15:42,361 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:15:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:42,390 INFO L225 Difference]: With dead ends: 16055 [2022-09-16 10:15:42,390 INFO L226 Difference]: Without dead ends: 16055 [2022-09-16 10:15:42,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2022-09-16 10:15:42,391 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 2058 mSDsluCounter, 3916 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:42,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 4297 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:15:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16055 states. [2022-09-16 10:15:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16055 to 13779. [2022-09-16 10:15:42,610 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:15:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13779 states to 13779 states and 36495 transitions. [2022-09-16 10:15:42,640 INFO L78 Accepts]: Start accepts. Automaton has 13779 states and 36495 transitions. Word has length 188 [2022-09-16 10:15:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:42,640 INFO L495 AbstractCegarLoop]: Abstraction has 13779 states and 36495 transitions. [2022-09-16 10:15:42,640 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:15:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13779 states and 36495 transitions. [2022-09-16 10:15:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-09-16 10:15:42,651 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:42,652 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:15:42,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-09-16 10:15:42,652 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:15:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1685109709, now seen corresponding path program 1 times [2022-09-16 10:15:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137216029] [2022-09-16 10:15:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:43,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:15:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:43,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137216029] [2022-09-16 10:15:43,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137216029] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:43,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:43,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-09-16 10:15:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806456950] [2022-09-16 10:15:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:43,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-09-16 10:15:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-09-16 10:15:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-09-16 10:15:43,250 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:15:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:46,764 INFO L93 Difference]: Finished difference Result 28819 states and 76024 transitions. [2022-09-16 10:15:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-09-16 10:15:46,764 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:15:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:46,843 INFO L225 Difference]: With dead ends: 28819 [2022-09-16 10:15:46,844 INFO L226 Difference]: Without dead ends: 28819 [2022-09-16 10:15:46,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1484, Invalid=5488, Unknown=0, NotChecked=0, Total=6972 [2022-09-16 10:15:46,845 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 4191 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4191 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:46,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4191 Valid, 7412 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-09-16 10:15:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2022-09-16 10:15:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 17115. [2022-09-16 10:15:47,193 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:15:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17115 states to 17115 states and 45295 transitions. [2022-09-16 10:15:47,231 INFO L78 Accepts]: Start accepts. Automaton has 17115 states and 45295 transitions. Word has length 194 [2022-09-16 10:15:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:47,231 INFO L495 AbstractCegarLoop]: Abstraction has 17115 states and 45295 transitions. [2022-09-16 10:15:47,231 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:15:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17115 states and 45295 transitions. [2022-09-16 10:15:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-09-16 10:15:47,247 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:47,247 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:15:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-09-16 10:15:47,248 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -50081779, now seen corresponding path program 2 times [2022-09-16 10:15:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:47,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022531054] [2022-09-16 10:15:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:48,725 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:15:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022531054] [2022-09-16 10:15:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022531054] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:48,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:48,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-09-16 10:15:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624747319] [2022-09-16 10:15:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:48,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-09-16 10:15:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-09-16 10:15:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2022-09-16 10:15:48,727 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:15:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:52,636 INFO L93 Difference]: Finished difference Result 22849 states and 60559 transitions. [2022-09-16 10:15:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 10:15:52,637 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:15:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:52,716 INFO L225 Difference]: With dead ends: 22849 [2022-09-16 10:15:52,717 INFO L226 Difference]: Without dead ends: 22849 [2022-09-16 10:15:52,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=989, Invalid=4711, Unknown=0, NotChecked=0, Total=5700 [2022-09-16 10:15:52,718 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 3972 mSDsluCounter, 8277 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3972 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:52,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3972 Valid, 8567 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-09-16 10:15:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22849 states. [2022-09-16 10:15:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22849 to 14315. [2022-09-16 10:15:52,972 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:15:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 37877 transitions. [2022-09-16 10:15:53,004 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 37877 transitions. Word has length 194 [2022-09-16 10:15:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:53,005 INFO L495 AbstractCegarLoop]: Abstraction has 14315 states and 37877 transitions. [2022-09-16 10:15:53,005 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:15:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 37877 transitions. [2022-09-16 10:15:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-09-16 10:15:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-09-16 10:15:53,018 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:15:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1906509871, now seen corresponding path program 1 times [2022-09-16 10:15:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:53,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155792858] [2022-09-16 10:15:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:15:54,661 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:15:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:15:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155792858] [2022-09-16 10:15:54,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155792858] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:15:54,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:15:54,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-09-16 10:15:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293717200] [2022-09-16 10:15:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:15:54,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-09-16 10:15:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:15:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-09-16 10:15:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2022-09-16 10:15:54,663 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:15:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:15:58,116 INFO L93 Difference]: Finished difference Result 16408 states and 43414 transitions. [2022-09-16 10:15:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 10:15:58,116 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:15:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:15:58,146 INFO L225 Difference]: With dead ends: 16408 [2022-09-16 10:15:58,146 INFO L226 Difference]: Without dead ends: 15820 [2022-09-16 10:15:58,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=838, Invalid=3718, Unknown=0, NotChecked=0, Total=4556 [2022-09-16 10:15:58,147 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 3061 mSDsluCounter, 5505 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 5815 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:15:58,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 5815 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-09-16 10:15:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15820 states. [2022-09-16 10:15:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15820 to 15680. [2022-09-16 10:15:58,382 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:15:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15680 states to 15680 states and 41398 transitions. [2022-09-16 10:15:58,414 INFO L78 Accepts]: Start accepts. Automaton has 15680 states and 41398 transitions. Word has length 203 [2022-09-16 10:15:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:15:58,415 INFO L495 AbstractCegarLoop]: Abstraction has 15680 states and 41398 transitions. [2022-09-16 10:15:58,415 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:15:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 15680 states and 41398 transitions. [2022-09-16 10:15:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-09-16 10:15:58,428 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:15:58,429 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:15:58,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-09-16 10:15:58,429 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:15:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:15:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 637360290, now seen corresponding path program 1 times [2022-09-16 10:15:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:15:58,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882892324] [2022-09-16 10:15:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:15:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:15:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:00,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882892324] [2022-09-16 10:16:00,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882892324] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:16:00,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402240235] [2022-09-16 10:16:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:00,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:16:00,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:00,237 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:16:00,237 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:16:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 86 conjunts are in the unsatisfiable core [2022-09-16 10:16:00,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:16:01,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 32 treesize of output 16 [2022-09-16 10:16:01,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:16:01,109 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:16:01,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:16:01,468 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 10:16:01,468 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:16:01,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:16:01,570 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:16:01,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:01,818 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:16:01,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:16:01,922 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:16:02,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:16:02,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:16:02,313 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:16:02,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:02,408 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:16:02,695 INFO L356 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2022-09-16 10:16:02,695 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:16:02,755 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:16:02,823 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:16:02,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:16:18,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1292 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1292 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1292 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1292 (Array Int 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1288) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_1288 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1288) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1288) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int 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_1286)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1288) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647)))) is different from false [2022-09-16 10:16:18,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1286)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1288) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1297) .cse1) 2147483647) (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1))))) is different from false [2022-09-16 10:16:18,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1286)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1288) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) v_ArrVal_1297) .cse1) 2147483647)))) is different from false [2022-09-16 10:16:18,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (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_1286)))) (store (store .cse3 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)))))) is different from false [2022-09-16 10:16:19,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1285))) (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_1286)))) (store (store .cse4 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1288) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* 4 (select .cse0 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)))))) is different from false [2022-09-16 10:16:19,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1285))) (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_1286)))) (store (store .cse4 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse2))) v_ArrVal_1297) .cse1) 2147483647) (< 2147483647 v_ArrVal_1288))))) is different from false [2022-09-16 10:16:19,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1285))) (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_1286)))) (store (store .cse4 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1297) .cse1) 2147483647) (< 2147483647 v_ArrVal_1288))))) is different from false [2022-09-16 10:16:19,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1285))) (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_1286)))) (store (store .cse4 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1297) .cse1) 2147483647))))) is different from false [2022-09-16 10:16:19,486 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1286 Int) (v_ArrVal_1297 Int) (v_ArrVal_1288 Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1285))) (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_1286)))) (store (store .cse4 .cse1 v_ArrVal_1288) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1292) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1288) (< (select .cse0 .cse1) (+ v_ArrVal_1293 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1293) (+ |c_~#queue~0.offset| 80) v_ArrVal_1295) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1297) .cse1) 2147483647))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:16:19,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:19,505 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:16:19,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:19,522 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:16:19,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:19,536 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:16:19,546 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:16:19,564 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:16:19,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:19,628 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:16:20,045 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:16:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402240235] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:16:20,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:16:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 33] total 95 [2022-09-16 10:16:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619050448] [2022-09-16 10:16:20,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:16:20,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-09-16 10:16:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:16:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-09-16 10:16:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=5887, Unknown=25, NotChecked=2550, Total=8930 [2022-09-16 10:16:20,049 INFO L87 Difference]: Start difference. First operand 15680 states and 41398 transitions. Second operand has 95 states, 95 states have (on average 7.021052631578947) internal successors, (667), 95 states have internal predecessors, (667), 0 states have call successors, (0), 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,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:16:40,794 INFO L93 Difference]: Finished difference Result 23150 states and 59748 transitions. [2022-09-16 10:16:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-09-16 10:16:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 7.021052631578947) internal successors, (667), 95 states have internal predecessors, (667), 0 states have call successors, (0), 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:16:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:16:40,834 INFO L225 Difference]: With dead ends: 23150 [2022-09-16 10:16:40,835 INFO L226 Difference]: Without dead ends: 23150 [2022-09-16 10:16:40,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 424 SyntacticMatches, 40 SemanticMatches, 191 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 10737 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=4299, Invalid=27242, Unknown=25, NotChecked=5490, Total=37056 [2022-09-16 10:16:40,837 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 12455 mSDsluCounter, 22558 mSDsCounter, 0 mSdLazyCounter, 4944 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12455 SdHoareTripleChecker+Valid, 22993 SdHoareTripleChecker+Invalid, 19929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 4944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14203 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:16:40,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12455 Valid, 22993 Invalid, 19929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [782 Valid, 4944 Invalid, 0 Unknown, 14203 Unchecked, 2.9s Time] [2022-09-16 10:16:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23150 states. [2022-09-16 10:16:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23150 to 14601. [2022-09-16 10:16:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14587 states have (on average 2.6110235140878864) internal successors, (38087), 14600 states have internal predecessors, (38087), 0 states have call successors, (0), 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,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 38087 transitions. [2022-09-16 10:16:41,111 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 38087 transitions. Word has length 236 [2022-09-16 10:16:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:16:41,111 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 38087 transitions. [2022-09-16 10:16:41,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 7.021052631578947) internal successors, (667), 95 states have internal predecessors, (667), 0 states have call successors, (0), 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,111 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 38087 transitions. [2022-09-16 10:16:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-09-16 10:16:41,122 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:16:41,122 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-09-16 10:16:41,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 10:16:41,322 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:16:41,323 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-09-16 10:16:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:16:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 133946713, now seen corresponding path program 1 times [2022-09-16 10:16:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:16:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112548415] [2022-09-16 10:16:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:16:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:16:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:16:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112548415] [2022-09-16 10:16:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112548415] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:16:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506602863] [2022-09-16 10:16:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:16:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:16:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:16:41,613 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:16:41,614 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:16:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:16:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 51 conjunts are in the unsatisfiable core [2022-09-16 10:16:41,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:16:42,280 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:16:42,376 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 25 treesize of output 24 [2022-09-16 10:16:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:16:42,444 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 18 treesize of output 20 [2022-09-16 10:16:42,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:16:42,717 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 0 case distinctions, treesize of input 36 treesize of output 20 [2022-09-16 10:16:42,808 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 25 treesize of output 24 [2022-09-16 10:16:43,031 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 10:16:43,032 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-09-16 10:16:43,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:16:43,102 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 34 treesize of output 24 [2022-09-16 10:16:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:16:43,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:00,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1412 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1411) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_1412) (+ |c_~#queue~0.offset| 80) v_ArrVal_1415) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1417) .cse1))) (< (+ v_ArrVal_1417 2147483648) 0) (< (+ v_ArrVal_1412 1) (select .cse0 .cse1))))) is different from false [2022-09-16 10:18:00,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1411 (Array Int Int)) (v_ArrVal_1410 Int) (v_ArrVal_1412 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1410)) |c_~#stored_elements~0.base| v_ArrVal_1411) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_1412) (+ |c_~#queue~0.offset| 80) v_ArrVal_1415) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1417) .cse1))) (< (+ v_ArrVal_1412 1) (select .cse0 .cse1)) (< (+ v_ArrVal_1417 2147483648) 0)))) is different from false [2022-09-16 10:18:00,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:00,942 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 76 treesize of output 66 [2022-09-16 10:18:00,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:00,952 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 105 treesize of output 107 [2022-09-16 10:18:00,959 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 42 treesize of output 38 [2022-09-16 10:18:00,970 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 10 treesize of output 6 [2022-09-16 10:18:00,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:00,981 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 58 treesize of output 58 [2022-09-16 10:18:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:18:01,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506602863] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:01,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:01,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 23] total 58 [2022-09-16 10:18:01,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146167025] [2022-09-16 10:18:01,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:01,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-09-16 10:18:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-09-16 10:18:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2866, Unknown=77, NotChecked=222, Total=3422 [2022-09-16 10:18:01,382 INFO L87 Difference]: Start difference. First operand 14601 states and 38087 transitions. Second operand has 59 states, 58 states have (on average 11.913793103448276) internal successors, (691), 59 states have internal predecessors, (691), 0 states have call successors, (0), 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:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:18:08,041 INFO L93 Difference]: Finished difference Result 25840 states and 67152 transitions. [2022-09-16 10:18:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-09-16 10:18:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 11.913793103448276) internal successors, (691), 59 states have internal predecessors, (691), 0 states have call successors, (0), 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 243 [2022-09-16 10:18:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:18:08,090 INFO L225 Difference]: With dead ends: 25840 [2022-09-16 10:18:08,090 INFO L226 Difference]: Without dead ends: 25840 [2022-09-16 10:18:08,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 451 SyntacticMatches, 60 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4871 ImplicationChecksByTransitivity, 83.2s TimeCoverageRelationStatistics Valid=2646, Invalid=10395, Unknown=77, NotChecked=454, Total=13572 [2022-09-16 10:18:08,093 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 6139 mSDsluCounter, 10203 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6139 SdHoareTripleChecker+Valid, 10664 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3187 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:18:08,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6139 Valid, 10664 Invalid, 5155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1708 Invalid, 0 Unknown, 3187 Unchecked, 0.9s Time] [2022-09-16 10:18:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25840 states. [2022-09-16 10:18:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25840 to 14249. [2022-09-16 10:18:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14249 states, 14237 states have (on average 2.6139636159303223) internal successors, (37215), 14248 states have internal predecessors, (37215), 0 states have call successors, (0), 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:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14249 states to 14249 states and 37215 transitions. [2022-09-16 10:18:08,412 INFO L78 Accepts]: Start accepts. Automaton has 14249 states and 37215 transitions. Word has length 243 [2022-09-16 10:18:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:18:08,412 INFO L495 AbstractCegarLoop]: Abstraction has 14249 states and 37215 transitions. [2022-09-16 10:18:08,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 11.913793103448276) internal successors, (691), 59 states have internal predecessors, (691), 0 states have call successors, (0), 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:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14249 states and 37215 transitions. [2022-09-16 10:18:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-09-16 10:18:08,425 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:18:08,425 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, 1, 1, 1] [2022-09-16 10:18:08,443 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:18:08,631 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:18:08,632 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:18:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:18:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -23612262, now seen corresponding path program 1 times [2022-09-16 10:18:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:18:08,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748294511] [2022-09-16 10:18:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:18:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:10,335 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:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:18:10,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748294511] [2022-09-16 10:18:10,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748294511] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:18:10,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111820071] [2022-09-16 10:18:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:18:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:18:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:18:10,340 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:18:10,344 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:18:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:18:10,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 89 conjunts are in the unsatisfiable core [2022-09-16 10:18:10,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:18:11,177 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:18:11,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:11,245 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:18:11,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:11,566 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 10:18:11,566 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:18:11,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:11,663 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:18:12,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:12,049 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 51 treesize of output 32 [2022-09-16 10:18:12,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:12,205 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 36 treesize of output 34 [2022-09-16 10:18:12,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:18:12,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 10:18:12,715 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 54 treesize of output 35 [2022-09-16 10:18:12,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:12,903 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 39 [2022-09-16 10:18:13,303 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 10:18:13,304 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 51 treesize of output 47 [2022-09-16 10:18:13,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:13,326 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 39 treesize of output 15 [2022-09-16 10:18:13,330 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:13,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:18:21,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1541) .cse1) 2147483647)))) is different from false [2022-09-16 10:18:21,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1))))) is different from false [2022-09-16 10:18:21,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1541) .cse1) 2147483647)))) is different from false [2022-09-16 10:18:21,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1))))) is different from false [2022-09-16 10:18:21,735 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:18:21,751 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)))))) is different from false [2022-09-16 10:18:21,805 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1531) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_1531 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)))))) is different from false [2022-09-16 10:18:21,849 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1531) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1541) .cse1) 2147483647) (< 2147483647 v_ArrVal_1531) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)))))) is different from false [2022-09-16 10:18:21,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse3 (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_1530)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1531) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (= .cse2 20) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< 2147483647 v_ArrVal_1531)))))) is different from false [2022-09-16 10:18:21,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1530)))) (let ((.cse0 (select .cse3 .cse4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1531) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (or (= 20 .cse0) (< (select (store (store (store .cse1 .cse2 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse1 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse2) 2147483647) (< (select .cse1 .cse2) (+ v_ArrVal_1536 1)) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1530)))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1531) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (= .cse2 20) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1541) .cse1) 2147483647) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse4 .cse2))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1531) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1541) .cse1) 2147483647) (= .cse3 20) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1528))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse5 .cse3))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1531) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (select (store (store (store .cse1 .cse2 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse2) 2147483647) (< (select .cse1 .cse2) (+ v_ArrVal_1536 1)) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1528))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse5 .cse3))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1531) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select .cse1 .cse2) (+ v_ArrVal_1536 1)) (< (select (store (store (store .cse1 .cse2 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) v_ArrVal_1541) .cse2) 2147483647) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1528))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse2))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1531) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (= .cse3 20) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse2))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1531) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (= 20 .cse3) (< 2147483647 v_ArrVal_1531))))))) is different from false [2022-09-16 10:18:22,905 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1530 Int) (v_ArrVal_1541 Int) (v_ArrVal_1531 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1530)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse2))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1531) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1535) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1536) (+ |c_~#queue~0.offset| 80) v_ArrVal_1538) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1541) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1536 1)) (= 20 .cse3) (< 2147483647 v_ArrVal_1531))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 10:18:22,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:22,928 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 588 treesize of output 288 [2022-09-16 10:18:22,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:22,943 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 369 treesize of output 359 [2022-09-16 10:18:22,954 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 119 treesize of output 99 [2022-09-16 10:18:22,963 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 253 treesize of output 229 [2022-09-16 10:18:22,987 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:18:23,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:18:23,072 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 200 treesize of output 160 [2022-09-16 10:18:23,514 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:18:23,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111820071] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:18:23,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:18:23,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33, 35] total 105 [2022-09-16 10:18:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809513996] [2022-09-16 10:18:23,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:18:23,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-09-16 10:18:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:18:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-09-16 10:18:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=7329, Unknown=24, NotChecked=3230, Total=11130 [2022-09-16 10:18:23,517 INFO L87 Difference]: Start difference. First operand 14249 states and 37215 transitions. Second operand has 106 states, 105 states have (on average 6.59047619047619) internal successors, (692), 106 states have internal predecessors, (692), 0 states have call successors, (0), 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:38,421 WARN L233 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 69 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:18:44,799 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 67 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:18:53,469 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 77 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 10:19:02,909 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 69 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)