/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/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 11:02:43,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 11:02:43,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 11:02:43,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 11:02:43,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 11:02:43,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 11:02:43,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 11:02:43,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 11:02:43,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 11:02:43,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 11:02:43,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 11:02:43,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 11:02:43,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 11:02:43,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 11:02:43,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 11:02:43,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 11:02:43,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 11:02:43,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 11:02:43,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 11:02:43,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 11:02:43,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 11:02:43,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 11:02:43,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 11:02:43,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 11:02:43,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 11:02:43,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 11:02:43,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 11:02:43,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 11:02:43,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 11:02:43,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 11:02:43,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 11:02:43,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 11:02:43,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 11:02:43,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 11:02:43,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 11:02:43,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 11:02:43,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 11:02:43,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 11:02:43,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 11:02:43,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 11:02:43,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 11:02:43,254 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 11:02:43,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 11:02:43,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 11:02:43,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 11:02:43,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 11:02:43,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 11:02:43,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 11:02:43,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 11:02:43,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 11:02:43,286 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 11:02:43,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 11:02:43,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 11:02:43,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 11:02:43,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 11:02:43,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 11:02:43,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 11:02:43,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 11:02:43,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 11:02:43,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 11:02:43,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 11:02:43,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:02:43,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 11:02:43,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 11:02:43,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 11:02:43,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 11:02:43,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 11:02:43,293 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 11:02:43,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 11:02:43,294 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 11:02:43,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 11:02:43,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 11:02:43,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 11:02:43,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 11:02:43,587 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 11:02:43,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-09-16 11:02:43,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ba66035/b7ea6e12362f47729bfd2b07e732bfc9/FLAG7b2c64b3e [2022-09-16 11:02:44,108 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 11:02:44,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-09-16 11:02:44,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ba66035/b7ea6e12362f47729bfd2b07e732bfc9/FLAG7b2c64b3e [2022-09-16 11:02:44,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ba66035/b7ea6e12362f47729bfd2b07e732bfc9 [2022-09-16 11:02:44,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 11:02:44,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 11:02:44,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 11:02:44,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 11:02:44,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 11:02:44,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d29a623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44, skipping insertion in model container [2022-09-16 11:02:44,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 11:02:44,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 11:02:44,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-09-16 11:02:44,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:02:44,397 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 11:02:44,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-09-16 11:02:44,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:02:44,454 INFO L208 MainTranslator]: Completed translation [2022-09-16 11:02:44,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44 WrapperNode [2022-09-16 11:02:44,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 11:02:44,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 11:02:44,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 11:02:44,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 11:02:44,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,516 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 250 [2022-09-16 11:02:44,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 11:02:44,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 11:02:44,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 11:02:44,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 11:02:44,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 11:02:44,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 11:02:44,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 11:02:44,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 11:02:44,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (1/1) ... [2022-09-16 11:02:44,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:02:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:02:44,604 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 11:02:44,625 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 11:02:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 11:02:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 11:02:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 11:02:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 11:02:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 11:02:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 11:02:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 11:02:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 11:02:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 11:02:44,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 11:02:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 11:02:44,650 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 11:02:44,808 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 11:02:44,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 11:02:45,249 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 11:02:45,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 11:02:45,523 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-16 11:02:45,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:02:45 BoogieIcfgContainer [2022-09-16 11:02:45,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 11:02:45,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 11:02:45,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 11:02:45,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 11:02:45,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 11:02:44" (1/3) ... [2022-09-16 11:02:45,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf03543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:02:45, skipping insertion in model container [2022-09-16 11:02:45,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:02:44" (2/3) ... [2022-09-16 11:02:45,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf03543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:02:45, skipping insertion in model container [2022-09-16 11:02:45,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:02:45" (3/3) ... [2022-09-16 11:02:45,534 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-09-16 11:02:45,541 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 11:02:45,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 11:02:45,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-09-16 11:02:45,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 11:02:45,714 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-16 11:02:45,759 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 187 places, 189 transitions, 402 flow [2022-09-16 11:02:47,423 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35712 states, 34982 states have (on average 3.881338974329655) internal successors, (135777), 35711 states have internal predecessors, (135777), 0 states have call successors, (0), 0 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 11:02:47,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 11:02:47,454 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;@5e79cb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 11:02:47,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-09-16 11:02:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 35712 states, 34982 states have (on average 3.881338974329655) internal successors, (135777), 35711 states have internal predecessors, (135777), 0 states have call successors, (0), 0 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 11:02:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-09-16 11:02:47,642 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:02:47,644 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] [2022-09-16 11:02:47,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:02:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:02:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1126068733, now seen corresponding path program 1 times [2022-09-16 11:02:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:02:47,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701636607] [2022-09-16 11:02:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:02:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:47,975 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 11:02:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:02:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701636607] [2022-09-16 11:02:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701636607] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:02:47,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:02:47,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:02:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509271505] [2022-09-16 11:02:47,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:02:47,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:02:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:48,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:02:48,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:02:48,094 INFO L87 Difference]: Start difference. First operand has 35712 states, 34982 states have (on average 3.881338974329655) internal successors, (135777), 35711 states have internal predecessors, (135777), 0 states have call successors, (0), 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 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:02:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:49,350 INFO L93 Difference]: Finished difference Result 52625 states and 192199 transitions. [2022-09-16 11:02:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:02:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-09-16 11:02:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:02:49,962 INFO L225 Difference]: With dead ends: 52625 [2022-09-16 11:02:49,963 INFO L226 Difference]: Without dead ends: 52621 [2022-09-16 11:02:49,964 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 11:02:49,967 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 97 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:02:49,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 371 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:02:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52621 states. [2022-09-16 11:02:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52621 to 26342. [2022-09-16 11:02:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26342 states, 25998 states have (on average 3.6975921224709594) internal successors, (96130), 26341 states have internal predecessors, (96130), 0 states have call successors, (0), 0 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 11:02:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26342 states to 26342 states and 96130 transitions. [2022-09-16 11:02:51,905 INFO L78 Accepts]: Start accepts. Automaton has 26342 states and 96130 transitions. Word has length 53 [2022-09-16 11:02:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:02:51,905 INFO L495 AbstractCegarLoop]: Abstraction has 26342 states and 96130 transitions. [2022-09-16 11:02:51,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:02:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 26342 states and 96130 transitions. [2022-09-16 11:02:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-09-16 11:02:51,907 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:02:51,907 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:02:51,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 11:02:51,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:02:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:02:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1889659338, now seen corresponding path program 1 times [2022-09-16 11:02:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:02:51,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622572439] [2022-09-16 11:02:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:02:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:02:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:02:52,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622572439] [2022-09-16 11:02:52,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622572439] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:02:52,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123533557] [2022-09-16 11:02:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:02:52,143 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 11:02:52,159 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 11:02:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:52,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:02:52,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:02:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:02:52,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:02:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:02:52,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123533557] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:02:52,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:02:52,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 11:02:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620041156] [2022-09-16 11:02:52,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:02:52,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:02:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:02:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:02:52,401 INFO L87 Difference]: Start difference. First operand 26342 states and 96130 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 11:02:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:54,470 INFO L93 Difference]: Finished difference Result 131481 states and 480416 transitions. [2022-09-16 11:02:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:02:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 62 [2022-09-16 11:02:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:02:55,618 INFO L225 Difference]: With dead ends: 131481 [2022-09-16 11:02:55,619 INFO L226 Difference]: Without dead ends: 131481 [2022-09-16 11:02:55,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2022-09-16 11:02:55,621 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 771 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:02:55,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 769 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:02:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131481 states. [2022-09-16 11:02:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131481 to 26368. [2022-09-16 11:02:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26368 states, 26024 states have (on average 3.6950891484783277) internal successors, (96161), 26367 states have internal predecessors, (96161), 0 states have call successors, (0), 0 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 11:02:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26368 states to 26368 states and 96161 transitions. [2022-09-16 11:02:58,102 INFO L78 Accepts]: Start accepts. Automaton has 26368 states and 96161 transitions. Word has length 62 [2022-09-16 11:02:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:02:58,102 INFO L495 AbstractCegarLoop]: Abstraction has 26368 states and 96161 transitions. [2022-09-16 11:02:58,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 11:02:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26368 states and 96161 transitions. [2022-09-16 11:02:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-09-16 11:02:58,104 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:02:58,104 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] [2022-09-16 11:02:58,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-16 11:02:58,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:58,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:02:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:02:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1550103327, now seen corresponding path program 1 times [2022-09-16 11:02:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:02:58,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020624887] [2022-09-16 11:02:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:02:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:02:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:02:58,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020624887] [2022-09-16 11:02:58,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020624887] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:02:58,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164207280] [2022-09-16 11:02:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:58,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:58,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:02:58,402 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 11:02:58,405 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 11:02:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:58,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:02:58,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:02:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:02:58,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:02:58,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164207280] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:02:58,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:02:58,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 11:02:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50500566] [2022-09-16 11:02:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:02:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:02:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:02:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 11:02:58,579 INFO L87 Difference]: Start difference. First operand 26368 states and 96161 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 11:02:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:59,400 INFO L93 Difference]: Finished difference Result 52644 states and 192221 transitions. [2022-09-16 11:02:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:02:59,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-09-16 11:02:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:00,027 INFO L225 Difference]: With dead ends: 52644 [2022-09-16 11:03:00,028 INFO L226 Difference]: Without dead ends: 52644 [2022-09-16 11:03:00,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 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 11:03:00,029 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 193 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:00,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 545 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52644 states. [2022-09-16 11:03:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52644 to 26367. [2022-09-16 11:03:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26367 states, 26024 states have (on average 3.6949738702735937) internal successors, (96158), 26366 states have internal predecessors, (96158), 0 states have call successors, (0), 0 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 11:03:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26367 states to 26367 states and 96158 transitions. [2022-09-16 11:03:01,004 INFO L78 Accepts]: Start accepts. Automaton has 26367 states and 96158 transitions. Word has length 63 [2022-09-16 11:03:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:01,004 INFO L495 AbstractCegarLoop]: Abstraction has 26367 states and 96158 transitions. [2022-09-16 11:03:01,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 11:03:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26367 states and 96158 transitions. [2022-09-16 11:03:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-09-16 11:03:01,005 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:01,005 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] [2022-09-16 11:03:01,035 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 11:03:01,229 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,SelfDestructingSolverStorable2 [2022-09-16 11:03:01,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2139722390, now seen corresponding path program 1 times [2022-09-16 11:03:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:01,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595511327] [2022-09-16 11:03:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:01,355 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 11:03:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:01,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595511327] [2022-09-16 11:03:01,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595511327] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:01,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:01,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 11:03:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544897726] [2022-09-16 11:03:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 11:03:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 11:03:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 11:03:01,357 INFO L87 Difference]: Start difference. First operand 26367 states and 96158 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 11:03:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:02,070 INFO L93 Difference]: Finished difference Result 34314 states and 123263 transitions. [2022-09-16 11:03:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 11:03:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-09-16 11:03:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:02,262 INFO L225 Difference]: With dead ends: 34314 [2022-09-16 11:03:02,263 INFO L226 Difference]: Without dead ends: 34242 [2022-09-16 11:03:02,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-09-16 11:03:02,264 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 597 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:02,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 496 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34242 states. [2022-09-16 11:03:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34242 to 29130. [2022-09-16 11:03:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29130 states, 28787 states have (on average 3.692465348942231) internal successors, (106295), 29129 states have internal predecessors, (106295), 0 states have call successors, (0), 0 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 11:03:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29130 states to 29130 states and 106295 transitions. [2022-09-16 11:03:03,585 INFO L78 Accepts]: Start accepts. Automaton has 29130 states and 106295 transitions. Word has length 66 [2022-09-16 11:03:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:03,588 INFO L495 AbstractCegarLoop]: Abstraction has 29130 states and 106295 transitions. [2022-09-16 11:03:03,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 11:03:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 29130 states and 106295 transitions. [2022-09-16 11:03:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-09-16 11:03:03,596 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:03,597 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] [2022-09-16 11:03:03,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 11:03:03,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2003004642, now seen corresponding path program 1 times [2022-09-16 11:03:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289509938] [2022-09-16 11:03:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:03,793 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 11:03:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289509938] [2022-09-16 11:03:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289509938] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:03,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:03,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 11:03:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204171036] [2022-09-16 11:03:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:03,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 11:03:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 11:03:03,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-16 11:03:03,801 INFO L87 Difference]: Start difference. First operand 29130 states and 106295 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 11:03:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:04,299 INFO L93 Difference]: Finished difference Result 28470 states and 102773 transitions. [2022-09-16 11:03:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 11:03:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-09-16 11:03:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:04,491 INFO L225 Difference]: With dead ends: 28470 [2022-09-16 11:03:04,491 INFO L226 Difference]: Without dead ends: 28332 [2022-09-16 11:03:04,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:03:04,493 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 644 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:04,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 626 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28332 states. [2022-09-16 11:03:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28332 to 27558. [2022-09-16 11:03:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27558 states, 27215 states have (on average 3.6788903178394268) internal successors, (100121), 27557 states have internal predecessors, (100121), 0 states have call successors, (0), 0 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 11:03:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27558 states to 27558 states and 100121 transitions. [2022-09-16 11:03:05,745 INFO L78 Accepts]: Start accepts. Automaton has 27558 states and 100121 transitions. Word has length 72 [2022-09-16 11:03:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:05,746 INFO L495 AbstractCegarLoop]: Abstraction has 27558 states and 100121 transitions. [2022-09-16 11:03:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 11:03:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27558 states and 100121 transitions. [2022-09-16 11:03:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:05,748 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:05,748 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] [2022-09-16 11:03:05,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 11:03:05,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1306317359, now seen corresponding path program 1 times [2022-09-16 11:03:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:05,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819047623] [2022-09-16 11:03:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:06,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819047623] [2022-09-16 11:03:06,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819047623] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:06,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636371270] [2022-09-16 11:03:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:06,101 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 11:03:06,103 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 11:03:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:06,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 25 conjunts are in the unsatisfiable core [2022-09-16 11:03:06,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:06,393 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 11 treesize of output 7 [2022-09-16 11:03:06,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:06,548 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 14 treesize of output 16 [2022-09-16 11:03:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:06,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:06,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:03:06,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:06,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:06,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:06,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:06,739 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-09-16 11:03:06,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:06,747 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 32 [2022-09-16 11:03:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:06,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636371270] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:06,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:06,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-09-16 11:03:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530984654] [2022-09-16 11:03:06,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:06,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-16 11:03:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-16 11:03:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=827, Unknown=4, NotChecked=244, Total=1190 [2022-09-16 11:03:06,927 INFO L87 Difference]: Start difference. First operand 27558 states and 100121 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 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 11:03:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:08,802 INFO L93 Difference]: Finished difference Result 42562 states and 150352 transitions. [2022-09-16 11:03:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:09,035 INFO L225 Difference]: With dead ends: 42562 [2022-09-16 11:03:09,035 INFO L226 Difference]: Without dead ends: 42562 [2022-09-16 11:03:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1741, Unknown=4, NotChecked=364, Total=2450 [2022-09-16 11:03:09,037 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1119 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 972 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:09,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 2824 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1089 Invalid, 0 Unknown, 972 Unchecked, 0.6s Time] [2022-09-16 11:03:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42562 states. [2022-09-16 11:03:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42562 to 27588. [2022-09-16 11:03:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27588 states, 27245 states have (on average 3.677225178931914) internal successors, (100186), 27587 states have internal predecessors, (100186), 0 states have call successors, (0), 0 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 11:03:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27588 states to 27588 states and 100186 transitions. [2022-09-16 11:03:10,238 INFO L78 Accepts]: Start accepts. Automaton has 27588 states and 100186 transitions. Word has length 75 [2022-09-16 11:03:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:10,239 INFO L495 AbstractCegarLoop]: Abstraction has 27588 states and 100186 transitions. [2022-09-16 11:03:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 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 11:03:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 27588 states and 100186 transitions. [2022-09-16 11:03:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:10,240 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:10,240 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] [2022-09-16 11:03:10,266 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 11:03:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:10,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1306317358, now seen corresponding path program 1 times [2022-09-16 11:03:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736505496] [2022-09-16 11:03:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:03:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736505496] [2022-09-16 11:03:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736505496] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:10,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:10,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:03:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240095001] [2022-09-16 11:03:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:10,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:03:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:03:10,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:03:10,554 INFO L87 Difference]: Start difference. First operand 27588 states and 100186 transitions. Second operand has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 11:03:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:10,846 INFO L93 Difference]: Finished difference Result 39750 states and 144264 transitions. [2022-09-16 11:03:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:03:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:11,082 INFO L225 Difference]: With dead ends: 39750 [2022-09-16 11:03:11,082 INFO L226 Difference]: Without dead ends: 39750 [2022-09-16 11:03:11,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:03:11,084 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:11,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 191 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39750 states. [2022-09-16 11:03:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39750 to 30408. [2022-09-16 11:03:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30408 states, 30065 states have (on average 3.817129552635955) internal successors, (114762), 30407 states have internal predecessors, (114762), 0 states have call successors, (0), 0 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 11:03:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30408 states to 30408 states and 114762 transitions. [2022-09-16 11:03:12,428 INFO L78 Accepts]: Start accepts. Automaton has 30408 states and 114762 transitions. Word has length 75 [2022-09-16 11:03:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:12,429 INFO L495 AbstractCegarLoop]: Abstraction has 30408 states and 114762 transitions. [2022-09-16 11:03:12,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 11:03:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30408 states and 114762 transitions. [2022-09-16 11:03:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:12,430 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:12,430 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] [2022-09-16 11:03:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 11:03:12,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1306317362, now seen corresponding path program 1 times [2022-09-16 11:03:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:12,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845442847] [2022-09-16 11:03:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845442847] [2022-09-16 11:03:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845442847] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:12,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102830830] [2022-09-16 11:03:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:12,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:12,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:12,697 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 11:03:12,698 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 11:03:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:12,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-09-16 11:03:12,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:12,943 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 11 treesize of output 7 [2022-09-16 11:03:13,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:13,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:03:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:13,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:13,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:13,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:13,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:13,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:13,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:13,316 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-16 11:03:13,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:13,324 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 38 treesize of output 36 [2022-09-16 11:03:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:13,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102830830] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:13,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:13,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-09-16 11:03:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852420585] [2022-09-16 11:03:13,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:13,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-16 11:03:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-16 11:03:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=827, Unknown=4, NotChecked=244, Total=1190 [2022-09-16 11:03:13,505 INFO L87 Difference]: Start difference. First operand 30408 states and 114762 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 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 11:03:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:15,120 INFO L93 Difference]: Finished difference Result 45367 states and 164908 transitions. [2022-09-16 11:03:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:15,330 INFO L225 Difference]: With dead ends: 45367 [2022-09-16 11:03:15,330 INFO L226 Difference]: Without dead ends: 45367 [2022-09-16 11:03:15,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1741, Unknown=4, NotChecked=364, Total=2450 [2022-09-16 11:03:15,332 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1370 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:15,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 2334 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 878 Invalid, 0 Unknown, 873 Unchecked, 0.5s Time] [2022-09-16 11:03:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45367 states. [2022-09-16 11:03:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45367 to 30408. [2022-09-16 11:03:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30408 states, 30065 states have (on average 3.816963246299684) internal successors, (114757), 30407 states have internal predecessors, (114757), 0 states have call successors, (0), 0 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 11:03:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30408 states to 30408 states and 114757 transitions. [2022-09-16 11:03:16,674 INFO L78 Accepts]: Start accepts. Automaton has 30408 states and 114757 transitions. Word has length 75 [2022-09-16 11:03:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:16,674 INFO L495 AbstractCegarLoop]: Abstraction has 30408 states and 114757 transitions. [2022-09-16 11:03:16,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 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 11:03:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30408 states and 114757 transitions. [2022-09-16 11:03:16,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-09-16 11:03:16,676 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:16,676 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 11:03:16,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-16 11:03:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:16,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash 199133732, now seen corresponding path program 1 times [2022-09-16 11:03:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252575412] [2022-09-16 11:03:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:03:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:16,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252575412] [2022-09-16 11:03:16,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252575412] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:16,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:16,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:03:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387874463] [2022-09-16 11:03:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:16,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:03:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:03:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:03:16,948 INFO L87 Difference]: Start difference. First operand 30408 states and 114757 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 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 11:03:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:17,413 INFO L93 Difference]: Finished difference Result 46800 states and 170239 transitions. [2022-09-16 11:03:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:03:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 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 11:03:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:17,948 INFO L225 Difference]: With dead ends: 46800 [2022-09-16 11:03:17,948 INFO L226 Difference]: Without dead ends: 46800 [2022-09-16 11:03:17,949 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 11:03:17,950 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 169 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:17,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 520 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46800 states. [2022-09-16 11:03:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46800 to 36048. [2022-09-16 11:03:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36048 states, 35705 states have (on average 3.7961349950987255) internal successors, (135541), 36047 states have internal predecessors, (135541), 0 states have call successors, (0), 0 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 11:03:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36048 states to 36048 states and 135541 transitions. [2022-09-16 11:03:19,100 INFO L78 Accepts]: Start accepts. Automaton has 36048 states and 135541 transitions. Word has length 78 [2022-09-16 11:03:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:19,101 INFO L495 AbstractCegarLoop]: Abstraction has 36048 states and 135541 transitions. [2022-09-16 11:03:19,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 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 11:03:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 36048 states and 135541 transitions. [2022-09-16 11:03:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-09-16 11:03:19,102 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:19,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] [2022-09-16 11:03:19,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 11:03:19,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1800110982, now seen corresponding path program 1 times [2022-09-16 11:03:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:19,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177894312] [2022-09-16 11:03:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:19,254 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 11:03:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:19,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177894312] [2022-09-16 11:03:19,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177894312] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:19,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:19,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 11:03:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497033250] [2022-09-16 11:03:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:19,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 11:03:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 11:03:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-09-16 11:03:19,257 INFO L87 Difference]: Start difference. First operand 36048 states and 135541 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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 11:03:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:20,209 INFO L93 Difference]: Finished difference Result 35288 states and 132685 transitions. [2022-09-16 11:03:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 11:03:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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 11:03:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:20,363 INFO L225 Difference]: With dead ends: 35288 [2022-09-16 11:03:20,363 INFO L226 Difference]: Without dead ends: 34857 [2022-09-16 11:03:20,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:03:20,364 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 580 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:20,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 778 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:03:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2022-09-16 11:03:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 34857. [2022-09-16 11:03:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34857 states, 34514 states have (on average 3.8122790751579068) internal successors, (131577), 34856 states have internal predecessors, (131577), 0 states have call successors, (0), 0 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 11:03:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34857 states to 34857 states and 131577 transitions. [2022-09-16 11:03:21,838 INFO L78 Accepts]: Start accepts. Automaton has 34857 states and 131577 transitions. Word has length 78 [2022-09-16 11:03:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:21,838 INFO L495 AbstractCegarLoop]: Abstraction has 34857 states and 131577 transitions. [2022-09-16 11:03:21,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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 11:03:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34857 states and 131577 transitions. [2022-09-16 11:03:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-09-16 11:03:21,839 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:21,839 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] [2022-09-16 11:03:21,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 11:03:21,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1438493921, now seen corresponding path program 1 times [2022-09-16 11:03:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:21,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381264377] [2022-09-16 11:03:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381264377] [2022-09-16 11:03:22,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381264377] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087676557] [2022-09-16 11:03:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:22,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:22,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:22,216 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 11:03:22,241 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 11:03:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:22,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 11:03:22,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:22,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:03:22,375 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:03:22,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 11:03:22,415 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:03:22,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:03:22,779 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:03:22,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2022-09-16 11:03:22,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:03:23,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:03:23,122 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 14 treesize of output 16 [2022-09-16 11:03:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:23,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:23,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:03:23,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:03:23,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:03:23,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:23,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:23,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:23,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 11:03:23,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:23,287 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 64 treesize of output 62 [2022-09-16 11:03:23,290 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 48 treesize of output 44 [2022-09-16 11:03:23,295 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 22 treesize of output 20 [2022-09-16 11:03:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087676557] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:23,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:23,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2022-09-16 11:03:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837608341] [2022-09-16 11:03:23,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:23,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-09-16 11:03:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-09-16 11:03:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1072, Unknown=6, NotChecked=426, Total=1640 [2022-09-16 11:03:23,721 INFO L87 Difference]: Start difference. First operand 34857 states and 131577 transitions. Second operand has 41 states, 40 states have (on average 5.05) internal successors, (202), 41 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 11:03:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:25,418 INFO L93 Difference]: Finished difference Result 57291 states and 208099 transitions. [2022-09-16 11:03:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:03:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.05) internal successors, (202), 41 states have internal predecessors, (202), 0 states have call successors, (0), 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 80 [2022-09-16 11:03:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:25,920 INFO L225 Difference]: With dead ends: 57291 [2022-09-16 11:03:25,920 INFO L226 Difference]: Without dead ends: 57291 [2022-09-16 11:03:25,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 133 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=2157, Unknown=6, NotChecked=606, Total=3080 [2022-09-16 11:03:25,921 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 385 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1139 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:25,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 3173 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1137 Invalid, 0 Unknown, 1139 Unchecked, 0.5s Time] [2022-09-16 11:03:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57291 states. [2022-09-16 11:03:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57291 to 35130. [2022-09-16 11:03:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35130 states, 34787 states have (on average 3.811050104924253) internal successors, (132575), 35129 states have internal predecessors, (132575), 0 states have call successors, (0), 0 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 11:03:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35130 states to 35130 states and 132575 transitions. [2022-09-16 11:03:27,112 INFO L78 Accepts]: Start accepts. Automaton has 35130 states and 132575 transitions. Word has length 80 [2022-09-16 11:03:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:27,112 INFO L495 AbstractCegarLoop]: Abstraction has 35130 states and 132575 transitions. [2022-09-16 11:03:27,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.05) internal successors, (202), 41 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 11:03:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35130 states and 132575 transitions. [2022-09-16 11:03:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-09-16 11:03:27,113 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:27,113 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] [2022-09-16 11:03:27,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-16 11:03:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-09-16 11:03:27,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1438493918, now seen corresponding path program 1 times [2022-09-16 11:03:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:27,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411320303] [2022-09-16 11:03:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411320303] [2022-09-16 11:03:27,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411320303] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083391507] [2022-09-16 11:03:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:27,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:27,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 11:03:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:27,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:03:27,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:27,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:03:27,794 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:03:27,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-16 11:03:28,270 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:03:28,271 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 15 treesize of output 15 [2022-09-16 11:03:28,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:03:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:28,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:03:28,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:03:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:28,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:28,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-09-16 11:03:28,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:28,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:28,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:28,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:28,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:28,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:28,821 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 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 11:03:28,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:28,831 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 72 treesize of output 70 [2022-09-16 11:03:28,839 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 56 treesize of output 52 [2022-09-16 11:03:28,844 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 26 treesize of output 24 [2022-09-16 11:03:29,233 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 8 [2022-09-16 11:03:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:29,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083391507] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:29,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:29,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-09-16 11:03:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424506533] [2022-09-16 11:03:29,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-09-16 11:03:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-09-16 11:03:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1137, Unknown=6, NotChecked=438, Total=1722 [2022-09-16 11:03:29,260 INFO L87 Difference]: Start difference. First operand 35130 states and 132575 transitions. Second operand has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 11:03:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:30,996 INFO L93 Difference]: Finished difference Result 57200 states and 207827 transitions. [2022-09-16 11:03:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 80 [2022-09-16 11:03:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:31,264 INFO L225 Difference]: With dead ends: 57200 [2022-09-16 11:03:31,264 INFO L226 Difference]: Without dead ends: 57200 [2022-09-16 11:03:31,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 132 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=2114, Unknown=6, NotChecked=606, Total=3080 [2022-09-16 11:03:31,265 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 503 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1261 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:31,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3009 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1148 Invalid, 0 Unknown, 1261 Unchecked, 0.6s Time] [2022-09-16 11:03:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57200 states. [2022-09-16 11:03:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57200 to 35130. [2022-09-16 11:03:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35130 states, 34787 states have (on average 3.8084341851841206) internal successors, (132484), 35129 states have internal predecessors, (132484), 0 states have call successors, (0), 0 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 11:03:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35130 states to 35130 states and 132484 transitions. [2022-09-16 11:03:32,706 INFO L78 Accepts]: Start accepts. Automaton has 35130 states and 132484 transitions. Word has length 80 [2022-09-16 11:03:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:32,707 INFO L495 AbstractCegarLoop]: Abstraction has 35130 states and 132484 transitions. [2022-09-16 11:03:32,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 11:03:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35130 states and 132484 transitions. [2022-09-16 11:03:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:03:32,708 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:32,708 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] [2022-09-16 11:03:32,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:32,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1101321659, now seen corresponding path program 1 times [2022-09-16 11:03:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:32,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036077007] [2022-09-16 11:03:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:33,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036077007] [2022-09-16 11:03:33,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036077007] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:33,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135954116] [2022-09-16 11:03:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:33,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:33,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:33,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:33,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 11:03:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:33,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:03:33,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:33,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:03:33,339 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:03:33,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-16 11:03:33,465 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:03:33,465 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 15 treesize of output 15 [2022-09-16 11:03:33,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:03:33,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:33,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:03:33,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:03:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:33,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:33,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:33,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_274 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:33,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_274 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:33,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_274 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:33,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_274 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:33,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:33,909 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 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 11:03:33,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:33,916 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 142 treesize of output 136 [2022-09-16 11:03:33,922 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 61 treesize of output 57 [2022-09-16 11:03:33,929 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 118 treesize of output 110 [2022-09-16 11:03:34,329 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 8 [2022-09-16 11:03:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:34,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135954116] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:34,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:34,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-09-16 11:03:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206228855] [2022-09-16 11:03:34,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:34,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-09-16 11:03:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-09-16 11:03:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1197, Unknown=5, NotChecked=370, Total=1722 [2022-09-16 11:03:34,350 INFO L87 Difference]: Start difference. First operand 35130 states and 132484 transitions. Second operand has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:03:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:36,035 INFO L93 Difference]: Finished difference Result 57006 states and 207793 transitions. [2022-09-16 11:03:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 81 [2022-09-16 11:03:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:36,536 INFO L225 Difference]: With dead ends: 57006 [2022-09-16 11:03:36,536 INFO L226 Difference]: Without dead ends: 57006 [2022-09-16 11:03:36,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=2195, Unknown=5, NotChecked=510, Total=3080 [2022-09-16 11:03:36,537 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 533 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1008 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:36,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 3304 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1274 Invalid, 0 Unknown, 1008 Unchecked, 0.8s Time] [2022-09-16 11:03:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57006 states. [2022-09-16 11:03:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57006 to 35601. [2022-09-16 11:03:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35601 states, 35258 states have (on average 3.8079584775086506) internal successors, (134261), 35600 states have internal predecessors, (134261), 0 states have call successors, (0), 0 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 11:03:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 134261 transitions. [2022-09-16 11:03:37,689 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 134261 transitions. Word has length 81 [2022-09-16 11:03:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:37,689 INFO L495 AbstractCegarLoop]: Abstraction has 35601 states and 134261 transitions. [2022-09-16 11:03:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:03:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 134261 transitions. [2022-09-16 11:03:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:03:37,690 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:37,691 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] [2022-09-16 11:03:37,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:37,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1101321656, now seen corresponding path program 1 times [2022-09-16 11:03:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:37,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34223529] [2022-09-16 11:03:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34223529] [2022-09-16 11:03:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34223529] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037356615] [2022-09-16 11:03:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:38,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:38,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 11:03:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:38,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-09-16 11:03:38,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:38,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:03:38,591 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:03:38,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 11:03:38,628 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:03:38,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:03:38,932 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:03:38,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2022-09-16 11:03:39,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:03:39,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:03:39,193 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 14 treesize of output 16 [2022-09-16 11:03:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:39,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:39,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:03:39,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:03:39,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967296)) is different from false [2022-09-16 11:03:39,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296)) is different from false [2022-09-16 11:03:39,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:03:39,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:39,360 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 11:03:39,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:39,367 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 64 treesize of output 62 [2022-09-16 11:03:39,370 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 48 treesize of output 44 [2022-09-16 11:03:39,374 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 22 treesize of output 20 [2022-09-16 11:03:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:39,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037356615] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:39,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:39,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2022-09-16 11:03:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857301850] [2022-09-16 11:03:39,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:39,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-09-16 11:03:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-09-16 11:03:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1130, Unknown=5, NotChecked=360, Total=1640 [2022-09-16 11:03:39,765 INFO L87 Difference]: Start difference. First operand 35601 states and 134261 transitions. Second operand has 41 states, 40 states have (on average 5.125) internal successors, (205), 41 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 11:03:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:41,145 INFO L93 Difference]: Finished difference Result 56886 states and 207428 transitions. [2022-09-16 11:03:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:03:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.125) internal successors, (205), 41 states have internal predecessors, (205), 0 states have call successors, (0), 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 81 [2022-09-16 11:03:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:41,391 INFO L225 Difference]: With dead ends: 56886 [2022-09-16 11:03:41,391 INFO L226 Difference]: Without dead ends: 56886 [2022-09-16 11:03:41,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=365, Invalid=2100, Unknown=5, NotChecked=500, Total=2970 [2022-09-16 11:03:41,392 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 551 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1279 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:41,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 2891 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1071 Invalid, 0 Unknown, 1279 Unchecked, 0.5s Time] [2022-09-16 11:03:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56886 states. [2022-09-16 11:03:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56886 to 35601. [2022-09-16 11:03:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35601 states, 35258 states have (on average 3.804554994611152) internal successors, (134141), 35600 states have internal predecessors, (134141), 0 states have call successors, (0), 0 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 11:03:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 134141 transitions. [2022-09-16 11:03:42,822 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 134141 transitions. Word has length 81 [2022-09-16 11:03:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:42,822 INFO L495 AbstractCegarLoop]: Abstraction has 35601 states and 134141 transitions. [2022-09-16 11:03:42,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.125) internal successors, (205), 41 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 11:03:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 134141 transitions. [2022-09-16 11:03:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:03:42,823 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:42,823 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] [2022-09-16 11:03:42,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:43,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-09-16 11:03:43,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1101321655, now seen corresponding path program 1 times [2022-09-16 11:03:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:43,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238098079] [2022-09-16 11:03:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:03:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:43,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238098079] [2022-09-16 11:03:43,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238098079] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:43,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:43,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:03:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697795583] [2022-09-16 11:03:43,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:43,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:03:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:43,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:03:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:03:43,064 INFO L87 Difference]: Start difference. First operand 35601 states and 134141 transitions. Second operand has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 11:03:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:43,432 INFO L93 Difference]: Finished difference Result 44616 states and 167680 transitions. [2022-09-16 11:03:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:03:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-09-16 11:03:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:43,965 INFO L225 Difference]: With dead ends: 44616 [2022-09-16 11:03:43,965 INFO L226 Difference]: Without dead ends: 44616 [2022-09-16 11:03:43,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:03:43,966 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:43,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44616 states. [2022-09-16 11:03:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44616 to 41178. [2022-09-16 11:03:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41178 states, 40835 states have (on average 3.8679564099424515) internal successors, (157948), 41177 states have internal predecessors, (157948), 0 states have call successors, (0), 0 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 11:03:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41178 states to 41178 states and 157948 transitions. [2022-09-16 11:03:45,412 INFO L78 Accepts]: Start accepts. Automaton has 41178 states and 157948 transitions. Word has length 81 [2022-09-16 11:03:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:45,413 INFO L495 AbstractCegarLoop]: Abstraction has 41178 states and 157948 transitions. [2022-09-16 11:03:45,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 11:03:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41178 states and 157948 transitions. [2022-09-16 11:03:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-09-16 11:03:45,414 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:45,414 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:03:45,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-16 11:03:45,414 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1713081539, now seen corresponding path program 1 times [2022-09-16 11:03:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:45,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221918273] [2022-09-16 11:03:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:45,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221918273] [2022-09-16 11:03:45,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221918273] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:45,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185283370] [2022-09-16 11:03:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:45,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:45,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:45,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:45,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 11:03:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:45,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:03:45,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:45,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:46,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185283370] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:46,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:46,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-09-16 11:03:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62841236] [2022-09-16 11:03:46,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:46,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-09-16 11:03:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-09-16 11:03:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-09-16 11:03:46,406 INFO L87 Difference]: Start difference. First operand 41178 states and 157948 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 11:03:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:47,577 INFO L93 Difference]: Finished difference Result 71385 states and 269004 transitions. [2022-09-16 11:03:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 11:03:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 83 [2022-09-16 11:03:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:48,303 INFO L225 Difference]: With dead ends: 71385 [2022-09-16 11:03:48,303 INFO L226 Difference]: Without dead ends: 71133 [2022-09-16 11:03:48,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 11:03:48,304 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 1716 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:48,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 2107 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:03:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71133 states. [2022-09-16 11:03:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71133 to 56410. [2022-09-16 11:03:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56410 states, 56067 states have (on average 3.9264451459860523) internal successors, (220144), 56409 states have internal predecessors, (220144), 0 states have call successors, (0), 0 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 11:03:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56410 states to 56410 states and 220144 transitions. [2022-09-16 11:03:50,388 INFO L78 Accepts]: Start accepts. Automaton has 56410 states and 220144 transitions. Word has length 83 [2022-09-16 11:03:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:50,388 INFO L495 AbstractCegarLoop]: Abstraction has 56410 states and 220144 transitions. [2022-09-16 11:03:50,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 11:03:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56410 states and 220144 transitions. [2022-09-16 11:03:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-09-16 11:03:50,389 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:50,389 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:03:50,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:50,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 11:03:50,590 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash 5960010, now seen corresponding path program 2 times [2022-09-16 11:03:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:50,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591565524] [2022-09-16 11:03:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:50,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591565524] [2022-09-16 11:03:50,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591565524] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:50,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937331005] [2022-09-16 11:03:50,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:03:50,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:50,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:50,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:50,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 11:03:51,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:03:51,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:03:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjunts are in the unsatisfiable core [2022-09-16 11:03:51,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:51,118 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 15 treesize of output 11 [2022-09-16 11:03:51,230 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:03:51,230 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 23 treesize of output 22 [2022-09-16 11:03:51,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:51,373 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 14 treesize of output 16 [2022-09-16 11:03:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:51,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:51,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:03:51,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:51,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:51,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:51,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 Int) (v_ArrVal_381 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:51,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int)) (or (forall ((v_ArrVal_379 Int) (v_ArrVal_381 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|)))) is different from false [2022-09-16 11:03:51,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_381 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 11:03:51,967 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:03:51,968 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 29 treesize of output 35 [2022-09-16 11:03:51,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:51,973 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 32 [2022-09-16 11:03:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:03:52,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937331005] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:52,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:52,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-09-16 11:03:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974817925] [2022-09-16 11:03:52,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:52,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-09-16 11:03:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-09-16 11:03:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1132, Unknown=7, NotChecked=518, Total=1806 [2022-09-16 11:03:52,111 INFO L87 Difference]: Start difference. First operand 56410 states and 220144 transitions. Second operand has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:03:52,565 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_379 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_381 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647)) is different from false [2022-09-16 11:03:52,866 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_379 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_381 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:03:54,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int)) (or (forall ((v_ArrVal_379 Int) (v_ArrVal_381 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_379)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|)))) (<= (select .cse0 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647))) is different from false [2022-09-16 11:03:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:56,532 INFO L93 Difference]: Finished difference Result 87171 states and 330918 transitions. [2022-09-16 11:03:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:03:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 84 [2022-09-16 11:03:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:56,992 INFO L225 Difference]: With dead ends: 87171 [2022-09-16 11:03:56,993 INFO L226 Difference]: Without dead ends: 87171 [2022-09-16 11:03:56,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=363, Invalid=2217, Unknown=10, NotChecked=1070, Total=3660 [2022-09-16 11:03:56,994 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 781 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1486 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:56,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2262 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 990 Invalid, 0 Unknown, 1486 Unchecked, 0.4s Time] [2022-09-16 11:03:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87171 states. [2022-09-16 11:03:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87171 to 56410. [2022-09-16 11:03:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56410 states, 56067 states have (on average 3.926355966968092) internal successors, (220139), 56409 states have internal predecessors, (220139), 0 states have call successors, (0), 0 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 11:03:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56410 states to 56410 states and 220139 transitions. [2022-09-16 11:03:59,514 INFO L78 Accepts]: Start accepts. Automaton has 56410 states and 220139 transitions. Word has length 84 [2022-09-16 11:03:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:59,514 INFO L495 AbstractCegarLoop]: Abstraction has 56410 states and 220139 transitions. [2022-09-16 11:03:59,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:03:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 56410 states and 220139 transitions. [2022-09-16 11:03:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-09-16 11:03:59,515 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:59,515 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:03:59,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:59,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-09-16 11:03:59,716 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 5960007, now seen corresponding path program 2 times [2022-09-16 11:03:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:59,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248569580] [2022-09-16 11:03:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248569580] [2022-09-16 11:03:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248569580] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643622901] [2022-09-16 11:03:59,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:03:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:59,979 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:03:59,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 11:04:00,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:04:00,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:04:00,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-16 11:04:00,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:00,202 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 15 treesize of output 11 [2022-09-16 11:04:00,320 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:04:00,321 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 25 treesize of output 24 [2022-09-16 11:04:00,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:00,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:00,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:00,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:00,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:00,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:00,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:00,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:00,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36|)) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) is different from false [2022-09-16 11:04:00,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int) (v_ArrVal_413 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) is different from false [2022-09-16 11:04:00,683 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:04:00,684 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 31 treesize of output 37 [2022-09-16 11:04:00,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:00,691 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 38 treesize of output 36 [2022-09-16 11:04:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:04:00,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643622901] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:00,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:00,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-09-16 11:04:00,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207199410] [2022-09-16 11:04:00,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:00,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-09-16 11:04:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-09-16 11:04:00,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1132, Unknown=7, NotChecked=518, Total=1806 [2022-09-16 11:04:00,829 INFO L87 Difference]: Start difference. First operand 56410 states and 220139 transitions. Second operand has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:04:01,332 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_414 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int) (v_ArrVal_413 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:04:01,633 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_414 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int) (v_ArrVal_413 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:04:03,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36|)) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_413)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 11:04:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:05,524 INFO L93 Difference]: Finished difference Result 87166 states and 330908 transitions. [2022-09-16 11:04:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:04:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 84 [2022-09-16 11:04:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:06,011 INFO L225 Difference]: With dead ends: 87166 [2022-09-16 11:04:06,011 INFO L226 Difference]: Without dead ends: 87166 [2022-09-16 11:04:06,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=363, Invalid=2217, Unknown=10, NotChecked=1070, Total=3660 [2022-09-16 11:04:06,012 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 650 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1487 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:06,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2140 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 956 Invalid, 0 Unknown, 1487 Unchecked, 0.4s Time] [2022-09-16 11:04:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87166 states. [2022-09-16 11:04:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87166 to 56410. [2022-09-16 11:04:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56410 states, 56067 states have (on average 3.926266787950131) internal successors, (220134), 56409 states have internal predecessors, (220134), 0 states have call successors, (0), 0 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 11:04:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56410 states to 56410 states and 220134 transitions. [2022-09-16 11:04:08,162 INFO L78 Accepts]: Start accepts. Automaton has 56410 states and 220134 transitions. Word has length 84 [2022-09-16 11:04:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:08,162 INFO L495 AbstractCegarLoop]: Abstraction has 56410 states and 220134 transitions. [2022-09-16 11:04:08,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 11:04:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 56410 states and 220134 transitions. [2022-09-16 11:04:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-09-16 11:04:08,163 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:08,163 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] [2022-09-16 11:04:08,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:08,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-09-16 11:04:08,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -217352254, now seen corresponding path program 1 times [2022-09-16 11:04:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394092943] [2022-09-16 11:04:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:04:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:08,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394092943] [2022-09-16 11:04:08,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394092943] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:04:08,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:04:08,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:04:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120276491] [2022-09-16 11:04:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:04:08,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:04:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:04:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:04:08,731 INFO L87 Difference]: Start difference. First operand 56410 states and 220134 transitions. Second operand has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 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 11:04:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:09,898 INFO L93 Difference]: Finished difference Result 93225 states and 363049 transitions. [2022-09-16 11:04:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:04:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-09-16 11:04:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:10,430 INFO L225 Difference]: With dead ends: 93225 [2022-09-16 11:04:10,430 INFO L226 Difference]: Without dead ends: 93225 [2022-09-16 11:04:10,430 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 11:04:10,431 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 159 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:10,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 508 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:04:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93225 states. [2022-09-16 11:04:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93225 to 71617. [2022-09-16 11:04:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71617 states, 71274 states have (on average 4.079313634705502) internal successors, (290749), 71616 states have internal predecessors, (290749), 0 states have call successors, (0), 0 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 11:04:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71617 states to 71617 states and 290749 transitions. [2022-09-16 11:04:13,373 INFO L78 Accepts]: Start accepts. Automaton has 71617 states and 290749 transitions. Word has length 84 [2022-09-16 11:04:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:13,373 INFO L495 AbstractCegarLoop]: Abstraction has 71617 states and 290749 transitions. [2022-09-16 11:04:13,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 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 11:04:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 71617 states and 290749 transitions. [2022-09-16 11:04:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:13,375 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:13,375 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] [2022-09-16 11:04:13,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-16 11:04:13,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 130948568, now seen corresponding path program 1 times [2022-09-16 11:04:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058735729] [2022-09-16 11:04:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058735729] [2022-09-16 11:04:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058735729] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172064202] [2022-09-16 11:04:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:13,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:13,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:13,736 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:04:13,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 11:04:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:13,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:04:13,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:13,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:04:13,906 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:04:13,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 11:04:13,952 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:04:13,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:04:14,162 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:04:14,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2022-09-16 11:04:14,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:04:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:04:14,976 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 14 treesize of output 16 [2022-09-16 11:04:15,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:15,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:04:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:15,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:15,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:04:15,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:04:15,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:15,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:15,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:15,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:15,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:15,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:15,183 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 11:04:15,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:15,189 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 246 treesize of output 240 [2022-09-16 11:04:15,193 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 226 treesize of output 210 [2022-09-16 11:04:15,199 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 105 treesize of output 101 [2022-09-16 11:04:15,203 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 206 treesize of output 198 [2022-09-16 11:04:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172064202] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:15,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 47 [2022-09-16 11:04:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234206124] [2022-09-16 11:04:15,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:04:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:04:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1507, Unknown=7, NotChecked=588, Total=2256 [2022-09-16 11:04:15,862 INFO L87 Difference]: Start difference. First operand 71617 states and 290749 transitions. Second operand has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 11:04:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:18,442 INFO L93 Difference]: Finished difference Result 117461 states and 454321 transitions. [2022-09-16 11:04:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:04:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 86 [2022-09-16 11:04:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:19,147 INFO L225 Difference]: With dead ends: 117461 [2022-09-16 11:04:19,147 INFO L226 Difference]: Without dead ends: 117461 [2022-09-16 11:04:19,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=407, Invalid=2694, Unknown=7, NotChecked=798, Total=3906 [2022-09-16 11:04:19,149 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 805 mSDsluCounter, 3708 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2037 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:19,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3592 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1203 Invalid, 0 Unknown, 2037 Unchecked, 0.6s Time] [2022-09-16 11:04:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117461 states. [2022-09-16 11:04:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117461 to 71617. [2022-09-16 11:04:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71617 states, 71274 states have (on average 4.052361309874569) internal successors, (288828), 71616 states have internal predecessors, (288828), 0 states have call successors, (0), 0 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 11:04:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71617 states to 71617 states and 288828 transitions. [2022-09-16 11:04:22,717 INFO L78 Accepts]: Start accepts. Automaton has 71617 states and 288828 transitions. Word has length 86 [2022-09-16 11:04:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:22,717 INFO L495 AbstractCegarLoop]: Abstraction has 71617 states and 288828 transitions. [2022-09-16 11:04:22,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 11:04:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 71617 states and 288828 transitions. [2022-09-16 11:04:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:22,719 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:22,719 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] [2022-09-16 11:04:22,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:22,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:22,936 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 130948565, now seen corresponding path program 1 times [2022-09-16 11:04:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172602490] [2022-09-16 11:04:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172602490] [2022-09-16 11:04:23,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172602490] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144994223] [2022-09-16 11:04:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:23,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:23,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:23,265 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:04:23,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-09-16 11:04:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:23,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:04:23,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:23,590 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 11 treesize of output 7 [2022-09-16 11:04:23,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:23,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:23,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:23,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:23,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:23,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:24,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-09-16 11:04:24,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-09-16 11:04:24,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:24,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:24,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:24,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:24,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:24,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:24,101 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 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 11:04:24,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:24,109 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 1106 treesize of output 1076 [2022-09-16 11:04:24,120 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 1062 treesize of output 1046 [2022-09-16 11:04:24,130 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 1046 treesize of output 982 [2022-09-16 11:04:24,138 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 982 treesize of output 950 [2022-09-16 11:04:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:25,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144994223] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:25,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:25,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-09-16 11:04:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090779270] [2022-09-16 11:04:25,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:25,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-16 11:04:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-16 11:04:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1282, Unknown=7, NotChecked=546, Total=1980 [2022-09-16 11:04:25,131 INFO L87 Difference]: Start difference. First operand 71617 states and 288828 transitions. Second operand has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 11:04:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:27,994 INFO L93 Difference]: Finished difference Result 115540 states and 446655 transitions. [2022-09-16 11:04:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:04:27,995 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 86 [2022-09-16 11:04:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:28,664 INFO L225 Difference]: With dead ends: 115540 [2022-09-16 11:04:28,664 INFO L226 Difference]: Without dead ends: 115432 [2022-09-16 11:04:28,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=405, Invalid=2268, Unknown=7, NotChecked=742, Total=3422 [2022-09-16 11:04:28,666 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 2388 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1683 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:28,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 2524 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 955 Invalid, 0 Unknown, 1683 Unchecked, 0.6s Time] [2022-09-16 11:04:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115432 states. [2022-09-16 11:04:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115432 to 71509. [2022-09-16 11:04:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71509 states, 71166 states have (on average 4.024815220751482) internal successors, (286430), 71508 states have internal predecessors, (286430), 0 states have call successors, (0), 0 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 11:04:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71509 states to 71509 states and 286430 transitions. [2022-09-16 11:04:31,942 INFO L78 Accepts]: Start accepts. Automaton has 71509 states and 286430 transitions. Word has length 86 [2022-09-16 11:04:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:31,942 INFO L495 AbstractCegarLoop]: Abstraction has 71509 states and 286430 transitions. [2022-09-16 11:04:31,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 11:04:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 71509 states and 286430 transitions. [2022-09-16 11:04:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:31,944 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:31,945 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] [2022-09-16 11:04:31,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:32,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-09-16 11:04:32,159 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1368095946, now seen corresponding path program 1 times [2022-09-16 11:04:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:32,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426719207] [2022-09-16 11:04:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:32,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426719207] [2022-09-16 11:04:32,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426719207] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:32,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752408414] [2022-09-16 11:04:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:32,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:32,529 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:04:32,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-09-16 11:04:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:32,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:04:32,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:32,910 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 11 treesize of output 7 [2022-09-16 11:04:33,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:33,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:33,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:33,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:33,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:33,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:04:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:33,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:33,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:33,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:33,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:33,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:33,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-09-16 11:04:33,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:33,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:33,422 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 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 11:04:33,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:33,430 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 278 treesize of output 272 [2022-09-16 11:04:33,438 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 130 treesize of output 126 [2022-09-16 11:04:33,443 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 254 treesize of output 246 [2022-09-16 11:04:33,447 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 246 treesize of output 230 [2022-09-16 11:04:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:33,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752408414] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:33,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:33,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-09-16 11:04:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615429752] [2022-09-16 11:04:33,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:33,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-16 11:04:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-16 11:04:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1342, Unknown=6, NotChecked=474, Total=1980 [2022-09-16 11:04:33,940 INFO L87 Difference]: Start difference. First operand 71509 states and 286430 transitions. Second operand has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 11:04:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:37,231 INFO L93 Difference]: Finished difference Result 110820 states and 423804 transitions. [2022-09-16 11:04:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:04:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 86 [2022-09-16 11:04:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:38,619 INFO L225 Difference]: With dead ends: 110820 [2022-09-16 11:04:38,619 INFO L226 Difference]: Without dead ends: 110820 [2022-09-16 11:04:38,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=460, Invalid=2420, Unknown=6, NotChecked=654, Total=3540 [2022-09-16 11:04:38,622 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1540 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1446 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:38,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2761 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1070 Invalid, 0 Unknown, 1446 Unchecked, 0.6s Time] [2022-09-16 11:04:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110820 states. [2022-09-16 11:04:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110820 to 72558. [2022-09-16 11:04:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72558 states, 72215 states have (on average 4.016160077546216) internal successors, (290027), 72557 states have internal predecessors, (290027), 0 states have call successors, (0), 0 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 11:04:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72558 states to 72558 states and 290027 transitions. [2022-09-16 11:04:41,645 INFO L78 Accepts]: Start accepts. Automaton has 72558 states and 290027 transitions. Word has length 86 [2022-09-16 11:04:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:41,646 INFO L495 AbstractCegarLoop]: Abstraction has 72558 states and 290027 transitions. [2022-09-16 11:04:41,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 11:04:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72558 states and 290027 transitions. [2022-09-16 11:04:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:41,647 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:41,647 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] [2022-09-16 11:04:41,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:41,848 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1368095949, now seen corresponding path program 1 times [2022-09-16 11:04:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:41,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005088247] [2022-09-16 11:04:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:42,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005088247] [2022-09-16 11:04:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005088247] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132319349] [2022-09-16 11:04:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:42,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:42,142 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:04:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-09-16 11:04:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:42,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 38 conjunts are in the unsatisfiable core [2022-09-16 11:04:42,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:42,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:04:42,287 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:04:42,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-16 11:04:42,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:04:42,428 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 15 treesize of output 15 [2022-09-16 11:04:42,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:04:42,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:42,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:04:42,828 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 14 treesize of output 16 [2022-09-16 11:04:42,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:42,876 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 14 treesize of output 16 [2022-09-16 11:04:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:42,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:42,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_581 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:04:42,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:04:43,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:04:43,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967296)) is different from false [2022-09-16 11:04:43,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296)) is different from false [2022-09-16 11:04:43,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:04:43,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:43,056 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 11:04:43,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:43,063 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 124 treesize of output 122 [2022-09-16 11:04:43,066 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 108 treesize of output 100 [2022-09-16 11:04:43,069 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 100 treesize of output 96 [2022-09-16 11:04:43,073 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 48 treesize of output 46 [2022-09-16 11:04:43,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:04:43,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:04:43,823 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 8 [2022-09-16 11:04:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:43,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132319349] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:43,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:43,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-09-16 11:04:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158040069] [2022-09-16 11:04:43,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:43,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 11:04:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 11:04:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1486, Unknown=6, NotChecked=498, Total=2162 [2022-09-16 11:04:43,851 INFO L87 Difference]: Start difference. First operand 72558 states and 290027 transitions. Second operand has 47 states, 46 states have (on average 4.8478260869565215) internal successors, (223), 47 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 11:04:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:46,074 INFO L93 Difference]: Finished difference Result 109707 states and 419190 transitions. [2022-09-16 11:04:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:04:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.8478260869565215) internal successors, (223), 47 states have internal predecessors, (223), 0 states have call successors, (0), 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 86 [2022-09-16 11:04:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:47,079 INFO L225 Difference]: With dead ends: 109707 [2022-09-16 11:04:47,080 INFO L226 Difference]: Without dead ends: 109707 [2022-09-16 11:04:47,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=438, Invalid=2660, Unknown=6, NotChecked=678, Total=3782 [2022-09-16 11:04:47,081 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 882 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1553 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:47,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 3104 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1228 Invalid, 0 Unknown, 1553 Unchecked, 0.5s Time] [2022-09-16 11:04:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109707 states. [2022-09-16 11:04:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109707 to 72428. [2022-09-16 11:04:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72428 states, 72085 states have (on average 3.9966844697232435) internal successors, (288101), 72427 states have internal predecessors, (288101), 0 states have call successors, (0), 0 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 11:04:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72428 states to 72428 states and 288101 transitions. [2022-09-16 11:04:50,109 INFO L78 Accepts]: Start accepts. Automaton has 72428 states and 288101 transitions. Word has length 86 [2022-09-16 11:04:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:50,109 INFO L495 AbstractCegarLoop]: Abstraction has 72428 states and 288101 transitions. [2022-09-16 11:04:50,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.8478260869565215) internal successors, (223), 47 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 11:04:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72428 states and 288101 transitions. [2022-09-16 11:04:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-09-16 11:04:50,111 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:50,112 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] [2022-09-16 11:04:50,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:50,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:50,320 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -537339295, now seen corresponding path program 1 times [2022-09-16 11:04:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:50,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147562022] [2022-09-16 11:04:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147562022] [2022-09-16 11:04:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147562022] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164222018] [2022-09-16 11:04:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:50,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:50,965 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:04:50,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-09-16 11:04:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:51,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:04:51,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:51,355 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 15 treesize of output 11 [2022-09-16 11:04:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:52,529 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 20 treesize of output 22 [2022-09-16 11:04:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:52,650 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 20 treesize of output 22 [2022-09-16 11:04:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:52,748 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 20 treesize of output 22 [2022-09-16 11:04:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:52,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:53,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:53,969 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 1 case distinctions, treesize of input 34 treesize of output 35 [2022-09-16 11:04:53,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:53,977 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 172 treesize of output 168 [2022-09-16 11:04:53,982 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 152 treesize of output 128 [2022-09-16 11:04:53,985 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 128 treesize of output 116 [2022-09-16 11:04:53,990 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 60 treesize of output 54 [2022-09-16 11:04:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:55,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164222018] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:55,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:55,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 68 [2022-09-16 11:04:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571800773] [2022-09-16 11:04:55,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:55,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 11:04:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 11:04:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4357, Unknown=43, NotChecked=0, Total=4692 [2022-09-16 11:04:55,069 INFO L87 Difference]: Start difference. First operand 72428 states and 288101 transitions. Second operand has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 0 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 11:05:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:00,597 INFO L93 Difference]: Finished difference Result 137372 states and 525128 transitions. [2022-09-16 11:05:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 11:05:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 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 87 [2022-09-16 11:05:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:01,444 INFO L225 Difference]: With dead ends: 137372 [2022-09-16 11:05:01,445 INFO L226 Difference]: Without dead ends: 137372 [2022-09-16 11:05:01,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 136 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1005, Invalid=9458, Unknown=43, NotChecked=0, Total=10506 [2022-09-16 11:05:01,446 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3318 mSDsluCounter, 5143 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3318 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2027 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:01,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3318 Valid, 4839 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1962 Invalid, 0 Unknown, 2027 Unchecked, 0.9s Time] [2022-09-16 11:05:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137372 states. [2022-09-16 11:05:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137372 to 75393. [2022-09-16 11:05:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75393 states, 75050 states have (on average 4.030393071285809) internal successors, (302481), 75392 states have internal predecessors, (302481), 0 states have call successors, (0), 0 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 11:05:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75393 states to 75393 states and 302481 transitions. [2022-09-16 11:05:05,320 INFO L78 Accepts]: Start accepts. Automaton has 75393 states and 302481 transitions. Word has length 87 [2022-09-16 11:05:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:05,320 INFO L495 AbstractCegarLoop]: Abstraction has 75393 states and 302481 transitions. [2022-09-16 11:05:05,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 0 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 11:05:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 75393 states and 302481 transitions. [2022-09-16 11:05:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-09-16 11:05:05,322 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:05,322 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] [2022-09-16 11:05:05,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:05,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-09-16 11:05:05,523 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash -537339292, now seen corresponding path program 1 times [2022-09-16 11:05:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:05,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984484918] [2022-09-16 11:05:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:06,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984484918] [2022-09-16 11:05:06,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984484918] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:06,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160841966] [2022-09-16 11:05:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:06,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:06,213 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:05:06,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-09-16 11:05:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:06,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:05:06,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:06,614 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 15 treesize of output 11 [2022-09-16 11:05:07,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:07,547 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 11:05:07,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:07,661 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 11:05:07,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:07,756 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 11:05:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:07,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:08,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:08,996 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 1 case distinctions, treesize of input 32 treesize of output 33 [2022-09-16 11:05:09,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:09,003 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 310 treesize of output 298 [2022-09-16 11:05:09,007 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 282 treesize of output 234 [2022-09-16 11:05:09,011 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 234 treesize of output 222 [2022-09-16 11:05:09,015 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 222 treesize of output 198 [2022-09-16 11:05:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:09,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160841966] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:09,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:09,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 68 [2022-09-16 11:05:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594917899] [2022-09-16 11:05:09,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 11:05:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 11:05:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=4347, Unknown=58, NotChecked=0, Total=4692 [2022-09-16 11:05:09,945 INFO L87 Difference]: Start difference. First operand 75393 states and 302481 transitions. Second operand has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 0 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 11:05:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:14,278 INFO L93 Difference]: Finished difference Result 78198 states and 310514 transitions. [2022-09-16 11:05:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-09-16 11:05:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 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 87 [2022-09-16 11:05:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:14,710 INFO L225 Difference]: With dead ends: 78198 [2022-09-16 11:05:14,710 INFO L226 Difference]: Without dead ends: 78198 [2022-09-16 11:05:14,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2010 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=840, Invalid=7844, Unknown=58, NotChecked=0, Total=8742 [2022-09-16 11:05:14,711 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1235 mSDsluCounter, 6834 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 6491 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1758 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 6491 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2293 Invalid, 0 Unknown, 1758 Unchecked, 1.1s Time] [2022-09-16 11:05:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78198 states. [2022-09-16 11:05:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78198 to 75228. [2022-09-16 11:05:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75228 states, 74885 states have (on average 4.012659411097015) internal successors, (300488), 75227 states have internal predecessors, (300488), 0 states have call successors, (0), 0 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 11:05:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75228 states to 75228 states and 300488 transitions. [2022-09-16 11:05:17,564 INFO L78 Accepts]: Start accepts. Automaton has 75228 states and 300488 transitions. Word has length 87 [2022-09-16 11:05:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:17,565 INFO L495 AbstractCegarLoop]: Abstraction has 75228 states and 300488 transitions. [2022-09-16 11:05:17,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 0 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 11:05:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 75228 states and 300488 transitions. [2022-09-16 11:05:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:17,568 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:17,568 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:05:17,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:17,776 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -494663107, now seen corresponding path program 2 times [2022-09-16 11:05:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610066687] [2022-09-16 11:05:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610066687] [2022-09-16 11:05:17,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610066687] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514820114] [2022-09-16 11:05:17,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:05:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:17,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:05:17,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-09-16 11:05:17,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:05:17,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:05:17,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-16 11:05:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 11:05:18,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 11:05:18,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514820114] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:18,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:18,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-09-16 11:05:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822019801] [2022-09-16 11:05:18,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:18,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:05:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:05:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:05:18,223 INFO L87 Difference]: Start difference. First operand 75228 states and 300488 transitions. Second operand has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 11:05:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:22,010 INFO L93 Difference]: Finished difference Result 284826 states and 1138026 transitions. [2022-09-16 11:05:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:05:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 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 11:05:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:25,143 INFO L225 Difference]: With dead ends: 284826 [2022-09-16 11:05:25,143 INFO L226 Difference]: Without dead ends: 284826 [2022-09-16 11:05:25,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2022-09-16 11:05:25,144 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2438 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2438 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:25,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2438 Valid, 1122 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:05:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284826 states. [2022-09-16 11:05:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284826 to 75204. [2022-09-16 11:05:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75204 states, 74862 states have (on average 4.01354492265769) internal successors, (300462), 75203 states have internal predecessors, (300462), 0 states have call successors, (0), 0 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 11:05:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75204 states to 75204 states and 300462 transitions. [2022-09-16 11:05:32,156 INFO L78 Accepts]: Start accepts. Automaton has 75204 states and 300462 transitions. Word has length 89 [2022-09-16 11:05:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:32,156 INFO L495 AbstractCegarLoop]: Abstraction has 75204 states and 300462 transitions. [2022-09-16 11:05:32,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 11:05:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 75204 states and 300462 transitions. [2022-09-16 11:05:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:32,160 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:32,161 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:05:32,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-09-16 11:05:32,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:32,380 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -513659640, now seen corresponding path program 2 times [2022-09-16 11:05:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3143439] [2022-09-16 11:05:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3143439] [2022-09-16 11:05:32,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3143439] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196259152] [2022-09-16 11:05:32,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:05:32,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:32,808 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:05:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-09-16 11:05:33,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:05:33,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:05:33,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:05:33,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:33,210 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 15 treesize of output 11 [2022-09-16 11:05:33,361 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:05:33,362 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 23 treesize of output 22 [2022-09-16 11:05:33,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:33,563 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 14 treesize of output 16 [2022-09-16 11:05:33,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:33,658 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 14 treesize of output 16 [2022-09-16 11:05:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:33,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:33,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:05:33,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:05:33,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:05:33,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:33,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:33,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:33,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:33,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|)) (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) is different from false [2022-09-16 11:05:33,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 11:05:33,844 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:05:33,844 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 32 treesize of output 38 [2022-09-16 11:05:33,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:33,852 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 126 treesize of output 120 [2022-09-16 11:05:33,855 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 106 treesize of output 98 [2022-09-16 11:05:33,858 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 98 treesize of output 94 [2022-09-16 11:05:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:05:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196259152] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:34,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:05:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006115130] [2022-09-16 11:05:34,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:34,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:05:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:05:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1350, Unknown=9, NotChecked=738, Total=2256 [2022-09-16 11:05:34,138 INFO L87 Difference]: Start difference. First operand 75204 states and 300462 transitions. Second operand has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 11:05:34,814 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:35,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:37,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|)) (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_726 Int)) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_726)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:39,550 INFO L93 Difference]: Finished difference Result 113246 states and 444360 transitions. [2022-09-16 11:05:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:05:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:05:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:40,202 INFO L225 Difference]: With dead ends: 113246 [2022-09-16 11:05:40,202 INFO L226 Difference]: Without dead ends: 113246 [2022-09-16 11:05:40,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=381, Invalid=2517, Unknown=12, NotChecked=1380, Total=4290 [2022-09-16 11:05:40,203 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 957 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2095 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:40,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 2885 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1258 Invalid, 0 Unknown, 2095 Unchecked, 0.6s Time] [2022-09-16 11:05:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113246 states. [2022-09-16 11:05:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113246 to 75204. [2022-09-16 11:05:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75204 states, 74862 states have (on average 4.011594667521573) internal successors, (300316), 75203 states have internal predecessors, (300316), 0 states have call successors, (0), 0 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 11:05:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75204 states to 75204 states and 300316 transitions. [2022-09-16 11:05:43,665 INFO L78 Accepts]: Start accepts. Automaton has 75204 states and 300316 transitions. Word has length 89 [2022-09-16 11:05:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:43,665 INFO L495 AbstractCegarLoop]: Abstraction has 75204 states and 300316 transitions. [2022-09-16 11:05:43,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 11:05:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 75204 states and 300316 transitions. [2022-09-16 11:05:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:43,667 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:43,667 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:05:43,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-09-16 11:05:43,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:43,868 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -513659643, now seen corresponding path program 2 times [2022-09-16 11:05:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:43,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472918959] [2022-09-16 11:05:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:44,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472918959] [2022-09-16 11:05:44,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472918959] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:44,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768069544] [2022-09-16 11:05:44,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:05:44,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:44,165 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:05:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-09-16 11:05:44,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:05:44,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:05:44,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:05:44,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:44,435 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 15 treesize of output 11 [2022-09-16 11:05:44,551 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:05:44,551 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 25 treesize of output 24 [2022-09-16 11:05:44,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:44,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:05:44,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:44,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:05:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:44,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:44,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))))) is different from false [2022-09-16 11:05:44,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:44,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:44,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:44,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:44,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:44,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_765 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:44,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| Int)) (or (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_765 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|)))) is different from false [2022-09-16 11:05:44,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| Int) (v_ArrVal_765 Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:05:44,978 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:05:44,978 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 34 treesize of output 40 [2022-09-16 11:05:44,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:44,986 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 142 treesize of output 136 [2022-09-16 11:05:44,989 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 122 treesize of output 114 [2022-09-16 11:05:44,992 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 114 treesize of output 110 [2022-09-16 11:05:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:05:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768069544] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:45,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:45,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:05:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628757003] [2022-09-16 11:05:45,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:45,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:05:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:05:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1350, Unknown=9, NotChecked=738, Total=2256 [2022-09-16 11:05:45,240 INFO L87 Difference]: Start difference. First operand 75204 states and 300316 transitions. Second operand has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 11:05:46,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| Int) (v_ArrVal_765 Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:46,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| Int) (v_ArrVal_765 Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:48,334 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| Int)) (or (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_765 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_765)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:05:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:50,406 INFO L93 Difference]: Finished difference Result 113100 states and 443923 transitions. [2022-09-16 11:05:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:05:50,406 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:05:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:51,478 INFO L225 Difference]: With dead ends: 113100 [2022-09-16 11:05:51,479 INFO L226 Difference]: Without dead ends: 113100 [2022-09-16 11:05:51,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=381, Invalid=2517, Unknown=12, NotChecked=1380, Total=4290 [2022-09-16 11:05:51,479 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 910 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1898 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:51,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2761 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1220 Invalid, 0 Unknown, 1898 Unchecked, 0.6s Time] [2022-09-16 11:05:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113100 states. [2022-09-16 11:05:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113100 to 75204. [2022-09-16 11:05:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75204 states, 74862 states have (on average 4.009644412385456) internal successors, (300170), 75203 states have internal predecessors, (300170), 0 states have call successors, (0), 0 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 11:05:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75204 states to 75204 states and 300170 transitions. [2022-09-16 11:05:54,590 INFO L78 Accepts]: Start accepts. Automaton has 75204 states and 300170 transitions. Word has length 89 [2022-09-16 11:05:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:54,590 INFO L495 AbstractCegarLoop]: Abstraction has 75204 states and 300170 transitions. [2022-09-16 11:05:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 0 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 11:05:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 75204 states and 300170 transitions. [2022-09-16 11:05:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:54,593 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:54,593 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:05:54,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:54,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-09-16 11:05:54,794 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash -913104079, now seen corresponding path program 1 times [2022-09-16 11:05:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381869728] [2022-09-16 11:05:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381869728] [2022-09-16 11:05:54,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381869728] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:54,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200946759] [2022-09-16 11:05:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:54,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:54,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:54,976 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:05:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-09-16 11:05:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:55,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 11:05:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:55,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:55,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200946759] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:55,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:55,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2022-09-16 11:05:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447532310] [2022-09-16 11:05:55,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:55,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-09-16 11:05:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:55,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-09-16 11:05:55,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2022-09-16 11:05:55,669 INFO L87 Difference]: Start difference. First operand 75204 states and 300170 transitions. Second operand has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 11:05:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:57,464 INFO L93 Difference]: Finished difference Result 71737 states and 280162 transitions. [2022-09-16 11:05:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:05:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 0 states have call successors, (0), 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 11:05:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:58,132 INFO L225 Difference]: With dead ends: 71737 [2022-09-16 11:05:58,133 INFO L226 Difference]: Without dead ends: 70087 [2022-09-16 11:05:58,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2022-09-16 11:05:58,133 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 2101 mSDsluCounter, 2973 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:58,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2101 Valid, 2638 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:05:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70087 states. [2022-09-16 11:05:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70087 to 66546. [2022-09-16 11:06:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66546 states, 66204 states have (on average 3.966588121563652) internal successors, (262604), 66545 states have internal predecessors, (262604), 0 states have call successors, (0), 0 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 11:06:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66546 states to 66546 states and 262604 transitions. [2022-09-16 11:06:00,333 INFO L78 Accepts]: Start accepts. Automaton has 66546 states and 262604 transitions. Word has length 89 [2022-09-16 11:06:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:00,333 INFO L495 AbstractCegarLoop]: Abstraction has 66546 states and 262604 transitions. [2022-09-16 11:06:00,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 11:06:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 66546 states and 262604 transitions. [2022-09-16 11:06:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:00,335 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:00,335 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:06:00,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-09-16 11:06:00,537 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1488539906, now seen corresponding path program 2 times [2022-09-16 11:06:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373275096] [2022-09-16 11:06:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373275096] [2022-09-16 11:06:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373275096] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469531831] [2022-09-16 11:06:00,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:00,841 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:00,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-09-16 11:06:00,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:06:00,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:00,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:06:00,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:01,486 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 15 treesize of output 11 [2022-09-16 11:06:01,605 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:06:01,605 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 25 treesize of output 24 [2022-09-16 11:06:01,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:01,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:06:01,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:01,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:06:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:01,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:01,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_833 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:06:01,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:06:01,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:06:01,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:06:01,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-09-16 11:06:01,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_831 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:06:01,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| Int)) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_831 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77|)))) is different from false [2022-09-16 11:06:02,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| Int) (v_ArrVal_831 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) is different from false [2022-09-16 11:06:02,039 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:06:02,040 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 34 treesize of output 40 [2022-09-16 11:06:02,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:06:02,047 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 142 treesize of output 136 [2022-09-16 11:06:02,051 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 122 treesize of output 114 [2022-09-16 11:06:02,055 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 59 treesize of output 55 [2022-09-16 11:06:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:06:02,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469531831] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:02,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:02,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:06:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186411361] [2022-09-16 11:06:02,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:06:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:06:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1418, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 11:06:02,288 INFO L87 Difference]: Start difference. First operand 66546 states and 262604 transitions. Second operand has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 11:06:02,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| Int) (v_ArrVal_831 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:03,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| Int) (v_ArrVal_831 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:05,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| Int)) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_831 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_77|)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:07,087 INFO L93 Difference]: Finished difference Result 97089 states and 374476 transitions. [2022-09-16 11:06:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:06:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 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 11:06:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:08,001 INFO L225 Difference]: With dead ends: 97089 [2022-09-16 11:06:08,001 INFO L226 Difference]: Without dead ends: 97089 [2022-09-16 11:06:08,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=398, Invalid=2605, Unknown=11, NotChecked=1276, Total=4290 [2022-09-16 11:06:08,002 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 927 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1587 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:08,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2735 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1276 Invalid, 0 Unknown, 1587 Unchecked, 0.6s Time] [2022-09-16 11:06:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97089 states. [2022-09-16 11:06:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97089 to 66426. [2022-09-16 11:06:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66426 states, 66084 states have (on average 3.9682676593426547) internal successors, (262239), 66425 states have internal predecessors, (262239), 0 states have call successors, (0), 0 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 11:06:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66426 states to 66426 states and 262239 transitions. [2022-09-16 11:06:11,010 INFO L78 Accepts]: Start accepts. Automaton has 66426 states and 262239 transitions. Word has length 90 [2022-09-16 11:06:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:11,011 INFO L495 AbstractCegarLoop]: Abstraction has 66426 states and 262239 transitions. [2022-09-16 11:06:11,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 11:06:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 66426 states and 262239 transitions. [2022-09-16 11:06:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:11,016 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:11,016 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:06:11,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-09-16 11:06:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:11,234 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1488539903, now seen corresponding path program 2 times [2022-09-16 11:06:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:11,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043785260] [2022-09-16 11:06:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:11,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043785260] [2022-09-16 11:06:11,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043785260] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:11,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626703035] [2022-09-16 11:06:11,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:11,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:11,664 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:11,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-09-16 11:06:11,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:06:11,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:11,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:06:11,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:12,002 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 15 treesize of output 11 [2022-09-16 11:06:12,154 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:06:12,154 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 23 treesize of output 22 [2022-09-16 11:06:12,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:12,358 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 14 treesize of output 16 [2022-09-16 11:06:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:12,404 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 14 treesize of output 16 [2022-09-16 11:06:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:12,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:12,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:06:12,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:06:12,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967296)) is different from false [2022-09-16 11:06:12,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296)) is different from false [2022-09-16 11:06:12,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:06:12,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:06:12,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81|)) (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) is different from false [2022-09-16 11:06:12,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 11:06:12,654 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:06:12,654 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 32 treesize of output 38 [2022-09-16 11:06:12,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:06:12,662 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 64 treesize of output 62 [2022-09-16 11:06:12,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-09-16 11:06:12,674 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 46 treesize of output 42 [2022-09-16 11:06:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:06:12,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626703035] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:12,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:12,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:06:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005802433] [2022-09-16 11:06:12,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:12,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:06:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:06:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1414, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 11:06:12,941 INFO L87 Difference]: Start difference. First operand 66426 states and 262239 transitions. Second operand has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 11:06:13,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:13,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:15,903 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81|)) (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_871 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_868)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:06:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:18,069 INFO L93 Difference]: Finished difference Result 96648 states and 372917 transitions. [2022-09-16 11:06:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:06:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 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 11:06:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:18,624 INFO L225 Difference]: With dead ends: 96648 [2022-09-16 11:06:18,624 INFO L226 Difference]: Without dead ends: 96648 [2022-09-16 11:06:18,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=402, Invalid=2601, Unknown=11, NotChecked=1276, Total=4290 [2022-09-16 11:06:18,625 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 946 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1913 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:18,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2878 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1313 Invalid, 0 Unknown, 1913 Unchecked, 0.6s Time] [2022-09-16 11:06:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96648 states. [2022-09-16 11:06:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96648 to 66306. [2022-09-16 11:06:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66306 states, 65964 states have (on average 3.969953307864896) internal successors, (261874), 66305 states have internal predecessors, (261874), 0 states have call successors, (0), 0 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 11:06:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66306 states to 66306 states and 261874 transitions. [2022-09-16 11:06:21,443 INFO L78 Accepts]: Start accepts. Automaton has 66306 states and 261874 transitions. Word has length 90 [2022-09-16 11:06:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:21,444 INFO L495 AbstractCegarLoop]: Abstraction has 66306 states and 261874 transitions. [2022-09-16 11:06:21,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 11:06:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 66306 states and 261874 transitions. [2022-09-16 11:06:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:21,447 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:21,447 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 11:06:21,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:21,652 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -530787429, now seen corresponding path program 1 times [2022-09-16 11:06:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:21,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663053112] [2022-09-16 11:06:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663053112] [2022-09-16 11:06:21,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663053112] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485673617] [2022-09-16 11:06:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:21,732 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:21,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-09-16 11:06:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:21,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:06:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:06:22,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:06:22,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485673617] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:22,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:06:22,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-09-16 11:06:22,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950224793] [2022-09-16 11:06:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:22,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:06:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:22,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:06:22,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:06:22,017 INFO L87 Difference]: Start difference. First operand 66306 states and 261874 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 11:06:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:23,047 INFO L93 Difference]: Finished difference Result 63177 states and 249374 transitions. [2022-09-16 11:06:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:06:23,048 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 11:06:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:23,479 INFO L225 Difference]: With dead ends: 63177 [2022-09-16 11:06:23,479 INFO L226 Difference]: Without dead ends: 63177 [2022-09-16 11:06:23,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:06:23,481 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 221 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:23,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 648 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:06:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63177 states. [2022-09-16 11:06:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63177 to 63177. [2022-09-16 11:06:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63177 states, 62884 states have (on average 3.965619235417594) internal successors, (249374), 63176 states have internal predecessors, (249374), 0 states have call successors, (0), 0 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 11:06:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63177 states to 63177 states and 249374 transitions. [2022-09-16 11:06:25,858 INFO L78 Accepts]: Start accepts. Automaton has 63177 states and 249374 transitions. Word has length 90 [2022-09-16 11:06:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:25,858 INFO L495 AbstractCegarLoop]: Abstraction has 63177 states and 249374 transitions. [2022-09-16 11:06:25,858 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 11:06:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 63177 states and 249374 transitions. [2022-09-16 11:06:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:25,863 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:25,863 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] [2022-09-16 11:06:25,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-09-16 11:06:26,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:26,080 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 694959776, now seen corresponding path program 1 times [2022-09-16 11:06:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081271204] [2022-09-16 11:06:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:26,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081271204] [2022-09-16 11:06:26,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081271204] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:26,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110734573] [2022-09-16 11:06:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:26,192 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:26,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-09-16 11:06:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:26,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:26,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:26,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:26,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110734573] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:26,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:26,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-09-16 11:06:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498330255] [2022-09-16 11:06:26,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 11:06:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 11:06:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-09-16 11:06:26,652 INFO L87 Difference]: Start difference. First operand 63177 states and 249374 transitions. Second operand has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 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 11:06:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:28,145 INFO L93 Difference]: Finished difference Result 74602 states and 288020 transitions. [2022-09-16 11:06:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:06:28,146 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 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 91 [2022-09-16 11:06:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:28,498 INFO L225 Difference]: With dead ends: 74602 [2022-09-16 11:06:28,498 INFO L226 Difference]: Without dead ends: 74272 [2022-09-16 11:06:28,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=503, Invalid=1477, Unknown=0, NotChecked=0, Total=1980 [2022-09-16 11:06:28,498 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1207 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:28,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 2082 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:06:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74272 states. [2022-09-16 11:06:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74272 to 63012. [2022-09-16 11:06:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63012 states, 62719 states have (on average 3.9662941054544874) internal successors, (248762), 63011 states have internal predecessors, (248762), 0 states have call successors, (0), 0 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 11:06:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63012 states to 63012 states and 248762 transitions. [2022-09-16 11:06:31,050 INFO L78 Accepts]: Start accepts. Automaton has 63012 states and 248762 transitions. Word has length 91 [2022-09-16 11:06:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:31,050 INFO L495 AbstractCegarLoop]: Abstraction has 63012 states and 248762 transitions. [2022-09-16 11:06:31,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 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 11:06:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 63012 states and 248762 transitions. [2022-09-16 11:06:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:31,054 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:31,054 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] [2022-09-16 11:06:31,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-09-16 11:06:31,255 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 725459785, now seen corresponding path program 1 times [2022-09-16 11:06:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530598026] [2022-09-16 11:06:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:06:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:31,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530598026] [2022-09-16 11:06:31,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530598026] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:31,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:06:31,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 11:06:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101993387] [2022-09-16 11:06:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:06:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:06:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-16 11:06:31,299 INFO L87 Difference]: Start difference. First operand 63012 states and 248762 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:31,839 INFO L93 Difference]: Finished difference Result 59883 states and 236262 transitions. [2022-09-16 11:06:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 11:06:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-09-16 11:06:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:32,593 INFO L225 Difference]: With dead ends: 59883 [2022-09-16 11:06:32,593 INFO L226 Difference]: Without dead ends: 59883 [2022-09-16 11:06:32,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-09-16 11:06:32,594 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 173 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:32,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 614 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:06:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59883 states. [2022-09-16 11:06:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59883 to 59883. [2022-09-16 11:06:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59883 states, 59639 states have (on average 3.9615352370093397) internal successors, (236262), 59882 states have internal predecessors, (236262), 0 states have call successors, (0), 0 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 11:06:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59883 states to 59883 states and 236262 transitions. [2022-09-16 11:06:34,604 INFO L78 Accepts]: Start accepts. Automaton has 59883 states and 236262 transitions. Word has length 91 [2022-09-16 11:06:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:34,604 INFO L495 AbstractCegarLoop]: Abstraction has 59883 states and 236262 transitions. [2022-09-16 11:06:34,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 59883 states and 236262 transitions. [2022-09-16 11:06:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:34,608 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:34,608 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] [2022-09-16 11:06:34,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-09-16 11:06:34,608 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 11256326, now seen corresponding path program 2 times [2022-09-16 11:06:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:34,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583419975] [2022-09-16 11:06:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583419975] [2022-09-16 11:06:34,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583419975] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171366602] [2022-09-16 11:06:34,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:34,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:34,704 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:34,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-09-16 11:06:34,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:06:34,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-16 11:06:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:06:34,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:06:34,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171366602] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:34,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:06:34,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-09-16 11:06:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704955861] [2022-09-16 11:06:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:06:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:06:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-09-16 11:06:34,903 INFO L87 Difference]: Start difference. First operand 59883 states and 236262 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:36,362 INFO L93 Difference]: Finished difference Result 108887 states and 409683 transitions. [2022-09-16 11:06:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:06:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-09-16 11:06:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:37,311 INFO L225 Difference]: With dead ends: 108887 [2022-09-16 11:06:37,311 INFO L226 Difference]: Without dead ends: 108887 [2022-09-16 11:06:37,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:06:37,312 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 242 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:37,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 380 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:06:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108887 states. [2022-09-16 11:06:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108887 to 83188. [2022-09-16 11:06:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83188 states, 82944 states have (on average 4.021339699074074) internal successors, (333546), 83187 states have internal predecessors, (333546), 0 states have call successors, (0), 0 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 11:06:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83188 states to 83188 states and 333546 transitions. [2022-09-16 11:06:40,543 INFO L78 Accepts]: Start accepts. Automaton has 83188 states and 333546 transitions. Word has length 91 [2022-09-16 11:06:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:40,544 INFO L495 AbstractCegarLoop]: Abstraction has 83188 states and 333546 transitions. [2022-09-16 11:06:40,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 83188 states and 333546 transitions. [2022-09-16 11:06:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:40,548 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:40,548 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] [2022-09-16 11:06:40,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:40,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-09-16 11:06:40,748 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 11256327, now seen corresponding path program 1 times [2022-09-16 11:06:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:40,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250417293] [2022-09-16 11:06:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250417293] [2022-09-16 11:06:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250417293] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83065751] [2022-09-16 11:06:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:41,308 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:41,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-09-16 11:06:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:41,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:41,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:41,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:41,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83065751] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:41,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:41,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-09-16 11:06:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170548229] [2022-09-16 11:06:41,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:41,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 11:06:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:41,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 11:06:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:06:41,830 INFO L87 Difference]: Start difference. First operand 83188 states and 333546 transitions. Second operand has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:06:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:43,582 INFO L93 Difference]: Finished difference Result 114947 states and 447709 transitions. [2022-09-16 11:06:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 11:06:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 91 [2022-09-16 11:06:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:44,774 INFO L225 Difference]: With dead ends: 114947 [2022-09-16 11:06:44,774 INFO L226 Difference]: Without dead ends: 114339 [2022-09-16 11:06:44,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2022-09-16 11:06:44,775 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 1247 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 2264 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:06:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114339 states. [2022-09-16 11:06:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114339 to 83243. [2022-09-16 11:06:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83243 states, 82999 states have (on average 4.021132784732346) internal successors, (333750), 83242 states have internal predecessors, (333750), 0 states have call successors, (0), 0 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 11:06:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83243 states to 83243 states and 333750 transitions. [2022-09-16 11:06:48,683 INFO L78 Accepts]: Start accepts. Automaton has 83243 states and 333750 transitions. Word has length 91 [2022-09-16 11:06:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:48,683 INFO L495 AbstractCegarLoop]: Abstraction has 83243 states and 333750 transitions. [2022-09-16 11:06:48,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:06:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 83243 states and 333750 transitions. [2022-09-16 11:06:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:48,688 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:48,688 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] [2022-09-16 11:06:48,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-09-16 11:06:48,889 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 30024657, now seen corresponding path program 2 times [2022-09-16 11:06:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:48,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75563684] [2022-09-16 11:06:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:48,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75563684] [2022-09-16 11:06:48,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75563684] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:48,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091763323] [2022-09-16 11:06:48,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:48,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:48,991 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:48,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-09-16 11:06:49,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:06:49,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:49,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-16 11:06:49,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:06:49,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:06:49,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091763323] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:49,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:06:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-09-16 11:06:49,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364835040] [2022-09-16 11:06:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:49,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:06:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:06:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-09-16 11:06:49,197 INFO L87 Difference]: Start difference. First operand 83243 states and 333750 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:50,473 INFO L93 Difference]: Finished difference Result 111117 states and 413267 transitions. [2022-09-16 11:06:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:06:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-09-16 11:06:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:51,533 INFO L225 Difference]: With dead ends: 111117 [2022-09-16 11:06:51,533 INFO L226 Difference]: Without dead ends: 111117 [2022-09-16 11:06:51,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:06:51,534 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 239 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:51,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 380 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:06:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111117 states. [2022-09-16 11:06:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111117 to 82196. [2022-09-16 11:06:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82196 states, 81952 states have (on average 3.9671637055837565) internal successors, (325117), 82195 states have internal predecessors, (325117), 0 states have call successors, (0), 0 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 11:06:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82196 states to 82196 states and 325117 transitions. [2022-09-16 11:06:54,944 INFO L78 Accepts]: Start accepts. Automaton has 82196 states and 325117 transitions. Word has length 91 [2022-09-16 11:06:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:54,945 INFO L495 AbstractCegarLoop]: Abstraction has 82196 states and 325117 transitions. [2022-09-16 11:06:54,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:06:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 82196 states and 325117 transitions. [2022-09-16 11:06:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:06:54,949 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:54,949 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] [2022-09-16 11:06:54,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-09-16 11:06:55,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:55,150 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 30045467, now seen corresponding path program 1 times [2022-09-16 11:06:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:55,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555154422] [2022-09-16 11:06:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555154422] [2022-09-16 11:06:55,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555154422] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856577282] [2022-09-16 11:06:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:55,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:55,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:55,248 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:06:55,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-09-16 11:06:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:55,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:55,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:56,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:56,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856577282] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:56,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:56,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-09-16 11:06:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162158250] [2022-09-16 11:06:56,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 11:06:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 11:06:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:06:56,254 INFO L87 Difference]: Start difference. First operand 82196 states and 325117 transitions. Second operand has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:06:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:58,115 INFO L93 Difference]: Finished difference Result 99413 states and 386052 transitions. [2022-09-16 11:06:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:06:58,115 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 91 [2022-09-16 11:06:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:58,715 INFO L225 Difference]: With dead ends: 99413 [2022-09-16 11:06:58,715 INFO L226 Difference]: Without dead ends: 99248 [2022-09-16 11:06:58,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=446, Invalid=1446, Unknown=0, NotChecked=0, Total=1892 [2022-09-16 11:06:58,716 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 1480 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:58,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2670 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 11:06:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99248 states. [2022-09-16 11:07:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99248 to 82141. [2022-09-16 11:07:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82141 states, 81897 states have (on average 3.967337020892096) internal successors, (324913), 82140 states have internal predecessors, (324913), 0 states have call successors, (0), 0 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 11:07:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82141 states to 82141 states and 324913 transitions. [2022-09-16 11:07:02,361 INFO L78 Accepts]: Start accepts. Automaton has 82141 states and 324913 transitions. Word has length 91 [2022-09-16 11:07:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:02,361 INFO L495 AbstractCegarLoop]: Abstraction has 82141 states and 324913 transitions. [2022-09-16 11:07:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:07:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 82141 states and 324913 transitions. [2022-09-16 11:07:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:02,366 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:02,366 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] [2022-09-16 11:07:02,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:02,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-09-16 11:07:02,567 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1343920149, now seen corresponding path program 2 times [2022-09-16 11:07:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719398624] [2022-09-16 11:07:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719398624] [2022-09-16 11:07:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719398624] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596790453] [2022-09-16 11:07:02,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:02,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:02,668 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-09-16 11:07:02,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:07:02,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:02,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-16 11:07:02,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:07:02,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:07:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596790453] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:02,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:07:02,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-09-16 11:07:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79880480] [2022-09-16 11:07:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:02,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:07:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:07:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-09-16 11:07:02,865 INFO L87 Difference]: Start difference. First operand 82141 states and 324913 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:07:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:04,088 INFO L93 Difference]: Finished difference Result 100338 states and 382242 transitions. [2022-09-16 11:07:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:07:04,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:04,666 INFO L225 Difference]: With dead ends: 100338 [2022-09-16 11:07:04,666 INFO L226 Difference]: Without dead ends: 100338 [2022-09-16 11:07:04,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:07:04,667 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 235 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:04,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 378 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:07:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100338 states. [2022-09-16 11:07:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100338 to 74130. [2022-09-16 11:07:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74130 states, 73963 states have (on average 3.973094655435826) internal successors, (293862), 74129 states have internal predecessors, (293862), 0 states have call successors, (0), 0 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 11:07:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74130 states to 74130 states and 293862 transitions. [2022-09-16 11:07:08,086 INFO L78 Accepts]: Start accepts. Automaton has 74130 states and 293862 transitions. Word has length 91 [2022-09-16 11:07:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:08,087 INFO L495 AbstractCegarLoop]: Abstraction has 74130 states and 293862 transitions. [2022-09-16 11:07:08,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:07:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 74130 states and 293862 transitions. [2022-09-16 11:07:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:08,092 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:08,092 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] [2022-09-16 11:07:08,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-09-16 11:07:08,293 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1343920148, now seen corresponding path program 1 times [2022-09-16 11:07:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:08,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326696088] [2022-09-16 11:07:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:08,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326696088] [2022-09-16 11:07:08,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326696088] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:08,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586717439] [2022-09-16 11:07:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:08,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:08,392 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:08,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-09-16 11:07:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:08,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:07:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:08,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:08,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586717439] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:08,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:08,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-09-16 11:07:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724122255] [2022-09-16 11:07:08,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:08,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 11:07:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 11:07:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:07:08,917 INFO L87 Difference]: Start difference. First operand 74130 states and 293862 transitions. Second operand has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:07:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:10,540 INFO L93 Difference]: Finished difference Result 83440 states and 325767 transitions. [2022-09-16 11:07:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:07:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 91 [2022-09-16 11:07:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:11,017 INFO L225 Difference]: With dead ends: 83440 [2022-09-16 11:07:11,017 INFO L226 Difference]: Without dead ends: 81366 [2022-09-16 11:07:11,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=440, Invalid=1366, Unknown=0, NotChecked=0, Total=1806 [2022-09-16 11:07:11,018 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1587 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:11,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 2202 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:07:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81366 states. [2022-09-16 11:07:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81366 to 73066. [2022-09-16 11:07:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73066 states, 72899 states have (on average 3.9811931576564836) internal successors, (290225), 73065 states have internal predecessors, (290225), 0 states have call successors, (0), 0 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 11:07:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73066 states to 73066 states and 290225 transitions. [2022-09-16 11:07:14,202 INFO L78 Accepts]: Start accepts. Automaton has 73066 states and 290225 transitions. Word has length 91 [2022-09-16 11:07:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:14,202 INFO L495 AbstractCegarLoop]: Abstraction has 73066 states and 290225 transitions. [2022-09-16 11:07:14,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.6) internal successors, (140), 25 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 11:07:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 73066 states and 290225 transitions. [2022-09-16 11:07:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:14,206 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:14,206 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] [2022-09-16 11:07:14,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:14,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-09-16 11:07:14,407 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash -845218808, now seen corresponding path program 2 times [2022-09-16 11:07:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:14,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166458462] [2022-09-16 11:07:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:14,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:14,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166458462] [2022-09-16 11:07:14,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166458462] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:14,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824818212] [2022-09-16 11:07:14,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:14,518 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:14,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-09-16 11:07:14,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:07:14,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-16 11:07:14,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 11:07:14,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:07:14,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824818212] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:14,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:07:14,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-09-16 11:07:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534792550] [2022-09-16 11:07:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:14,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:07:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:07:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-09-16 11:07:14,698 INFO L87 Difference]: Start difference. First operand 73066 states and 290225 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:07:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:15,743 INFO L93 Difference]: Finished difference Result 90867 states and 347527 transitions. [2022-09-16 11:07:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:07:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:16,819 INFO L225 Difference]: With dead ends: 90867 [2022-09-16 11:07:16,820 INFO L226 Difference]: Without dead ends: 90537 [2022-09-16 11:07:16,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:07:16,820 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 231 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:16,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 378 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:07:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90537 states. [2022-09-16 11:07:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90537 to 42680. [2022-09-16 11:07:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42680 states, 42576 states have (on average 3.851324689966178) internal successors, (163974), 42679 states have internal predecessors, (163974), 0 states have call successors, (0), 0 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 11:07:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 163974 transitions. [2022-09-16 11:07:19,182 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 163974 transitions. Word has length 91 [2022-09-16 11:07:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:19,182 INFO L495 AbstractCegarLoop]: Abstraction has 42680 states and 163974 transitions. [2022-09-16 11:07:19,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 11:07:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 163974 transitions. [2022-09-16 11:07:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 11:07:19,185 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:19,185 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:19,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:19,386 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -167662154, now seen corresponding path program 2 times [2022-09-16 11:07:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138275198] [2022-09-16 11:07:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138275198] [2022-09-16 11:07:19,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138275198] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:19,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116624534] [2022-09-16 11:07:19,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:19,700 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-09-16 11:07:19,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:19,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:19,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-16 11:07:19,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:20,055 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 11:07:20,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:20,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:20,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:20,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1206) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:07:20,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1206) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:07:20,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1206) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:07:20,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967295)) is different from false [2022-09-16 11:07:20,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:20,394 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-16 11:07:20,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:20,399 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 38 treesize of output 34 [2022-09-16 11:07:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:07:20,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116624534] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:20,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:20,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-09-16 11:07:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016175117] [2022-09-16 11:07:20,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:20,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 11:07:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 11:07:20,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1651, Unknown=4, NotChecked=340, Total=2162 [2022-09-16 11:07:20,589 INFO L87 Difference]: Start difference. First operand 42680 states and 163974 transitions. Second operand has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:07:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:23,327 INFO L93 Difference]: Finished difference Result 65891 states and 246957 transitions. [2022-09-16 11:07:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 11:07:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 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 92 [2022-09-16 11:07:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:23,649 INFO L225 Difference]: With dead ends: 65891 [2022-09-16 11:07:23,650 INFO L226 Difference]: Without dead ends: 65891 [2022-09-16 11:07:23,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=598, Invalid=3970, Unknown=4, NotChecked=540, Total=5112 [2022-09-16 11:07:23,650 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 1629 mSDsluCounter, 4898 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 4832 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1596 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:23,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 4832 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1952 Invalid, 0 Unknown, 1596 Unchecked, 0.8s Time] [2022-09-16 11:07:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65891 states. [2022-09-16 11:07:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65891 to 42759. [2022-09-16 11:07:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42759 states, 42655 states have (on average 3.847942796858516) internal successors, (164134), 42758 states have internal predecessors, (164134), 0 states have call successors, (0), 0 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 11:07:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42759 states to 42759 states and 164134 transitions. [2022-09-16 11:07:25,266 INFO L78 Accepts]: Start accepts. Automaton has 42759 states and 164134 transitions. Word has length 92 [2022-09-16 11:07:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:25,267 INFO L495 AbstractCegarLoop]: Abstraction has 42759 states and 164134 transitions. [2022-09-16 11:07:25,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:07:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42759 states and 164134 transitions. [2022-09-16 11:07:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 11:07:25,270 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:25,270 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:25,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-09-16 11:07:25,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-09-16 11:07:25,484 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -167662153, now seen corresponding path program 1 times [2022-09-16 11:07:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:25,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925256481] [2022-09-16 11:07:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925256481] [2022-09-16 11:07:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925256481] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:25,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:07:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:07:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183943446] [2022-09-16 11:07:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:25,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:07:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:07:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:07:25,528 INFO L87 Difference]: Start difference. First operand 42759 states and 164134 transitions. Second operand has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 11:07:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:26,227 INFO L93 Difference]: Finished difference Result 50911 states and 189797 transitions. [2022-09-16 11:07:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 11:07:26,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 92 [2022-09-16 11:07:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:26,512 INFO L225 Difference]: With dead ends: 50911 [2022-09-16 11:07:26,512 INFO L226 Difference]: Without dead ends: 50911 [2022-09-16 11:07:26,512 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 11:07:26,512 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 189 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:26,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 295 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:07:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50911 states. [2022-09-16 11:07:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50911 to 41389. [2022-09-16 11:07:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41389 states, 41300 states have (on average 3.848062953995157) internal successors, (158925), 41388 states have internal predecessors, (158925), 0 states have call successors, (0), 0 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 11:07:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41389 states to 41389 states and 158925 transitions. [2022-09-16 11:07:27,796 INFO L78 Accepts]: Start accepts. Automaton has 41389 states and 158925 transitions. Word has length 92 [2022-09-16 11:07:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:27,796 INFO L495 AbstractCegarLoop]: Abstraction has 41389 states and 158925 transitions. [2022-09-16 11:07:27,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 11:07:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 41389 states and 158925 transitions. [2022-09-16 11:07:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 11:07:27,800 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:27,800 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:27,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-09-16 11:07:27,800 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -167662152, now seen corresponding path program 1 times [2022-09-16 11:07:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:27,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596273748] [2022-09-16 11:07:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:27,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596273748] [2022-09-16 11:07:27,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596273748] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:27,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:07:27,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:07:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362803754] [2022-09-16 11:07:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:27,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:07:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:07:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:07:27,843 INFO L87 Difference]: Start difference. First operand 41389 states and 158925 transitions. Second operand has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 11:07:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:28,682 INFO L93 Difference]: Finished difference Result 49541 states and 184588 transitions. [2022-09-16 11:07:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 11:07:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 92 [2022-09-16 11:07:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:28,903 INFO L225 Difference]: With dead ends: 49541 [2022-09-16 11:07:28,903 INFO L226 Difference]: Without dead ends: 49541 [2022-09-16 11:07:28,903 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 11:07:28,904 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 187 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:28,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 295 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:07:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49541 states. [2022-09-16 11:07:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49541 to 40019. [2022-09-16 11:07:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40019 states, 39945 states have (on average 3.8481912629866066) internal successors, (153716), 40018 states have internal predecessors, (153716), 0 states have call successors, (0), 0 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 11:07:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40019 states to 40019 states and 153716 transitions. [2022-09-16 11:07:30,454 INFO L78 Accepts]: Start accepts. Automaton has 40019 states and 153716 transitions. Word has length 92 [2022-09-16 11:07:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:30,454 INFO L495 AbstractCegarLoop]: Abstraction has 40019 states and 153716 transitions. [2022-09-16 11:07:30,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 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 11:07:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40019 states and 153716 transitions. [2022-09-16 11:07:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 11:07:30,457 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:30,457 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:30,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-09-16 11:07:30,457 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -167662157, now seen corresponding path program 1 times [2022-09-16 11:07:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:30,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445717827] [2022-09-16 11:07:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:30,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445717827] [2022-09-16 11:07:30,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445717827] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:30,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330111907] [2022-09-16 11:07:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:30,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:30,769 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:30,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-09-16 11:07:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:30,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 11:07:30,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:31,134 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 11:07:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:31,268 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 11:07:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:31,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:31,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1265) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:07:31,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1265) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4))))) is different from false [2022-09-16 11:07:31,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1265) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:07:31,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1265) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-09-16 11:07:31,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:31,495 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-09-16 11:07:31,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:31,502 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 42 treesize of output 38 [2022-09-16 11:07:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:07:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330111907] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:31,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:31,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-09-16 11:07:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781398506] [2022-09-16 11:07:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:31,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 11:07:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 11:07:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1649, Unknown=4, NotChecked=340, Total=2162 [2022-09-16 11:07:31,689 INFO L87 Difference]: Start difference. First operand 40019 states and 153716 transitions. Second operand has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:07:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:34,137 INFO L93 Difference]: Finished difference Result 60396 states and 228841 transitions. [2022-09-16 11:07:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:07:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 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 92 [2022-09-16 11:07:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:34,444 INFO L225 Difference]: With dead ends: 60396 [2022-09-16 11:07:34,445 INFO L226 Difference]: Without dead ends: 60396 [2022-09-16 11:07:34,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=560, Invalid=3742, Unknown=4, NotChecked=524, Total=4830 [2022-09-16 11:07:34,445 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1414 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:34,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 3391 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1370 Invalid, 0 Unknown, 1132 Unchecked, 0.6s Time] [2022-09-16 11:07:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60396 states. [2022-09-16 11:07:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60396 to 40019. [2022-09-16 11:07:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40019 states, 39945 states have (on average 3.848066090874953) internal successors, (153711), 40018 states have internal predecessors, (153711), 0 states have call successors, (0), 0 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 11:07:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40019 states to 40019 states and 153711 transitions. [2022-09-16 11:07:36,098 INFO L78 Accepts]: Start accepts. Automaton has 40019 states and 153711 transitions. Word has length 92 [2022-09-16 11:07:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:36,098 INFO L495 AbstractCegarLoop]: Abstraction has 40019 states and 153711 transitions. [2022-09-16 11:07:36,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.695652173913044) internal successors, (216), 47 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:07:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 40019 states and 153711 transitions. [2022-09-16 11:07:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:07:36,107 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:36,107 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:36,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:36,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:36,308 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1965401279, now seen corresponding path program 2 times [2022-09-16 11:07:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71795589] [2022-09-16 11:07:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:36,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:36,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71795589] [2022-09-16 11:07:36,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71795589] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:36,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776975950] [2022-09-16 11:07:36,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:36,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:36,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:36,711 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:36,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-09-16 11:07:36,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:36,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:36,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-16 11:07:36,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:37,149 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 15 treesize of output 11 [2022-09-16 11:07:37,293 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:07:37,293 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 23 treesize of output 22 [2022-09-16 11:07:37,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:37,495 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 14 treesize of output 16 [2022-09-16 11:07:37,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:37,581 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 14 treesize of output 16 [2022-09-16 11:07:37,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:37,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:07:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:37,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:37,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:07:37,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967295)) is different from false [2022-09-16 11:07:37,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:07:37,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:07:37,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:07:37,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:07:37,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:07:37,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:07:37,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|)))) is different from false [2022-09-16 11:07:37,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (or (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:07:37,815 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:07:37,816 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 35 treesize of output 41 [2022-09-16 11:07:37,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:37,822 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 246 treesize of output 240 [2022-09-16 11:07:37,826 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 226 treesize of output 210 [2022-09-16 11:07:37,829 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 210 treesize of output 202 [2022-09-16 11:07:37,835 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 103 treesize of output 99 [2022-09-16 11:07:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:07:38,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776975950] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:38,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:38,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:07:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857368985] [2022-09-16 11:07:38,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:38,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:07:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:07:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1733, Unknown=10, NotChecked=930, Total=2862 [2022-09-16 11:07:38,173 INFO L87 Difference]: Start difference. First operand 40019 states and 153711 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:07:38,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (or (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:07:39,307 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (or (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:07:41,310 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1304 Int) (v_ArrVal_1308 (Array Int Int))) (<= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:07:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:42,683 INFO L93 Difference]: Finished difference Result 49657 states and 184930 transitions. [2022-09-16 11:07:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:07:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 95 [2022-09-16 11:07:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:42,885 INFO L225 Difference]: With dead ends: 49657 [2022-09-16 11:07:42,885 INFO L226 Difference]: Without dead ends: 49657 [2022-09-16 11:07:42,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=416, Invalid=2929, Unknown=13, NotChecked=1612, Total=4970 [2022-09-16 11:07:42,886 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 884 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1905 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:42,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2583 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 962 Invalid, 0 Unknown, 1905 Unchecked, 0.4s Time] [2022-09-16 11:07:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49657 states. [2022-09-16 11:07:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49657 to 40019. [2022-09-16 11:07:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40019 states, 39945 states have (on average 3.8166729252722496) internal successors, (152457), 40018 states have internal predecessors, (152457), 0 states have call successors, (0), 0 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 11:07:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40019 states to 40019 states and 152457 transitions. [2022-09-16 11:07:44,312 INFO L78 Accepts]: Start accepts. Automaton has 40019 states and 152457 transitions. Word has length 95 [2022-09-16 11:07:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:44,312 INFO L495 AbstractCegarLoop]: Abstraction has 40019 states and 152457 transitions. [2022-09-16 11:07:44,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:07:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 40019 states and 152457 transitions. [2022-09-16 11:07:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:07:44,318 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:44,319 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:44,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-09-16 11:07:44,520 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1965401276, now seen corresponding path program 2 times [2022-09-16 11:07:44,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:44,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357943876] [2022-09-16 11:07:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357943876] [2022-09-16 11:07:44,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357943876] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988790643] [2022-09-16 11:07:44,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:44,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:44,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:44,936 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:44,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-09-16 11:07:45,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:45,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:45,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:07:45,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:45,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:07:45,257 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:07:45,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:07:45,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 11:07:45,843 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:07:45,844 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:07:46,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:46,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:46,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:46,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:46,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:46,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-09-16 11:07:46,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-09-16 11:07:46,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:46,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:46,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:46,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:46,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:46,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:46,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109|)) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) is different from false [2022-09-16 11:07:46,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:07:46,370 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:07:46,370 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 37 treesize of output 43 [2022-09-16 11:07:46,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:46,377 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 278 treesize of output 272 [2022-09-16 11:07:46,380 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 258 treesize of output 250 [2022-09-16 11:07:46,383 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 250 treesize of output 234 [2022-09-16 11:07:46,386 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 234 treesize of output 230 [2022-09-16 11:07:46,793 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 8 [2022-09-16 11:07:46,796 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 8 [2022-09-16 11:07:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:07:46,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988790643] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:46,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:46,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:07:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728455251] [2022-09-16 11:07:46,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:46,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:07:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:07:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1738, Unknown=10, NotChecked=930, Total=2862 [2022-09-16 11:07:46,845 INFO L87 Difference]: Start difference. First operand 40019 states and 152457 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:07:47,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:07:47,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:07:49,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109|)) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1349 Int) (v_ArrVal_1350 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_109| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1349)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:07:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:52,059 INFO L93 Difference]: Finished difference Result 95705 states and 360460 transitions. [2022-09-16 11:07:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:07:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 95 [2022-09-16 11:07:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:52,579 INFO L225 Difference]: With dead ends: 95705 [2022-09-16 11:07:52,579 INFO L226 Difference]: Without dead ends: 95705 [2022-09-16 11:07:52,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=396, Invalid=2949, Unknown=13, NotChecked=1612, Total=4970 [2022-09-16 11:07:52,580 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 1038 mSDsluCounter, 3729 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2176 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:52,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 3687 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1218 Invalid, 0 Unknown, 2176 Unchecked, 0.7s Time] [2022-09-16 11:07:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95705 states. [2022-09-16 11:07:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95705 to 44114. [2022-09-16 11:07:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44114 states, 44040 states have (on average 3.8457765667574932) internal successors, (169368), 44113 states have internal predecessors, (169368), 0 states have call successors, (0), 0 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 11:07:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44114 states to 44114 states and 169368 transitions. [2022-09-16 11:07:54,639 INFO L78 Accepts]: Start accepts. Automaton has 44114 states and 169368 transitions. Word has length 95 [2022-09-16 11:07:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:54,639 INFO L495 AbstractCegarLoop]: Abstraction has 44114 states and 169368 transitions. [2022-09-16 11:07:54,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:07:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 44114 states and 169368 transitions. [2022-09-16 11:07:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:07:54,645 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:54,645 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:54,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:54,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:54,846 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1092418639, now seen corresponding path program 2 times [2022-09-16 11:07:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40855462] [2022-09-16 11:07:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40855462] [2022-09-16 11:07:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40855462] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270780750] [2022-09-16 11:07:55,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:55,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:55,240 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:55,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-09-16 11:07:55,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:55,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:55,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjunts are in the unsatisfiable core [2022-09-16 11:07:55,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:55,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:07:55,478 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:07:55,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-16 11:07:55,522 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-09-16 11:07:55,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-09-16 11:07:56,086 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:07:56,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-09-16 11:07:56,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 11:07:56,412 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:07:56,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:07:56,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:56,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:56,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 11:07:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:56,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:56,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:56,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:56,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:56,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:56,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:56,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:56,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:56,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| Int)) (or (forall ((v_ArrVal_1394 Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113|)))) is different from false [2022-09-16 11:07:56,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) is different from false [2022-09-16 11:07:57,018 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:07:57,018 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 37 treesize of output 43 [2022-09-16 11:07:57,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:57,026 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 2210 treesize of output 2148 [2022-09-16 11:07:57,036 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 2134 treesize of output 2102 [2022-09-16 11:07:57,046 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 2102 treesize of output 1974 [2022-09-16 11:07:57,056 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 1974 treesize of output 1910 [2022-09-16 11:08:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:08:03,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270780750] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:03,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2022-09-16 11:08:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963112387] [2022-09-16 11:08:03,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:03,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 11:08:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 11:08:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1984, Unknown=9, NotChecked=882, Total=3080 [2022-09-16 11:08:03,365 INFO L87 Difference]: Start difference. First operand 44114 states and 169368 transitions. Second operand has 56 states, 55 states have (on average 4.5636363636363635) internal successors, (251), 56 states have internal predecessors, (251), 0 states have call successors, (0), 0 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 11:08:04,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) .cse0) .cse1) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_1394 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:08:04,502 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((v_ArrVal_1394 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-09-16 11:08:06,504 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= 0 (+ (select .cse0 0) 2147483648)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| Int)) (or (forall ((v_ArrVal_1394 Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1394)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_113|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:08:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:08,222 INFO L93 Difference]: Finished difference Result 95512 states and 357523 transitions. [2022-09-16 11:08:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:08:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 4.5636363636363635) internal successors, (251), 56 states have internal predecessors, (251), 0 states have call successors, (0), 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 95 [2022-09-16 11:08:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:08,678 INFO L225 Difference]: With dead ends: 95512 [2022-09-16 11:08:08,678 INFO L226 Difference]: Without dead ends: 95512 [2022-09-16 11:08:08,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=450, Invalid=3492, Unknown=12, NotChecked=1596, Total=5550 [2022-09-16 11:08:08,679 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1188 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1808 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:08,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2972 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 951 Invalid, 0 Unknown, 1808 Unchecked, 0.5s Time] [2022-09-16 11:08:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95512 states. [2022-09-16 11:08:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95512 to 47868. [2022-09-16 11:08:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47868 states, 47794 states have (on average 3.872013223417165) internal successors, (185059), 47867 states have internal predecessors, (185059), 0 states have call successors, (0), 0 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 11:08:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47868 states to 47868 states and 185059 transitions. [2022-09-16 11:08:10,583 INFO L78 Accepts]: Start accepts. Automaton has 47868 states and 185059 transitions. Word has length 95 [2022-09-16 11:08:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:10,583 INFO L495 AbstractCegarLoop]: Abstraction has 47868 states and 185059 transitions. [2022-09-16 11:08:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.5636363636363635) internal successors, (251), 56 states have internal predecessors, (251), 0 states have call successors, (0), 0 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 11:08:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 47868 states and 185059 transitions. [2022-09-16 11:08:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:08:10,590 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:10,590 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:08:10,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-09-16 11:08:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-09-16 11:08:10,791 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1092418636, now seen corresponding path program 2 times [2022-09-16 11:08:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850151131] [2022-09-16 11:08:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:11,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:11,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850151131] [2022-09-16 11:08:11,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850151131] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176268185] [2022-09-16 11:08:11,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:08:11,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:11,226 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:11,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-09-16 11:08:11,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:08:11,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:08:11,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:08:11,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:11,701 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 15 treesize of output 11 [2022-09-16 11:08:11,852 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:08:11,852 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 23 treesize of output 22 [2022-09-16 11:08:12,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:12,072 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 14 treesize of output 16 [2022-09-16 11:08:12,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:12,126 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 14 treesize of output 16 [2022-09-16 11:08:12,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:12,176 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 14 treesize of output 16 [2022-09-16 11:08:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:12,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:12,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:08:12,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:08:12,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-09-16 11:08:12,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967296)) is different from false [2022-09-16 11:08:12,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296)) is different from false [2022-09-16 11:08:12,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:08:12,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-09-16 11:08:12,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| Int)) (or (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117|)))) is different from false [2022-09-16 11:08:12,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| Int) (v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:08:12,401 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:08:12,401 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 35 treesize of output 41 [2022-09-16 11:08:12,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:12,409 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 124 treesize of output 122 [2022-09-16 11:08:12,412 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 108 treesize of output 100 [2022-09-16 11:08:12,415 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 100 treesize of output 96 [2022-09-16 11:08:12,419 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 48 treesize of output 46 [2022-09-16 11:08:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:08:12,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176268185] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:12,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:12,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:08:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461086061] [2022-09-16 11:08:12,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:12,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:08:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:08:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1805, Unknown=9, NotChecked=846, Total=2862 [2022-09-16 11:08:12,771 INFO L87 Difference]: Start difference. First operand 47868 states and 185059 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:08:13,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| Int) (v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:08:13,735 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| Int) (v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:08:15,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| Int)) (or (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_117|)))) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:08:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:17,244 INFO L93 Difference]: Finished difference Result 57626 states and 215880 transitions. [2022-09-16 11:08:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:08:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 95 [2022-09-16 11:08:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:17,521 INFO L225 Difference]: With dead ends: 57626 [2022-09-16 11:08:17,522 INFO L226 Difference]: Without dead ends: 57626 [2022-09-16 11:08:17,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=445, Invalid=3013, Unknown=12, NotChecked=1500, Total=4970 [2022-09-16 11:08:17,523 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 1019 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2038 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:17,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2397 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1010 Invalid, 0 Unknown, 2038 Unchecked, 0.5s Time] [2022-09-16 11:08:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57626 states. [2022-09-16 11:08:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57626 to 47868. [2022-09-16 11:08:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47868 states, 47794 states have (on average 3.8177804745365527) internal successors, (182467), 47867 states have internal predecessors, (182467), 0 states have call successors, (0), 0 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 11:08:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47868 states to 47868 states and 182467 transitions. [2022-09-16 11:08:19,071 INFO L78 Accepts]: Start accepts. Automaton has 47868 states and 182467 transitions. Word has length 95 [2022-09-16 11:08:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:19,071 INFO L495 AbstractCegarLoop]: Abstraction has 47868 states and 182467 transitions. [2022-09-16 11:08:19,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 11:08:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47868 states and 182467 transitions. [2022-09-16 11:08:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:08:19,078 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:19,078 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:08:19,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-09-16 11:08:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-09-16 11:08:19,279 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 224642079, now seen corresponding path program 1 times [2022-09-16 11:08:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:19,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558463220] [2022-09-16 11:08:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:08:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:19,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558463220] [2022-09-16 11:08:19,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558463220] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:19,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145427785] [2022-09-16 11:08:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:19,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:19,322 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:19,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-09-16 11:08:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:19,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:08:19,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:08:19,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:08:19,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145427785] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:19,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:19,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 11:08:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062140418] [2022-09-16 11:08:19,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:19,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:08:19,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:08:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:08:19,558 INFO L87 Difference]: Start difference. First operand 47868 states and 182467 transitions. Second operand has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)