/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 09:18:43,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 09:18:43,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 09:18:43,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 09:18:43,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 09:18:43,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 09:18:43,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 09:18:43,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 09:18:43,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 09:18:43,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 09:18:43,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 09:18:43,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 09:18:43,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 09:18:43,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 09:18:43,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 09:18:43,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 09:18:43,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 09:18:43,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 09:18:43,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 09:18:43,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 09:18:43,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 09:18:43,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 09:18:43,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 09:18:43,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 09:18:43,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 09:18:43,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 09:18:43,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 09:18:43,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 09:18:43,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 09:18:43,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 09:18:43,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 09:18:43,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 09:18:43,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 09:18:43,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 09:18:43,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 09:18:43,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 09:18:43,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 09:18:43,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 09:18:43,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 09:18:43,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 09:18:43,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 09:18:43,547 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-Separate.epf [2022-01-18 09:18:43,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 09:18:43,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 09:18:43,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 09:18:43,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 09:18:43,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 09:18:43,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 09:18:43,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 09:18:43,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 09:18:43,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 09:18:43,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 09:18:43,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 09:18:43,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 09:18:43,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 09:18:43,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 09:18:43,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 09:18:43,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 09:18:43,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:18:43,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 09:18:43,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 09:18:43,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 09:18:43,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 09:18:43,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 09:18:43,575 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 09:18:43,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 09:18:43,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 09:18:43,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 09:18:43,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 09:18:43,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 09:18:43,808 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 09:18:43,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2022-01-18 09:18:43,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1289ef6c/f23653df0d4d4f6fb97fa1c79fbebe6c/FLAG90669b61c [2022-01-18 09:18:44,293 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 09:18:44,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2022-01-18 09:18:44,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1289ef6c/f23653df0d4d4f6fb97fa1c79fbebe6c/FLAG90669b61c [2022-01-18 09:18:44,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1289ef6c/f23653df0d4d4f6fb97fa1c79fbebe6c [2022-01-18 09:18:44,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 09:18:44,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 09:18:44,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 09:18:44,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 09:18:44,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 09:18:44,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7969aae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44, skipping insertion in model container [2022-01-18 09:18:44,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 09:18:44,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 09:18:44,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2022-01-18 09:18:44,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:18:44,689 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 09:18:44,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2022-01-18 09:18:44,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:18:44,765 INFO L208 MainTranslator]: Completed translation [2022-01-18 09:18:44,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44 WrapperNode [2022-01-18 09:18:44,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 09:18:44,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 09:18:44,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 09:18:44,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 09:18:44,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,807 INFO L137 Inliner]: procedures = 275, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2022-01-18 09:18:44,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 09:18:44,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 09:18:44,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 09:18:44,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 09:18:44,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 09:18:44,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 09:18:44,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 09:18:44,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 09:18:44,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (1/1) ... [2022-01-18 09:18:44,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:18:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:18:44,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 09:18:44,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-01-18 09:18:44,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 09:18:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 09:18:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 09:18:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 09:18:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 09:18:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 09:18:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 09:18:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 09:18:44,893 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 09:18:45,065 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 09:18:45,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 09:18:45,223 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 09:18:45,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 09:18:45,246 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-18 09:18:45,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:18:45 BoogieIcfgContainer [2022-01-18 09:18:45,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 09:18:45,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 09:18:45,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 09:18:45,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 09:18:45,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:18:44" (1/3) ... [2022-01-18 09:18:45,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343b60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:18:45, skipping insertion in model container [2022-01-18 09:18:45,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:18:44" (2/3) ... [2022-01-18 09:18:45,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343b60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:18:45, skipping insertion in model container [2022-01-18 09:18:45,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:18:45" (3/3) ... [2022-01-18 09:18:45,252 INFO L111 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2022-01-18 09:18:45,255 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 09:18:45,256 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 09:18:45,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 09:18:45,256 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 09:18:45,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,276 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,277 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,278 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,279 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,280 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,281 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,282 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,283 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,284 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,285 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,286 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,286 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,289 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,289 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:45,289 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 09:18:45,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 09:18:45,323 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 09:18:45,323 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-18 09:18:45,330 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 88 transitions, 181 flow [2022-01-18 09:18:45,369 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 508 states have (on average 2.001968503937008) internal successors, (1017), 510 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 508 states have (on average 2.001968503937008) internal successors, (1017), 510 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-18 09:18:45,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:45,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:45,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2095347556, now seen corresponding path program 1 times [2022-01-18 09:18:45,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383634687] [2022-01-18 09:18:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:45,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:18:45,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383634687] [2022-01-18 09:18:45,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383634687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:45,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:45,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 09:18:45,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031159526] [2022-01-18 09:18:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:45,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 09:18:45,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 09:18:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:45,660 INFO L87 Difference]: Start difference. First operand has 511 states, 508 states have (on average 2.001968503937008) internal successors, (1017), 510 states have internal predecessors, (1017), 0 states have call successors, (0), 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, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:45,704 INFO L93 Difference]: Finished difference Result 346 states and 613 transitions. [2022-01-18 09:18:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 09:18:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-18 09:18:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:45,713 INFO L225 Difference]: With dead ends: 346 [2022-01-18 09:18:45,713 INFO L226 Difference]: Without dead ends: 271 [2022-01-18 09:18:45,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:45,717 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:45,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 09:18:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-01-18 09:18:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-01-18 09:18:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.7555555555555555) internal successors, (474), 270 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 474 transitions. [2022-01-18 09:18:45,775 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 474 transitions. Word has length 61 [2022-01-18 09:18:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:45,776 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 474 transitions. [2022-01-18 09:18:45,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 474 transitions. [2022-01-18 09:18:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-18 09:18:45,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:45,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:45,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 09:18:45,779 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1323467087, now seen corresponding path program 1 times [2022-01-18 09:18:45,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:45,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736181832] [2022-01-18 09:18:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:45,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:18:45,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736181832] [2022-01-18 09:18:45,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736181832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:45,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:45,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 09:18:45,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646035903] [2022-01-18 09:18:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:45,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 09:18:45,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 09:18:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 09:18:45,900 INFO L87 Difference]: Start difference. First operand 271 states and 474 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:46,063 INFO L93 Difference]: Finished difference Result 375 states and 645 transitions. [2022-01-18 09:18:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 09:18:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-01-18 09:18:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:46,067 INFO L225 Difference]: With dead ends: 375 [2022-01-18 09:18:46,067 INFO L226 Difference]: Without dead ends: 267 [2022-01-18 09:18:46,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-01-18 09:18:46,072 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 112 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:46,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 398 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:18:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-01-18 09:18:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 217. [2022-01-18 09:18:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.662037037037037) internal successors, (359), 216 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 359 transitions. [2022-01-18 09:18:46,088 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 359 transitions. Word has length 64 [2022-01-18 09:18:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:46,089 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 359 transitions. [2022-01-18 09:18:46,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 359 transitions. [2022-01-18 09:18:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-18 09:18:46,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:46,091 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:46,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 09:18:46,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1083729163, now seen corresponding path program 1 times [2022-01-18 09:18:46,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:46,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279698642] [2022-01-18 09:18:46,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:46,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:18:46,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:46,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279698642] [2022-01-18 09:18:46,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279698642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:46,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:46,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 09:18:46,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126189835] [2022-01-18 09:18:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:46,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 09:18:46,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 09:18:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-18 09:18:46,265 INFO L87 Difference]: Start difference. First operand 217 states and 359 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:46,405 INFO L93 Difference]: Finished difference Result 263 states and 443 transitions. [2022-01-18 09:18:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 09:18:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 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 70 [2022-01-18 09:18:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:46,408 INFO L225 Difference]: With dead ends: 263 [2022-01-18 09:18:46,408 INFO L226 Difference]: Without dead ends: 0 [2022-01-18 09:18:46,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-01-18 09:18:46,414 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:46,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 472 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:18:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-18 09:18:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-18 09:18:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-18 09:18:46,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2022-01-18 09:18:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:46,418 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-18 09:18:46,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-18 09:18:46,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-18 09:18:46,425 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-18 09:18:46,425 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-18 09:18:46,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 09:18:46,427 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-18 09:18:46,428 INFO L308 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2022-01-18 09:18:46,431 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-18 09:18:46,431 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 09:18:46,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-18 09:18:46,436 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 88 transitions, 181 flow [2022-01-18 09:18:46,441 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 302 states have (on average 1.8543046357615893) internal successors, (560), 303 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 302 states have (on average 1.8543046357615893) internal successors, (560), 303 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-18 09:18:46,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:46,445 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:46,445 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 09:18:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash 178627719, now seen corresponding path program 1 times [2022-01-18 09:18:46,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:46,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228974864] [2022-01-18 09:18:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:46,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 09:18:46,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 09:18:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 09:18:46,496 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 09:18:46,496 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 09:18:46,496 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-18 09:18:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 09:18:46,497 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-18 09:18:46,497 INFO L308 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-18 09:18:46,497 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-18 09:18:46,497 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-18 09:18:46,506 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,506 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,506 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,506 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,509 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,511 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,512 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,513 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,514 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,515 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,516 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,517 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,518 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,519 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,520 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,521 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,522 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,523 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,524 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:18:46,525 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 09:18:46,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 09:18:46,527 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 09:18:46,527 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-18 09:18:46,529 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 125 transitions, 262 flow [2022-01-18 09:18:46,889 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16744 states, 16736 states have (on average 3.1483030592734225) internal successors, (52690), 16743 states have internal predecessors, (52690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 16744 states, 16736 states have (on average 3.1483030592734225) internal successors, (52690), 16743 states have internal predecessors, (52690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-18 09:18:46,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:46,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:46,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash -650128955, now seen corresponding path program 1 times [2022-01-18 09:18:46,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:46,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725866805] [2022-01-18 09:18:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:46,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:18:47,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:47,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725866805] [2022-01-18 09:18:47,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725866805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:47,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:47,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 09:18:47,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446463742] [2022-01-18 09:18:47,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:47,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 09:18:47,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:47,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 09:18:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:47,041 INFO L87 Difference]: Start difference. First operand has 16744 states, 16736 states have (on average 3.1483030592734225) internal successors, (52690), 16743 states have internal predecessors, (52690), 0 states have call successors, (0), 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, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:47,149 INFO L93 Difference]: Finished difference Result 10279 states and 29548 transitions. [2022-01-18 09:18:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 09:18:47,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-18 09:18:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:47,203 INFO L225 Difference]: With dead ends: 10279 [2022-01-18 09:18:47,203 INFO L226 Difference]: Without dead ends: 10056 [2022-01-18 09:18:47,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:47,204 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:47,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 307 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 09:18:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10056 states. [2022-01-18 09:18:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10056 to 9339. [2022-01-18 09:18:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9339 states, 9336 states have (on average 2.9009211653813196) internal successors, (27083), 9338 states have internal predecessors, (27083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 27083 transitions. [2022-01-18 09:18:47,627 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 27083 transitions. Word has length 61 [2022-01-18 09:18:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:47,627 INFO L470 AbstractCegarLoop]: Abstraction has 9339 states and 27083 transitions. [2022-01-18 09:18:47,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 27083 transitions. [2022-01-18 09:18:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-18 09:18:47,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:47,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:47,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 09:18:47,632 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1543138609, now seen corresponding path program 1 times [2022-01-18 09:18:47,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960473784] [2022-01-18 09:18:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:47,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:18:47,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960473784] [2022-01-18 09:18:47,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960473784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:47,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:47,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 09:18:47,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271064537] [2022-01-18 09:18:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:47,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 09:18:47,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 09:18:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 09:18:47,682 INFO L87 Difference]: Start difference. First operand 9339 states and 27083 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:48,011 INFO L93 Difference]: Finished difference Result 21124 states and 61183 transitions. [2022-01-18 09:18:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 09:18:48,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-01-18 09:18:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:48,095 INFO L225 Difference]: With dead ends: 21124 [2022-01-18 09:18:48,095 INFO L226 Difference]: Without dead ends: 20788 [2022-01-18 09:18:48,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-18 09:18:48,096 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 474 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:48,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 1121 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:18:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20788 states. [2022-01-18 09:18:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20788 to 10707. [2022-01-18 09:18:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10707 states, 10704 states have (on average 2.9004110612855007) internal successors, (31046), 10706 states have internal predecessors, (31046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10707 states to 10707 states and 31046 transitions. [2022-01-18 09:18:48,465 INFO L78 Accepts]: Start accepts. Automaton has 10707 states and 31046 transitions. Word has length 64 [2022-01-18 09:18:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:48,466 INFO L470 AbstractCegarLoop]: Abstraction has 10707 states and 31046 transitions. [2022-01-18 09:18:48,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10707 states and 31046 transitions. [2022-01-18 09:18:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-18 09:18:48,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:48,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:48,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 09:18:48,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 295750616, now seen corresponding path program 1 times [2022-01-18 09:18:48,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104169039] [2022-01-18 09:18:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:48,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:48,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104169039] [2022-01-18 09:18:48,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104169039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:48,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:48,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 09:18:48,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956247134] [2022-01-18 09:18:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:48,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 09:18:48,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 09:18:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:48,532 INFO L87 Difference]: Start difference. First operand 10707 states and 31046 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:48,682 INFO L93 Difference]: Finished difference Result 12729 states and 36532 transitions. [2022-01-18 09:18:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 09:18:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-18 09:18:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:48,705 INFO L225 Difference]: With dead ends: 12729 [2022-01-18 09:18:48,705 INFO L226 Difference]: Without dead ends: 12289 [2022-01-18 09:18:48,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-18 09:18:48,706 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 96 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:48,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 305 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 09:18:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12289 states. [2022-01-18 09:18:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12289 to 11611. [2022-01-18 09:18:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11611 states, 11608 states have (on average 2.8862853204686423) internal successors, (33504), 11610 states have internal predecessors, (33504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11611 states to 11611 states and 33504 transitions. [2022-01-18 09:18:48,984 INFO L78 Accepts]: Start accepts. Automaton has 11611 states and 33504 transitions. Word has length 68 [2022-01-18 09:18:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:48,985 INFO L470 AbstractCegarLoop]: Abstraction has 11611 states and 33504 transitions. [2022-01-18 09:18:48,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11611 states and 33504 transitions. [2022-01-18 09:18:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-18 09:18:49,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:49,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:49,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 09:18:49,067 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash -928438867, now seen corresponding path program 1 times [2022-01-18 09:18:49,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:49,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73195974] [2022-01-18 09:18:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:49,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:18:49,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:49,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73195974] [2022-01-18 09:18:49,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73195974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:49,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:49,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 09:18:49,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008661096] [2022-01-18 09:18:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:49,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 09:18:49,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:49,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 09:18:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-18 09:18:49,161 INFO L87 Difference]: Start difference. First operand 11611 states and 33504 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:49,609 INFO L93 Difference]: Finished difference Result 20647 states and 59293 transitions. [2022-01-18 09:18:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 09:18:49,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 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 70 [2022-01-18 09:18:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:49,652 INFO L225 Difference]: With dead ends: 20647 [2022-01-18 09:18:49,653 INFO L226 Difference]: Without dead ends: 18041 [2022-01-18 09:18:49,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-01-18 09:18:49,653 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 554 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:49,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 1531 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 09:18:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18041 states. [2022-01-18 09:18:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18041 to 9253. [2022-01-18 09:18:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9253 states, 9250 states have (on average 2.8687567567567567) internal successors, (26536), 9252 states have internal predecessors, (26536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9253 states to 9253 states and 26536 transitions. [2022-01-18 09:18:49,924 INFO L78 Accepts]: Start accepts. Automaton has 9253 states and 26536 transitions. Word has length 70 [2022-01-18 09:18:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:49,924 INFO L470 AbstractCegarLoop]: Abstraction has 9253 states and 26536 transitions. [2022-01-18 09:18:49,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 9253 states and 26536 transitions. [2022-01-18 09:18:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-18 09:18:49,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:49,931 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:49,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 09:18:49,931 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 960973466, now seen corresponding path program 1 times [2022-01-18 09:18:49,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:49,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269139926] [2022-01-18 09:18:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:49,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:49,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:49,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269139926] [2022-01-18 09:18:49,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269139926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:49,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:49,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 09:18:49,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175209629] [2022-01-18 09:18:49,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:49,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 09:18:49,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:49,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 09:18:49,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 09:18:49,982 INFO L87 Difference]: Start difference. First operand 9253 states and 26536 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:50,186 INFO L93 Difference]: Finished difference Result 17293 states and 49077 transitions. [2022-01-18 09:18:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 09:18:50,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 71 [2022-01-18 09:18:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:50,218 INFO L225 Difference]: With dead ends: 17293 [2022-01-18 09:18:50,218 INFO L226 Difference]: Without dead ends: 16525 [2022-01-18 09:18:50,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-18 09:18:50,218 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 480 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:50,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 1111 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:18:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16525 states. [2022-01-18 09:18:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16525 to 9595. [2022-01-18 09:18:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9595 states, 9592 states have (on average 2.8408048373644705) internal successors, (27249), 9594 states have internal predecessors, (27249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9595 states to 9595 states and 27249 transitions. [2022-01-18 09:18:50,486 INFO L78 Accepts]: Start accepts. Automaton has 9595 states and 27249 transitions. Word has length 71 [2022-01-18 09:18:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:50,486 INFO L470 AbstractCegarLoop]: Abstraction has 9595 states and 27249 transitions. [2022-01-18 09:18:50,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9595 states and 27249 transitions. [2022-01-18 09:18:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-18 09:18:50,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:50,495 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-01-18 09:18:50,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 09:18:50,495 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash -655108844, now seen corresponding path program 2 times [2022-01-18 09:18:50,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:50,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460322438] [2022-01-18 09:18:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:50,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:18:50,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460322438] [2022-01-18 09:18:50,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460322438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:50,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:50,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 09:18:50,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112034827] [2022-01-18 09:18:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:50,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 09:18:50,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 09:18:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-18 09:18:50,582 INFO L87 Difference]: Start difference. First operand 9595 states and 27249 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:50,870 INFO L93 Difference]: Finished difference Result 16171 states and 45853 transitions. [2022-01-18 09:18:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 09:18:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-01-18 09:18:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:50,899 INFO L225 Difference]: With dead ends: 16171 [2022-01-18 09:18:50,899 INFO L226 Difference]: Without dead ends: 14080 [2022-01-18 09:18:50,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-01-18 09:18:50,901 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 627 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:50,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 1231 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:18:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14080 states. [2022-01-18 09:18:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14080 to 7980. [2022-01-18 09:18:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7980 states, 7978 states have (on average 2.8398094760591626) internal successors, (22656), 7979 states have internal predecessors, (22656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 22656 transitions. [2022-01-18 09:18:51,173 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 22656 transitions. Word has length 77 [2022-01-18 09:18:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:51,174 INFO L470 AbstractCegarLoop]: Abstraction has 7980 states and 22656 transitions. [2022-01-18 09:18:51,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 22656 transitions. [2022-01-18 09:18:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:51,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:51,185 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:51,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 09:18:51,185 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -718160180, now seen corresponding path program 1 times [2022-01-18 09:18:51,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:51,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655420065] [2022-01-18 09:18:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:51,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:51,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:51,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655420065] [2022-01-18 09:18:51,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655420065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:51,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:51,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 09:18:51,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392575855] [2022-01-18 09:18:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:51,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 09:18:51,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 09:18:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-18 09:18:51,305 INFO L87 Difference]: Start difference. First operand 7980 states and 22656 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:52,457 INFO L93 Difference]: Finished difference Result 32646 states and 92710 transitions. [2022-01-18 09:18:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:18:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 88 [2022-01-18 09:18:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:52,522 INFO L225 Difference]: With dead ends: 32646 [2022-01-18 09:18:52,522 INFO L226 Difference]: Without dead ends: 32400 [2022-01-18 09:18:52,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=569, Invalid=2293, Unknown=0, NotChecked=0, Total=2862 [2022-01-18 09:18:52,523 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 1279 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:52,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1279 Valid, 3293 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 09:18:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32400 states. [2022-01-18 09:18:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32400 to 8468. [2022-01-18 09:18:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 8466 states have (on average 2.8387668320340183) internal successors, (24033), 8467 states have internal predecessors, (24033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 24033 transitions. [2022-01-18 09:18:52,883 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 24033 transitions. Word has length 88 [2022-01-18 09:18:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:52,883 INFO L470 AbstractCegarLoop]: Abstraction has 8468 states and 24033 transitions. [2022-01-18 09:18:52,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 24033 transitions. [2022-01-18 09:18:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:52,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:52,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:52,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 09:18:52,894 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:52,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1337193848, now seen corresponding path program 2 times [2022-01-18 09:18:52,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808920505] [2022-01-18 09:18:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:52,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:52,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808920505] [2022-01-18 09:18:52,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808920505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:52,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:52,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 09:18:52,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841863522] [2022-01-18 09:18:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:53,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 09:18:53,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 09:18:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-18 09:18:53,000 INFO L87 Difference]: Start difference. First operand 8468 states and 24033 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:54,126 INFO L93 Difference]: Finished difference Result 37070 states and 105210 transitions. [2022-01-18 09:18:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 09:18:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 88 [2022-01-18 09:18:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:54,292 INFO L225 Difference]: With dead ends: 37070 [2022-01-18 09:18:54,292 INFO L226 Difference]: Without dead ends: 36824 [2022-01-18 09:18:54,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=775, Invalid=3515, Unknown=0, NotChecked=0, Total=4290 [2022-01-18 09:18:54,293 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 1628 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:54,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 2877 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 09:18:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36824 states. [2022-01-18 09:18:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36824 to 8804. [2022-01-18 09:18:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8804 states, 8802 states have (on average 2.840149965916837) internal successors, (24999), 8803 states have internal predecessors, (24999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 24999 transitions. [2022-01-18 09:18:54,578 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 24999 transitions. Word has length 88 [2022-01-18 09:18:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:54,578 INFO L470 AbstractCegarLoop]: Abstraction has 8804 states and 24999 transitions. [2022-01-18 09:18:54,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 24999 transitions. [2022-01-18 09:18:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:54,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:54,589 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:54,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 09:18:54,590 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 14703300, now seen corresponding path program 1 times [2022-01-18 09:18:54,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:54,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697417141] [2022-01-18 09:18:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:54,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:54,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697417141] [2022-01-18 09:18:54,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697417141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:54,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:54,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 09:18:54,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703674685] [2022-01-18 09:18:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:54,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 09:18:54,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 09:18:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-18 09:18:54,701 INFO L87 Difference]: Start difference. First operand 8804 states and 24999 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:56,097 INFO L93 Difference]: Finished difference Result 37397 states and 105060 transitions. [2022-01-18 09:18:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:18:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 88 [2022-01-18 09:18:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:56,172 INFO L225 Difference]: With dead ends: 37397 [2022-01-18 09:18:56,172 INFO L226 Difference]: Without dead ends: 37151 [2022-01-18 09:18:56,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=622, Invalid=3160, Unknown=0, NotChecked=0, Total=3782 [2022-01-18 09:18:56,173 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 1121 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:56,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 3816 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-18 09:18:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37151 states. [2022-01-18 09:18:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37151 to 8974. [2022-01-18 09:18:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8972 states have (on average 2.8400579580918413) internal successors, (25481), 8973 states have internal predecessors, (25481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 25481 transitions. [2022-01-18 09:18:56,591 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 25481 transitions. Word has length 88 [2022-01-18 09:18:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:56,591 INFO L470 AbstractCegarLoop]: Abstraction has 8974 states and 25481 transitions. [2022-01-18 09:18:56,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 25481 transitions. [2022-01-18 09:18:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:56,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:56,602 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:56,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 09:18:56,602 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -539021106, now seen corresponding path program 2 times [2022-01-18 09:18:56,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305992912] [2022-01-18 09:18:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:56,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:56,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:56,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305992912] [2022-01-18 09:18:56,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305992912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:56,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:56,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 09:18:56,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838565230] [2022-01-18 09:18:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:56,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 09:18:56,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 09:18:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-18 09:18:56,661 INFO L87 Difference]: Start difference. First operand 8974 states and 25481 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-01-18 09:18:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:57,025 INFO L93 Difference]: Finished difference Result 15562 states and 43690 transitions. [2022-01-18 09:18:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 09:18:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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 88 [2022-01-18 09:18:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:57,052 INFO L225 Difference]: With dead ends: 15562 [2022-01-18 09:18:57,052 INFO L226 Difference]: Without dead ends: 15562 [2022-01-18 09:18:57,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2022-01-18 09:18:57,053 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 509 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:57,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 1855 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 09:18:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15562 states. [2022-01-18 09:18:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15562 to 8406. [2022-01-18 09:18:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8406 states, 8404 states have (on average 2.8243693479295575) internal successors, (23736), 8405 states have internal predecessors, (23736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8406 states to 8406 states and 23736 transitions. [2022-01-18 09:18:57,221 INFO L78 Accepts]: Start accepts. Automaton has 8406 states and 23736 transitions. Word has length 88 [2022-01-18 09:18:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:57,222 INFO L470 AbstractCegarLoop]: Abstraction has 8406 states and 23736 transitions. [2022-01-18 09:18:57,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-01-18 09:18:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 8406 states and 23736 transitions. [2022-01-18 09:18:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:57,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:57,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:57,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 09:18:57,230 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1337740988, now seen corresponding path program 3 times [2022-01-18 09:18:57,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:57,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394773501] [2022-01-18 09:18:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:57,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:57,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:57,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394773501] [2022-01-18 09:18:57,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394773501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:57,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:57,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 09:18:57,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605281314] [2022-01-18 09:18:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:57,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 09:18:57,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 09:18:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-18 09:18:57,329 INFO L87 Difference]: Start difference. First operand 8406 states and 23736 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:58,379 INFO L93 Difference]: Finished difference Result 24968 states and 70034 transitions. [2022-01-18 09:18:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 09:18:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 88 [2022-01-18 09:18:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:58,427 INFO L225 Difference]: With dead ends: 24968 [2022-01-18 09:18:58,428 INFO L226 Difference]: Without dead ends: 24722 [2022-01-18 09:18:58,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=775, Invalid=3515, Unknown=0, NotChecked=0, Total=4290 [2022-01-18 09:18:58,429 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 1120 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:58,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1120 Valid, 2450 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 09:18:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24722 states. [2022-01-18 09:18:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24722 to 8918. [2022-01-18 09:18:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 8916 states have (on average 2.8272768057424855) internal successors, (25208), 8917 states have internal predecessors, (25208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 25208 transitions. [2022-01-18 09:18:58,674 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 25208 transitions. Word has length 88 [2022-01-18 09:18:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:58,674 INFO L470 AbstractCegarLoop]: Abstraction has 8918 states and 25208 transitions. [2022-01-18 09:18:58,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 25208 transitions. [2022-01-18 09:18:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:18:58,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:18:58,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:18:58,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 09:18:58,684 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:18:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:18:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash -327205368, now seen corresponding path program 3 times [2022-01-18 09:18:58,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:18:58,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904293] [2022-01-18 09:18:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:18:58,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:18:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:18:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:18:58,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:18:58,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904293] [2022-01-18 09:18:58,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:18:58,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:18:58,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 09:18:58,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941561113] [2022-01-18 09:18:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:18:58,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 09:18:58,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:18:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 09:18:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-18 09:18:58,782 INFO L87 Difference]: Start difference. First operand 8918 states and 25208 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:18:59,641 INFO L93 Difference]: Finished difference Result 28809 states and 81195 transitions. [2022-01-18 09:18:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 09:18:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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 88 [2022-01-18 09:18:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:18:59,700 INFO L225 Difference]: With dead ends: 28809 [2022-01-18 09:18:59,700 INFO L226 Difference]: Without dead ends: 28563 [2022-01-18 09:18:59,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=364, Invalid=1706, Unknown=0, NotChecked=0, Total=2070 [2022-01-18 09:18:59,701 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 886 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:18:59,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 2835 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 09:18:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28563 states. [2022-01-18 09:18:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28563 to 8846. [2022-01-18 09:18:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8846 states, 8844 states have (on average 2.8268882858435096) internal successors, (25001), 8845 states have internal predecessors, (25001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:18:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 25001 transitions. [2022-01-18 09:18:59,996 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 25001 transitions. Word has length 88 [2022-01-18 09:18:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:18:59,996 INFO L470 AbstractCegarLoop]: Abstraction has 8846 states and 25001 transitions. [2022-01-18 09:18:59,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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-01-18 09:18:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 25001 transitions. [2022-01-18 09:19:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:19:00,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:19:00,005 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:19:00,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 09:19:00,006 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:19:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:19:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -700542576, now seen corresponding path program 4 times [2022-01-18 09:19:00,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:19:00,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643661404] [2022-01-18 09:19:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:19:00,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:19:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:19:00,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:19:00,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643661404] [2022-01-18 09:19:00,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643661404] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:19:00,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426012281] [2022-01-18 09:19:00,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:19:00,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:00,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:19:00,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:19:00,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 09:19:00,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:19:00,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:19:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:19:00,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:19:00,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:19:00,378 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:19:00,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:19:00,525 INFO L387 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-01-18 09:19:00,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:19:00,652 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:19:00,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:19:00,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:19:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:19:00,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:19:02,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) is different from false [2022-01-18 09:19:02,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_227 Int) (|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_226) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) is different from false [2022-01-18 09:19:02,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:19:02,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:19:02,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:19:02,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:19:02,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:19:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-01-18 09:19:03,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426012281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:19:03,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:19:03,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:19:03,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846523450] [2022-01-18 09:19:03,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:19:03,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:19:03,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:19:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:19:03,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:19:03,135 INFO L87 Difference]: Start difference. First operand 8846 states and 25001 transitions. Second operand has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:03,764 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_227 Int) (|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_226) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:05,870 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:07,892 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:19:09,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_227 Int) (|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_226) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:19:11,673 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_23| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_23| 4) c_~data~0.offset) v_ArrVal_227) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_23|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:19:12,859 INFO L93 Difference]: Finished difference Result 46252 states and 131791 transitions. [2022-01-18 09:19:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-01-18 09:19:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-18 09:19:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:19:12,963 INFO L225 Difference]: With dead ends: 46252 [2022-01-18 09:19:12,964 INFO L226 Difference]: Without dead ends: 46096 [2022-01-18 09:19:12,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1359, Invalid=9792, Unknown=7, NotChecked=1498, Total=12656 [2022-01-18 09:19:12,967 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 1652 mSDsluCounter, 10925 mSDsCounter, 0 mSdLazyCounter, 3802 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 10802 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3385 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:19:12,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1652 Valid, 10802 Invalid, 7251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3802 Invalid, 0 Unknown, 3385 Unchecked, 1.4s Time] [2022-01-18 09:19:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46096 states. [2022-01-18 09:19:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46096 to 10323. [2022-01-18 09:19:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10323 states, 10321 states have (on average 2.835965507218293) internal successors, (29270), 10322 states have internal predecessors, (29270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10323 states to 10323 states and 29270 transitions. [2022-01-18 09:19:13,441 INFO L78 Accepts]: Start accepts. Automaton has 10323 states and 29270 transitions. Word has length 88 [2022-01-18 09:19:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:19:13,441 INFO L470 AbstractCegarLoop]: Abstraction has 10323 states and 29270 transitions. [2022-01-18 09:19:13,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.625) internal successors, (180), 32 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 10323 states and 29270 transitions. [2022-01-18 09:19:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:19:13,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:19:13,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:19:13,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 09:19:13,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 09:19:13,664 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:19:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:19:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -878327662, now seen corresponding path program 5 times [2022-01-18 09:19:13,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:19:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620870006] [2022-01-18 09:19:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:19:13,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:19:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:19:13,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:19:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620870006] [2022-01-18 09:19:13,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620870006] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:19:13,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860626330] [2022-01-18 09:19:13,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:19:13,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:13,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:19:13,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:19:13,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 09:19:13,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:19:13,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:19:13,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:19:13,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:19:13,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:19:14,006 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:19:14,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:19:14,143 INFO L387 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-01-18 09:19:14,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:19:14,294 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:19:14,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:19:14,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:19:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:19:14,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:19:16,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (forall ((v_ArrVal_261 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:19:16,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_261 Int) (|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_260) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:19:16,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:19:16,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:19:16,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:19:16,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:19:16,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:19:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-01-18 09:19:16,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860626330] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:19:16,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:19:16,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:19:16,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987392874] [2022-01-18 09:19:16,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:19:16,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:19:16,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:19:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:19:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:19:16,771 INFO L87 Difference]: Start difference. First operand 10323 states and 29270 transitions. Second operand has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:17,380 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_261 Int) (|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_260) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:17,818 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_261 Int) (|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_260) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:19,840 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (forall ((v_ArrVal_261 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:21,859 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (forall ((v_ArrVal_261 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:19:23,098 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_261 Int) (|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_260) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:19:23,987 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_261 Int) (|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_260) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:26,070 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_27| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_27|)) (forall ((v_ArrVal_261 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_27| 4) c_~data~0.offset) v_ArrVal_261) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:19:27,266 INFO L93 Difference]: Finished difference Result 47235 states and 134713 transitions. [2022-01-18 09:19:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-18 09:19:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-18 09:19:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:19:27,365 INFO L225 Difference]: With dead ends: 47235 [2022-01-18 09:19:27,366 INFO L226 Difference]: Without dead ends: 47079 [2022-01-18 09:19:27,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3562 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1363, Invalid=9794, Unknown=9, NotChecked=1944, Total=13110 [2022-01-18 09:19:27,369 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 1624 mSDsluCounter, 10772 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 10654 SdHoareTripleChecker+Invalid, 6175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2197 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:19:27,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1624 Valid, 10654 Invalid, 6175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3923 Invalid, 0 Unknown, 2197 Unchecked, 1.3s Time] [2022-01-18 09:19:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47079 states. [2022-01-18 09:19:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47079 to 10334. [2022-01-18 09:19:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10334 states, 10332 states have (on average 2.8360433604336044) internal successors, (29302), 10333 states have internal predecessors, (29302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10334 states to 10334 states and 29302 transitions. [2022-01-18 09:19:27,814 INFO L78 Accepts]: Start accepts. Automaton has 10334 states and 29302 transitions. Word has length 88 [2022-01-18 09:19:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:19:27,815 INFO L470 AbstractCegarLoop]: Abstraction has 10334 states and 29302 transitions. [2022-01-18 09:19:27,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10334 states and 29302 transitions. [2022-01-18 09:19:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:19:27,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:19:27,824 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:19:27,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 09:19:28,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-18 09:19:28,032 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:19:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:19:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1501815248, now seen corresponding path program 6 times [2022-01-18 09:19:28,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:19:28,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973050503] [2022-01-18 09:19:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:19:28,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:19:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:19:28,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:19:28,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973050503] [2022-01-18 09:19:28,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973050503] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:19:28,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561133030] [2022-01-18 09:19:28,216 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:19:28,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:19:28,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:19:28,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 09:19:28,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-18 09:19:28,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:19:28,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:19:28,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:19:28,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:19:28,340 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:19:28,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:19:28,446 INFO L387 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-01-18 09:19:28,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:19:28,567 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:19:28,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:19:28,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:19:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:19:28,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:19:30,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)) (forall ((v_ArrVal_295 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:19:30,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_294) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)))) is different from false [2022-01-18 09:19:30,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:19:30,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:19:30,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:19:30,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:19:30,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:19:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-01-18 09:19:31,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561133030] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:19:31,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:19:31,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:19:31,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170302804] [2022-01-18 09:19:31,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:19:31,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:19:31,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:19:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:19:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:19:31,035 INFO L87 Difference]: Start difference. First operand 10334 states and 29302 transitions. Second operand has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:31,580 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_294) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:32,027 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_294) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:34,049 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)) (forall ((v_ArrVal_295 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:36,063 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)) (forall ((v_ArrVal_295 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:19:37,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_294) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:19:37,884 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_294) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:40,024 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_31| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_31|)) (forall ((v_ArrVal_295 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_31| 4) c_~data~0.offset) v_ArrVal_295) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:19:41,028 INFO L93 Difference]: Finished difference Result 47334 states and 134990 transitions. [2022-01-18 09:19:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-18 09:19:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-18 09:19:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:19:41,139 INFO L225 Difference]: With dead ends: 47334 [2022-01-18 09:19:41,139 INFO L226 Difference]: Without dead ends: 47178 [2022-01-18 09:19:41,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3561 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1363, Invalid=9794, Unknown=9, NotChecked=1944, Total=13110 [2022-01-18 09:19:41,143 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 1845 mSDsluCounter, 7793 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 7875 SdHoareTripleChecker+Invalid, 5788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2956 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:19:41,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1845 Valid, 7875 Invalid, 5788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2767 Invalid, 0 Unknown, 2956 Unchecked, 0.9s Time] [2022-01-18 09:19:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47178 states. [2022-01-18 09:19:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47178 to 10345. [2022-01-18 09:19:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10345 states, 10343 states have (on average 2.8361210480518224) internal successors, (29334), 10344 states have internal predecessors, (29334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 29334 transitions. [2022-01-18 09:19:41,590 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 29334 transitions. Word has length 88 [2022-01-18 09:19:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:19:41,590 INFO L470 AbstractCegarLoop]: Abstraction has 10345 states and 29334 transitions. [2022-01-18 09:19:41,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 29334 transitions. [2022-01-18 09:19:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:19:41,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:19:41,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:19:41,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-18 09:19:41,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:41,816 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:19:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:19:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1845704274, now seen corresponding path program 7 times [2022-01-18 09:19:41,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:19:41,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270984579] [2022-01-18 09:19:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:19:41,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:19:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:19:41,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:19:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270984579] [2022-01-18 09:19:41,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270984579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:19:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247042338] [2022-01-18 09:19:41,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 09:19:41,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:19:41,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:19:41,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 09:19:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:42,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:19:42,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:19:42,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:19:42,099 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:19:42,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:19:42,217 INFO L387 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-01-18 09:19:42,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:19:42,411 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:19:42,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:19:42,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:19:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:19:42,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:19:44,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (forall ((v_ArrVal_329 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)))) is different from false [2022-01-18 09:19:44,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 Int) (|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_328) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:19:44,637 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:19:44,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:19:44,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:19:44,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:19:44,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:19:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-18 09:19:44,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247042338] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:19:44,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:19:44,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:19:44,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591001482] [2022-01-18 09:19:44,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:19:44,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:19:44,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:19:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:19:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:19:44,862 INFO L87 Difference]: Start difference. First operand 10345 states and 29334 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:19:45,451 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 Int) (|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_328) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:45,860 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 Int) (|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_328) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:47,903 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (forall ((v_ArrVal_329 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:49,921 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (forall ((v_ArrVal_329 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:19:51,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 Int) (|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_328) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:19:51,778 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 Int) (|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_328) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:54,039 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_35| Int)) (or (forall ((v_ArrVal_329 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_35| 4) c_~data~0.offset) v_ArrVal_329) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_35|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:19:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:19:55,157 INFO L93 Difference]: Finished difference Result 47631 states and 135879 transitions. [2022-01-18 09:19:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-01-18 09:19:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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 88 [2022-01-18 09:19:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:19:55,272 INFO L225 Difference]: With dead ends: 47631 [2022-01-18 09:19:55,272 INFO L226 Difference]: Without dead ends: 47385 [2022-01-18 09:19:55,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1391, Invalid=9978, Unknown=9, NotChecked=1962, Total=13340 [2022-01-18 09:19:55,275 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 1611 mSDsluCounter, 10348 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 10273 SdHoareTripleChecker+Invalid, 7044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3531 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:19:55,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 10273 Invalid, 7044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3455 Invalid, 0 Unknown, 3531 Unchecked, 1.2s Time] [2022-01-18 09:19:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47385 states. [2022-01-18 09:19:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47385 to 10400. [2022-01-18 09:19:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10400 states, 10398 states have (on average 2.836507020580881) internal successors, (29494), 10399 states have internal predecessors, (29494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10400 states to 10400 states and 29494 transitions. [2022-01-18 09:19:55,742 INFO L78 Accepts]: Start accepts. Automaton has 10400 states and 29494 transitions. Word has length 88 [2022-01-18 09:19:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:19:55,742 INFO L470 AbstractCegarLoop]: Abstraction has 10400 states and 29494 transitions. [2022-01-18 09:19:55,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:19:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10400 states and 29494 transitions. [2022-01-18 09:19:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:19:55,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:19:55,751 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:19:55,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 09:19:55,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:55,952 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:19:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:19:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -909444464, now seen corresponding path program 8 times [2022-01-18 09:19:55,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:19:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800605366] [2022-01-18 09:19:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:19:55,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:19:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:19:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:19:56,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:19:56,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800605366] [2022-01-18 09:19:56,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800605366] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:19:56,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894499222] [2022-01-18 09:19:56,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:19:56,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:19:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:19:56,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:19:56,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 09:19:56,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:19:56,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:19:56,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:19:56,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:19:56,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:19:56,259 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:19:56,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:19:56,396 INFO L387 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-01-18 09:19:56,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:19:56,592 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:19:56,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:19:56,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:19:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:19:56,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:19:58,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (forall ((v_ArrVal_363 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:19:58,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_362) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:19:58,855 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:19:58,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:19:58,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:19:58,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:19:58,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:19:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-18 09:19:59,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894499222] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:19:59,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:19:59,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:19:59,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156805978] [2022-01-18 09:19:59,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:19:59,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:19:59,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:19:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:19:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:19:59,133 INFO L87 Difference]: Start difference. First operand 10400 states and 29494 transitions. Second operand has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:19:59,697 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_362) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:00,102 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_362) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:02,158 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (forall ((v_ArrVal_363 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:04,173 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (forall ((v_ArrVal_363 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:20:05,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_362) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:20:05,831 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_362) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:08,119 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_39| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_39|)) (forall ((v_ArrVal_363 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_39| 4)) v_ArrVal_363) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:20:09,120 INFO L93 Difference]: Finished difference Result 47732 states and 136130 transitions. [2022-01-18 09:20:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-18 09:20:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-18 09:20:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:20:09,214 INFO L225 Difference]: With dead ends: 47732 [2022-01-18 09:20:09,214 INFO L226 Difference]: Without dead ends: 47576 [2022-01-18 09:20:09,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3558 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1363, Invalid=9794, Unknown=9, NotChecked=1944, Total=13110 [2022-01-18 09:20:09,216 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 1755 mSDsluCounter, 9520 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 9508 SdHoareTripleChecker+Invalid, 6159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2779 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:20:09,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 9508 Invalid, 6159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3313 Invalid, 0 Unknown, 2779 Unchecked, 1.1s Time] [2022-01-18 09:20:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47576 states. [2022-01-18 09:20:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47576 to 10367. [2022-01-18 09:20:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10367 states, 10365 states have (on average 2.836275928605885) internal successors, (29398), 10366 states have internal predecessors, (29398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10367 states to 10367 states and 29398 transitions. [2022-01-18 09:20:09,607 INFO L78 Accepts]: Start accepts. Automaton has 10367 states and 29398 transitions. Word has length 88 [2022-01-18 09:20:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:20:09,607 INFO L470 AbstractCegarLoop]: Abstraction has 10367 states and 29398 transitions. [2022-01-18 09:20:09,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10367 states and 29398 transitions. [2022-01-18 09:20:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 09:20:09,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:20:09,616 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:20:09,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 09:20:09,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:09,835 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:20:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:20:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -809245742, now seen corresponding path program 9 times [2022-01-18 09:20:09,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:20:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253667301] [2022-01-18 09:20:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:20:09,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:20:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:20:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:20:10,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:20:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253667301] [2022-01-18 09:20:10,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253667301] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:20:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437668794] [2022-01-18 09:20:10,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:20:10,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:10,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:20:10,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:20:10,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 09:20:10,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 09:20:10,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:20:10,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:20:10,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:20:10,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:20:10,132 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:20:10,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:20:10,249 INFO L387 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-01-18 09:20:10,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:20:10,419 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:20:10,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:20:10,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:20:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:20:10,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:20:12,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int)) (or (forall ((v_ArrVal_398 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) is different from false [2022-01-18 09:20:12,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int) (v_ArrVal_398 Int) (v_ArrVal_396 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_396) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) is different from false [2022-01-18 09:20:12,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:20:12,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:20:12,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:20:12,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:20:12,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:20:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-18 09:20:12,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437668794] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:20:12,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:20:12,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:20:12,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201970996] [2022-01-18 09:20:12,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:20:12,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:20:12,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:20:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:20:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:20:12,833 INFO L87 Difference]: Start difference. First operand 10367 states and 29398 transitions. Second operand has 32 states, 32 states have (on average 5.96875) internal successors, (191), 32 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:13,430 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int) (v_ArrVal_398 Int) (v_ArrVal_396 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_396) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:13,836 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int) (v_ArrVal_398 Int) (v_ArrVal_396 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_396) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:15,892 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int)) (or (forall ((v_ArrVal_398 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:17,908 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int)) (or (forall ((v_ArrVal_398 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:20:18,773 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int) (v_ArrVal_398 Int) (v_ArrVal_396 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_396) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:20:19,198 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int) (v_ArrVal_398 Int) (v_ArrVal_396 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_396) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:21,399 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_43| Int)) (or (forall ((v_ArrVal_398 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_43| 4) c_~data~0.offset) v_ArrVal_398) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_43|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:20:21,703 INFO L93 Difference]: Finished difference Result 27992 states and 79757 transitions. [2022-01-18 09:20:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 09:20:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.96875) internal successors, (191), 32 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-01-18 09:20:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:20:21,761 INFO L225 Difference]: With dead ends: 27992 [2022-01-18 09:20:21,762 INFO L226 Difference]: Without dead ends: 27836 [2022-01-18 09:20:21,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=507, Invalid=3426, Unknown=9, NotChecked=1170, Total=5112 [2022-01-18 09:20:21,763 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1265 mSDsluCounter, 6239 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 6288 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1724 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:20:21,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 6288 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2138 Invalid, 0 Unknown, 1724 Unchecked, 0.7s Time] [2022-01-18 09:20:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2022-01-18 09:20:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 10373. [2022-01-18 09:20:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10371 states have (on average 2.8362742262076943) internal successors, (29415), 10372 states have internal predecessors, (29415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 29415 transitions. [2022-01-18 09:20:22,031 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 29415 transitions. Word has length 88 [2022-01-18 09:20:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:20:22,031 INFO L470 AbstractCegarLoop]: Abstraction has 10373 states and 29415 transitions. [2022-01-18 09:20:22,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.96875) internal successors, (191), 32 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 29415 transitions. [2022-01-18 09:20:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-18 09:20:22,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:20:22,040 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:20:22,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 09:20:22,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:22,241 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:20:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:20:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash -710491993, now seen corresponding path program 10 times [2022-01-18 09:20:22,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:20:22,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245203208] [2022-01-18 09:20:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:20:22,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:20:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:20:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:20:22,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:20:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245203208] [2022-01-18 09:20:22,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245203208] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:20:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105566281] [2022-01-18 09:20:22,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:20:22,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:22,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:20:22,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:20:22,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 09:20:22,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:20:22,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:20:22,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:20:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:20:22,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:20:22,505 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:20:22,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:20:22,619 INFO L387 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-01-18 09:20:22,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:20:22,746 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:20:22,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:20:22,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:20:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:20:22,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:20:24,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (forall ((v_ArrVal_432 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)))) is different from false [2022-01-18 09:20:24,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:20:24,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:20:24,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:20:24,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:20:24,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:20:24,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:20:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-01-18 09:20:25,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105566281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:20:25,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:20:25,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:20:25,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046007557] [2022-01-18 09:20:25,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:20:25,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:20:25,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:20:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:20:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:20:25,121 INFO L87 Difference]: Start difference. First operand 10373 states and 29415 transitions. Second operand has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:25,691 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:27,791 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (forall ((v_ArrVal_432 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:29,828 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (forall ((v_ArrVal_432 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:20:30,480 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:32,836 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (forall ((v_ArrVal_432 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:33,528 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:20:36,320 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (forall ((v_ArrVal_432 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:37,772 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_47| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_47|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_47| 4) c_~data~0.offset) v_ArrVal_432) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:20:38,362 INFO L93 Difference]: Finished difference Result 57336 states and 163527 transitions. [2022-01-18 09:20:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-01-18 09:20:38,362 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 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-01-18 09:20:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:20:38,499 INFO L225 Difference]: With dead ends: 57336 [2022-01-18 09:20:38,500 INFO L226 Difference]: Without dead ends: 56871 [2022-01-18 09:20:38,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 7637 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2361, Invalid=18839, Unknown=10, NotChecked=2970, Total=24180 [2022-01-18 09:20:38,503 INFO L933 BasicCegarLoop]: 796 mSDtfsCounter, 1917 mSDsluCounter, 13305 mSDsCounter, 0 mSdLazyCounter, 4884 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 13214 SdHoareTripleChecker+Invalid, 8290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3326 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:20:38,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1917 Valid, 13214 Invalid, 8290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4884 Invalid, 0 Unknown, 3326 Unchecked, 1.6s Time] [2022-01-18 09:20:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56871 states. [2022-01-18 09:20:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56871 to 11313. [2022-01-18 09:20:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11313 states, 11311 states have (on average 2.843161524180002) internal successors, (32159), 11312 states have internal predecessors, (32159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 32159 transitions. [2022-01-18 09:20:38,992 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 32159 transitions. Word has length 89 [2022-01-18 09:20:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:20:38,992 INFO L470 AbstractCegarLoop]: Abstraction has 11313 states and 32159 transitions. [2022-01-18 09:20:38,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 32159 transitions. [2022-01-18 09:20:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-18 09:20:39,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:20:39,002 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:20:39,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 09:20:39,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:39,212 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:20:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:20:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1926862363, now seen corresponding path program 11 times [2022-01-18 09:20:39,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:20:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170616863] [2022-01-18 09:20:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:20:39,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:20:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:20:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:20:39,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:20:39,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170616863] [2022-01-18 09:20:39,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170616863] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:20:39,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351131548] [2022-01-18 09:20:39,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:20:39,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:39,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:20:39,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:20:39,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 09:20:39,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:20:39,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:20:39,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-18 09:20:39,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:20:39,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:20:39,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 09:20:39,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:20:39,787 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:20:39,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:20:39,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:20:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:20:39,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:20:41,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (forall ((v_ArrVal_465 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:20:41,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:20:41,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:20:41,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:20:41,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:20:41,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:20:41,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:20:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-01-18 09:20:42,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351131548] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:20:42,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:20:42,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2022-01-18 09:20:42,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756798983] [2022-01-18 09:20:42,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:20:42,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-18 09:20:42,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:20:42,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-18 09:20:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=944, Unknown=2, NotChecked=126, Total=1190 [2022-01-18 09:20:42,202 INFO L87 Difference]: Start difference. First operand 11313 states and 32159 transitions. Second operand has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:42,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:20:43,394 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:45,418 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (forall ((v_ArrVal_465 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:20:47,468 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (forall ((v_ArrVal_465 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:20:48,245 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:49,029 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:20:51,165 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (forall ((v_ArrVal_465 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-01-18 09:20:51,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-01-18 09:20:53,055 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:20:55,203 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (forall ((v_ArrVal_465 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-01-18 09:20:56,834 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_51| Int) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_51|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_463) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_51| 4) c_~data~0.offset) v_ArrVal_465) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:20:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:20:57,775 INFO L93 Difference]: Finished difference Result 67359 states and 192473 transitions. [2022-01-18 09:20:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-01-18 09:20:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 0 states have call successors, (0), 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-01-18 09:20:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:20:57,922 INFO L225 Difference]: With dead ends: 67359 [2022-01-18 09:20:57,922 INFO L226 Difference]: Without dead ends: 67164 [2022-01-18 09:20:57,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7610 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=2466, Invalid=19923, Unknown=13, NotChecked=4004, Total=26406 [2022-01-18 09:20:57,926 INFO L933 BasicCegarLoop]: 863 mSDtfsCounter, 2326 mSDsluCounter, 16088 mSDsCounter, 0 mSdLazyCounter, 5555 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 15910 SdHoareTripleChecker+Invalid, 10418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4783 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:20:57,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2326 Valid, 15910 Invalid, 10418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5555 Invalid, 0 Unknown, 4783 Unchecked, 1.8s Time] [2022-01-18 09:20:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67164 states. [2022-01-18 09:20:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67164 to 11431. [2022-01-18 09:20:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11431 states, 11429 states have (on average 2.8437308600927467) internal successors, (32501), 11430 states have internal predecessors, (32501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11431 states to 11431 states and 32501 transitions. [2022-01-18 09:20:58,478 INFO L78 Accepts]: Start accepts. Automaton has 11431 states and 32501 transitions. Word has length 89 [2022-01-18 09:20:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:20:58,478 INFO L470 AbstractCegarLoop]: Abstraction has 11431 states and 32501 transitions. [2022-01-18 09:20:58,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:20:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 11431 states and 32501 transitions. [2022-01-18 09:20:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-18 09:20:58,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:20:58,488 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:20:58,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 09:20:58,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-18 09:20:58,703 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:20:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:20:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1156876185, now seen corresponding path program 12 times [2022-01-18 09:20:58,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:20:58,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544889587] [2022-01-18 09:20:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:20:58,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:20:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:20:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:20:58,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:20:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544889587] [2022-01-18 09:20:58,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544889587] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:20:58,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950516542] [2022-01-18 09:20:58,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:20:58,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:20:58,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:20:58,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:20:58,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 09:20:58,943 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-18 09:20:58,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:20:58,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:20:58,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:20:58,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:20:58,988 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:20:58,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:20:59,113 INFO L387 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-01-18 09:20:59,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:20:59,258 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:20:59,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:20:59,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:20:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:20:59,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:21:01,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (forall ((v_ArrVal_498 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) is different from false [2022-01-18 09:21:01,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) is different from false [2022-01-18 09:21:01,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:21:01,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:21:01,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:21:01,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:21:01,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:21:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-18 09:21:01,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950516542] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:21:01,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:21:01,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:21:01,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057463306] [2022-01-18 09:21:01,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:21:01,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:21:01,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:21:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:21:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:21:01,673 INFO L87 Difference]: Start difference. First operand 11431 states and 32501 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:21:02,247 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:02,695 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:04,736 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (forall ((v_ArrVal_498 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:06,773 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (forall ((v_ArrVal_498 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:21:07,455 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:08,020 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:10,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (forall ((v_ArrVal_498 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:10,821 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:21:11,646 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:13,853 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (forall ((v_ArrVal_498 Int)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:14,981 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (forall ((v_ArrVal_498 Int) (v_ArrVal_497 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_55| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_55| 4) c_~data~0.offset) v_ArrVal_498) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_55|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:21:15,100 INFO L93 Difference]: Finished difference Result 43246 states and 123357 transitions. [2022-01-18 09:21:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-18 09:21:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:21:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:21:15,182 INFO L225 Difference]: With dead ends: 43246 [2022-01-18 09:21:15,182 INFO L226 Difference]: Without dead ends: 43126 [2022-01-18 09:21:15,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3571 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1368, Invalid=9801, Unknown=13, NotChecked=2860, Total=14042 [2022-01-18 09:21:15,183 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 1661 mSDsluCounter, 10232 mSDsCounter, 0 mSdLazyCounter, 3506 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 10207 SdHoareTripleChecker+Invalid, 6557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3001 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:21:15,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1661 Valid, 10207 Invalid, 6557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3506 Invalid, 0 Unknown, 3001 Unchecked, 1.1s Time] [2022-01-18 09:21:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43126 states. [2022-01-18 09:21:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43126 to 11456. [2022-01-18 09:21:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11456 states, 11454 states have (on average 2.8436354112100575) internal successors, (32571), 11455 states have internal predecessors, (32571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11456 states to 11456 states and 32571 transitions. [2022-01-18 09:21:15,555 INFO L78 Accepts]: Start accepts. Automaton has 11456 states and 32571 transitions. Word has length 89 [2022-01-18 09:21:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:21:15,555 INFO L470 AbstractCegarLoop]: Abstraction has 11456 states and 32571 transitions. [2022-01-18 09:21:15,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:21:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11456 states and 32571 transitions. [2022-01-18 09:21:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-18 09:21:15,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:21:15,565 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:21:15,582 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-01-18 09:21:15,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-18 09:21:15,776 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:21:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:21:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 913749029, now seen corresponding path program 13 times [2022-01-18 09:21:15,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:21:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313957438] [2022-01-18 09:21:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:21:15,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:21:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:21:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:21:15,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:21:15,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313957438] [2022-01-18 09:21:15,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313957438] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:21:15,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635538196] [2022-01-18 09:21:15,961 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 09:21:15,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:21:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:21:15,962 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-01-18 09:21:15,962 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-01-18 09:21:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:21:16,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:21:16,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:21:16,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:21:16,078 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:21:16,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:21:16,196 INFO L387 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-01-18 09:21:16,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:21:16,334 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:21:16,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:21:16,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:21:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:21:16,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:21:18,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_59| Int)) (or (forall ((v_ArrVal_533 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) is different from false [2022-01-18 09:21:18,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) is different from false [2022-01-18 09:21:18,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:21:18,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:21:18,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:21:18,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:21:18,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:21:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-18 09:21:18,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635538196] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:21:18,703 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:21:18,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:21:18,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533503997] [2022-01-18 09:21:18,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:21:18,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:21:18,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:21:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:21:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:21:18,704 INFO L87 Difference]: Start difference. First operand 11456 states and 32571 transitions. Second operand has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:21:19,269 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:19,689 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:21,746 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_59| Int)) (or (forall ((v_ArrVal_533 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:23,785 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_59| Int)) (or (forall ((v_ArrVal_533 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:21:24,433 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:24,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:27,235 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_59| Int)) (or (forall ((v_ArrVal_533 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:27,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:21:28,640 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:31,087 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_59| Int)) (or (forall ((v_ArrVal_533 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:32,435 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_533 Int) (|v_thrThread2of2ForFork0_~c~0#1_59| Int) (v_ArrVal_531 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_531) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_59| 4) c_~data~0.offset) v_ArrVal_533) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_59|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:21:32,930 INFO L93 Difference]: Finished difference Result 56928 states and 162462 transitions. [2022-01-18 09:21:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-01-18 09:21:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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 89 [2022-01-18 09:21:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:21:33,053 INFO L225 Difference]: With dead ends: 56928 [2022-01-18 09:21:33,053 INFO L226 Difference]: Without dead ends: 56682 [2022-01-18 09:21:33,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7239 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2301, Invalid=18044, Unknown=13, NotChecked=3822, Total=24180 [2022-01-18 09:21:33,056 INFO L933 BasicCegarLoop]: 771 mSDtfsCounter, 1879 mSDsluCounter, 12742 mSDsCounter, 0 mSdLazyCounter, 4392 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 12640 SdHoareTripleChecker+Invalid, 7151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2694 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:21:33,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1879 Valid, 12640 Invalid, 7151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4392 Invalid, 0 Unknown, 2694 Unchecked, 1.4s Time] [2022-01-18 09:21:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56682 states. [2022-01-18 09:21:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56682 to 11362. [2022-01-18 09:21:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11362 states, 11360 states have (on average 2.843045774647887) internal successors, (32297), 11361 states have internal predecessors, (32297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11362 states to 11362 states and 32297 transitions. [2022-01-18 09:21:33,534 INFO L78 Accepts]: Start accepts. Automaton has 11362 states and 32297 transitions. Word has length 89 [2022-01-18 09:21:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:21:33,534 INFO L470 AbstractCegarLoop]: Abstraction has 11362 states and 32297 transitions. [2022-01-18 09:21:33,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:21:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 11362 states and 32297 transitions. [2022-01-18 09:21:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-18 09:21:33,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:21:33,543 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:21:33,559 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-01-18 09:21:33,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-18 09:21:33,744 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:21:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:21:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1403484071, now seen corresponding path program 14 times [2022-01-18 09:21:33,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:21:33,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493502391] [2022-01-18 09:21:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:21:33,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:21:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:21:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:21:33,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:21:33,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493502391] [2022-01-18 09:21:33,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493502391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:21:33,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472595415] [2022-01-18 09:21:33,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:21:33,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:21:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:21:33,920 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-01-18 09:21:33,922 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-01-18 09:21:33,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:21:33,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:21:34,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:21:34,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:21:34,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:21:34,042 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:21:34,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:21:34,147 INFO L387 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-01-18 09:21:34,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:21:34,276 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:21:34,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:21:34,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:21:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:21:34,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:21:36,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_63| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (forall ((v_ArrVal_566 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:21:36,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:21:36,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:21:36,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:21:36,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:21:36,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:21:36,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:21:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-18 09:21:36,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472595415] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:21:36,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:21:36,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:21:36,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971168754] [2022-01-18 09:21:36,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:21:36,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:21:36,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:21:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:21:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:21:36,666 INFO L87 Difference]: Start difference. First operand 11362 states and 32297 transitions. Second operand has 32 states, 32 states have (on average 6.03125) internal successors, (193), 32 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:37,214 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:37,627 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:39,699 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_63| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (forall ((v_ArrVal_566 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:41,733 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_63| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (forall ((v_ArrVal_566 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:21:42,353 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:42,890 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:45,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_63| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (forall ((v_ArrVal_566 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:45,619 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:21:46,170 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_566 Int) (|v_thrThread2of2ForFork0_~c~0#1_63| Int) (v_ArrVal_565 (Array Int Int))) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_565) c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:48,483 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_63| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_63|)) (forall ((v_ArrVal_566 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_63| 4)) v_ArrVal_566) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:21:48,963 INFO L93 Difference]: Finished difference Result 37406 states and 106731 transitions. [2022-01-18 09:21:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-18 09:21:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.03125) internal successors, (193), 32 states have internal predecessors, (193), 0 states have call successors, (0), 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-01-18 09:21:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:21:49,035 INFO L225 Difference]: With dead ends: 37406 [2022-01-18 09:21:49,035 INFO L226 Difference]: Without dead ends: 37286 [2022-01-18 09:21:49,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1122, Invalid=7844, Unknown=12, NotChecked=2364, Total=11342 [2022-01-18 09:21:49,037 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 1763 mSDsluCounter, 7119 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 7166 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1988 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:21:49,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1763 Valid, 7166 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2362 Invalid, 0 Unknown, 1988 Unchecked, 0.8s Time] [2022-01-18 09:21:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37286 states. [2022-01-18 09:21:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37286 to 11512. [2022-01-18 09:21:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11512 states, 11510 states have (on average 2.8438748913987837) internal successors, (32733), 11511 states have internal predecessors, (32733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 32733 transitions. [2022-01-18 09:21:49,378 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 32733 transitions. Word has length 89 [2022-01-18 09:21:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:21:49,378 INFO L470 AbstractCegarLoop]: Abstraction has 11512 states and 32733 transitions. [2022-01-18 09:21:49,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.03125) internal successors, (193), 32 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 32733 transitions. [2022-01-18 09:21:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-18 09:21:49,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:21:49,388 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:21:49,404 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-01-18 09:21:49,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 09:21:49,591 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:21:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:21:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 965705951, now seen corresponding path program 15 times [2022-01-18 09:21:49,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:21:49,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822144447] [2022-01-18 09:21:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:21:49,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:21:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:21:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:21:49,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:21:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822144447] [2022-01-18 09:21:49,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822144447] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:21:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337560821] [2022-01-18 09:21:49,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:21:49,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:21:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:21:49,767 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-01-18 09:21:49,768 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-01-18 09:21:49,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 09:21:49,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:21:49,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:21:49,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:21:49,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:21:49,880 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:21:49,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:21:49,992 INFO L387 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-01-18 09:21:50,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:21:50,106 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:21:50,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:21:50,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:21:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:21:50,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:21:52,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_67| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (forall ((v_ArrVal_600 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:21:52,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_67| Int) (v_ArrVal_600 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_599) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:21:52,314 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:21:52,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:21:52,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:21:52,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:21:52,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:21:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-01-18 09:21:52,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337560821] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:21:52,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:21:52,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:21:52,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804265205] [2022-01-18 09:21:52,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:21:52,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:21:52,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:21:52,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:21:52,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:21:52,507 INFO L87 Difference]: Start difference. First operand 11512 states and 32733 transitions. Second operand has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:21:53,080 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_599 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_67| Int) (v_ArrVal_600 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_599) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:55,186 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_67| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (forall ((v_ArrVal_600 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:21:57,230 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_67| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (forall ((v_ArrVal_600 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:21:57,903 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_599 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_67| Int) (v_ArrVal_600 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_599) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:00,252 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_67| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (forall ((v_ArrVal_600 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:00,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_599 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_67| Int) (v_ArrVal_600 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_599) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:22:03,627 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_67| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (forall ((v_ArrVal_600 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:04,964 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_599 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_67| Int) (v_ArrVal_600 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_67|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_599) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_67| 4) c_~data~0.offset) v_ArrVal_600) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:22:05,601 INFO L93 Difference]: Finished difference Result 56560 states and 161547 transitions. [2022-01-18 09:22:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-01-18 09:22:05,601 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-18 09:22:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:22:05,721 INFO L225 Difference]: With dead ends: 56560 [2022-01-18 09:22:05,721 INFO L226 Difference]: Without dead ends: 56212 [2022-01-18 09:22:05,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5887 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1915, Invalid=15145, Unknown=10, NotChecked=2670, Total=19740 [2022-01-18 09:22:05,724 INFO L933 BasicCegarLoop]: 850 mSDtfsCounter, 1758 mSDsluCounter, 13969 mSDsCounter, 0 mSdLazyCounter, 5012 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 13906 SdHoareTripleChecker+Invalid, 9032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 5012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3962 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:22:05,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1758 Valid, 13906 Invalid, 9032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 5012 Invalid, 0 Unknown, 3962 Unchecked, 1.6s Time] [2022-01-18 09:22:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56212 states. [2022-01-18 09:22:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56212 to 12344. [2022-01-18 09:22:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12344 states, 12342 states have (on average 2.8494571382271916) internal successors, (35168), 12343 states have internal predecessors, (35168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12344 states to 12344 states and 35168 transitions. [2022-01-18 09:22:06,211 INFO L78 Accepts]: Start accepts. Automaton has 12344 states and 35168 transitions. Word has length 90 [2022-01-18 09:22:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:22:06,211 INFO L470 AbstractCegarLoop]: Abstraction has 12344 states and 35168 transitions. [2022-01-18 09:22:06,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 12344 states and 35168 transitions. [2022-01-18 09:22:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-18 09:22:06,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:22:06,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:22:06,237 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-01-18 09:22:06,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-18 09:22:06,431 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:22:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:22:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1912930145, now seen corresponding path program 16 times [2022-01-18 09:22:06,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:22:06,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129805862] [2022-01-18 09:22:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:22:06,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:22:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:22:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:22:06,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:22:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129805862] [2022-01-18 09:22:06,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129805862] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:22:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082948174] [2022-01-18 09:22:06,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:22:06,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:06,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:22:06,587 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-01-18 09:22:06,587 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-01-18 09:22:06,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:22:06,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:22:06,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:22:06,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:22:06,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:22:06,707 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:22:06,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:22:06,817 INFO L387 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-01-18 09:22:06,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:22:06,941 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:22:06,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:22:06,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:22:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:22:06,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:22:09,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_71| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (forall ((v_ArrVal_635 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:22:09,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:22:09,133 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:22:09,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:22:09,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:22:09,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:22:09,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:22:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2022-01-18 09:22:09,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082948174] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:22:09,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:22:09,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:22:09,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485255504] [2022-01-18 09:22:09,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:22:09,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:22:09,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:22:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:22:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:22:09,308 INFO L87 Difference]: Start difference. First operand 12344 states and 35168 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:22:09,858 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:10,309 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:12,328 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_71| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (forall ((v_ArrVal_635 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:14,365 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_71| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (forall ((v_ArrVal_635 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:22:15,002 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:15,660 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:17,778 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_71| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (forall ((v_ArrVal_635 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:18,497 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:22:19,536 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:21,662 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_71| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (forall ((v_ArrVal_635 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:22,992 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_633 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_71| Int) (v_ArrVal_635 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_71|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_633) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_71| 4) c_~data~0.offset) v_ArrVal_635) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:22:23,464 INFO L93 Difference]: Finished difference Result 57872 states and 165238 transitions. [2022-01-18 09:22:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-01-18 09:22:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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 90 [2022-01-18 09:22:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:22:23,580 INFO L225 Difference]: With dead ends: 57872 [2022-01-18 09:22:23,580 INFO L226 Difference]: Without dead ends: 57626 [2022-01-18 09:22:23,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7213 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2301, Invalid=18044, Unknown=13, NotChecked=3822, Total=24180 [2022-01-18 09:22:23,583 INFO L933 BasicCegarLoop]: 778 mSDtfsCounter, 1880 mSDsluCounter, 11868 mSDsCounter, 0 mSdLazyCounter, 4213 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 11809 SdHoareTripleChecker+Invalid, 7471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3187 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:22:23,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1880 Valid, 11809 Invalid, 7471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4213 Invalid, 0 Unknown, 3187 Unchecked, 1.3s Time] [2022-01-18 09:22:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57626 states. [2022-01-18 09:22:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57626 to 12083. [2022-01-18 09:22:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12083 states, 12081 states have (on average 2.846287558976906) internal successors, (34386), 12082 states have internal predecessors, (34386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12083 states to 12083 states and 34386 transitions. [2022-01-18 09:22:24,096 INFO L78 Accepts]: Start accepts. Automaton has 12083 states and 34386 transitions. Word has length 90 [2022-01-18 09:22:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:22:24,097 INFO L470 AbstractCegarLoop]: Abstraction has 12083 states and 34386 transitions. [2022-01-18 09:22:24,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:22:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12083 states and 34386 transitions. [2022-01-18 09:22:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-18 09:22:24,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:22:24,107 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:22:24,125 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-01-18 09:22:24,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-18 09:22:24,308 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:22:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:22:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 12697887, now seen corresponding path program 17 times [2022-01-18 09:22:24,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:22:24,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325818137] [2022-01-18 09:22:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:22:24,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:22:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:22:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:22:24,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:22:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325818137] [2022-01-18 09:22:24,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325818137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:22:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345888036] [2022-01-18 09:22:24,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:22:24,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:22:24,465 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-01-18 09:22:24,466 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-01-18 09:22:24,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:22:24,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:22:24,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:22:24,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:22:24,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:22:24,597 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:22:24,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:22:24,709 INFO L387 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-01-18 09:22:24,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:22:24,834 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:22:24,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:22:24,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:22:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:22:24,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:22:26,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_75| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (forall ((v_ArrVal_668 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:22:27,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:22:27,023 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:22:27,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:22:27,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:22:27,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:22:27,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:22:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-01-18 09:22:27,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345888036] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:22:27,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:22:27,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:22:27,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468052097] [2022-01-18 09:22:27,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:22:27,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:22:27,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:22:27,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:22:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:22:27,189 INFO L87 Difference]: Start difference. First operand 12083 states and 34386 transitions. Second operand has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:22:27,736 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:28,158 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:30,195 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_75| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (forall ((v_ArrVal_668 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:32,228 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_75| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (forall ((v_ArrVal_668 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:22:32,844 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:33,476 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:35,656 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_75| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (forall ((v_ArrVal_668 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:36,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:22:37,116 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:39,391 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_75| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (forall ((v_ArrVal_668 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:40,659 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_667 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_75| Int) (v_ArrVal_668 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_75|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_667) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_75| 4) c_~data~0.offset) v_ArrVal_668) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:22:41,166 INFO L93 Difference]: Finished difference Result 57893 states and 165261 transitions. [2022-01-18 09:22:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-01-18 09:22:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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 90 [2022-01-18 09:22:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:22:41,281 INFO L225 Difference]: With dead ends: 57893 [2022-01-18 09:22:41,282 INFO L226 Difference]: Without dead ends: 57647 [2022-01-18 09:22:41,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7610 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2367, Invalid=18842, Unknown=13, NotChecked=3900, Total=25122 [2022-01-18 09:22:41,285 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 2162 mSDsluCounter, 10693 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 10708 SdHoareTripleChecker+Invalid, 8518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4825 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:22:41,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2162 Valid, 10708 Invalid, 8518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3613 Invalid, 0 Unknown, 4825 Unchecked, 1.2s Time] [2022-01-18 09:22:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2022-01-18 09:22:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 11978. [2022-01-18 09:22:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11978 states, 11976 states have (on average 2.844522378089512) internal successors, (34066), 11977 states have internal predecessors, (34066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11978 states to 11978 states and 34066 transitions. [2022-01-18 09:22:41,730 INFO L78 Accepts]: Start accepts. Automaton has 11978 states and 34066 transitions. Word has length 90 [2022-01-18 09:22:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:22:41,730 INFO L470 AbstractCegarLoop]: Abstraction has 11978 states and 34066 transitions. [2022-01-18 09:22:41,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:22:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 11978 states and 34066 transitions. [2022-01-18 09:22:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-18 09:22:41,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:22:41,740 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:22:41,755 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-01-18 09:22:41,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:41,940 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:22:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:22:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -222429919, now seen corresponding path program 18 times [2022-01-18 09:22:41,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:22:41,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923588133] [2022-01-18 09:22:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:22:41,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:22:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:22:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:22:42,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:22:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923588133] [2022-01-18 09:22:42,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923588133] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:22:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135974334] [2022-01-18 09:22:42,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:22:42,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:22:42,119 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-01-18 09:22:42,120 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-01-18 09:22:42,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 09:22:42,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:22:42,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:22:42,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:22:42,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:22:42,249 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:22:42,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:22:42,361 INFO L387 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-01-18 09:22:42,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:22:42,484 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:22:42,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:22:42,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:22:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:22:42,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:22:44,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_79| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)) (forall ((v_ArrVal_702 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:22:44,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) is different from false [2022-01-18 09:22:44,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:22:44,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:22:44,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:22:44,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:22:44,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:22:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-18 09:22:44,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135974334] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:22:44,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:22:44,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:22:44,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53122581] [2022-01-18 09:22:44,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:22:44,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:22:44,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:22:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:22:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:22:44,859 INFO L87 Difference]: Start difference. First operand 11978 states and 34066 transitions. Second operand has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:45,403 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:45,810 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:47,861 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_79| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)) (forall ((v_ArrVal_702 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:49,895 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_79| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)) (forall ((v_ArrVal_702 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:22:50,492 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:51,013 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:53,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_79| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)) (forall ((v_ArrVal_702 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:53,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:22:54,409 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:56,765 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_79| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)) (forall ((v_ArrVal_702 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:57,794 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (forall ((v_ArrVal_701 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_79| Int) (v_ArrVal_702 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_701) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_79| 4) c_~data~0.offset) v_ArrVal_702) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_79|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:22:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:22:57,918 INFO L93 Difference]: Finished difference Result 45214 states and 128998 transitions. [2022-01-18 09:22:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-01-18 09:22:57,918 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 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-01-18 09:22:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:22:58,000 INFO L225 Difference]: With dead ends: 45214 [2022-01-18 09:22:58,000 INFO L226 Difference]: Without dead ends: 45088 [2022-01-18 09:22:58,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1350, Invalid=9609, Unknown=13, NotChecked=2834, Total=13806 [2022-01-18 09:22:58,002 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 1800 mSDsluCounter, 9602 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 9677 SdHoareTripleChecker+Invalid, 6881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3531 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 09:22:58,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1800 Valid, 9677 Invalid, 6881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3307 Invalid, 0 Unknown, 3531 Unchecked, 1.0s Time] [2022-01-18 09:22:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45088 states. [2022-01-18 09:22:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45088 to 11820. [2022-01-18 09:22:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11820 states, 11818 states have (on average 2.8431206633948216) internal successors, (33600), 11819 states have internal predecessors, (33600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11820 states to 11820 states and 33600 transitions. [2022-01-18 09:22:58,369 INFO L78 Accepts]: Start accepts. Automaton has 11820 states and 33600 transitions. Word has length 90 [2022-01-18 09:22:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:22:58,369 INFO L470 AbstractCegarLoop]: Abstraction has 11820 states and 33600 transitions. [2022-01-18 09:22:58,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:22:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11820 states and 33600 transitions. [2022-01-18 09:22:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-18 09:22:58,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:22:58,379 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:22:58,394 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-01-18 09:22:58,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:58,580 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:22:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:22:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash 217791351, now seen corresponding path program 19 times [2022-01-18 09:22:58,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:22:58,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419084557] [2022-01-18 09:22:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:22:58,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:22:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:22:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:22:58,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:22:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419084557] [2022-01-18 09:22:58,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419084557] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:22:58,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751820674] [2022-01-18 09:22:58,745 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 09:22:58,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:22:58,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:22:58,746 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-01-18 09:22:58,746 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-01-18 09:22:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:22:58,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:22:58,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:22:58,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:22:58,865 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:22:58,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:22:58,978 INFO L387 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-01-18 09:22:59,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:22:59,096 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:22:59,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:22:59,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:22:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:22:59,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:23:01,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_83| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (forall ((v_ArrVal_736 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:23:01,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_83| Int) (v_ArrVal_736 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_735) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:23:01,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:23:01,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:23:01,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:23:01,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:23:01,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:23:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-01-18 09:23:01,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751820674] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:23:01,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:23:01,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:23:01,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279161680] [2022-01-18 09:23:01,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:23:01,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:23:01,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:23:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:23:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:23:01,482 INFO L87 Difference]: Start difference. First operand 11820 states and 33600 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:23:02,002 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_735 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_83| Int) (v_ArrVal_736 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_735) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:04,050 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_83| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (forall ((v_ArrVal_736 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:06,060 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_83| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (forall ((v_ArrVal_736 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:23:06,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_735 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_83| Int) (v_ArrVal_736 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_735) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:23:08,811 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_83| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_83|)) (forall ((v_ArrVal_736 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_736) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:23:09,016 INFO L93 Difference]: Finished difference Result 31399 states and 89532 transitions. [2022-01-18 09:23:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-18 09:23:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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 91 [2022-01-18 09:23:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:23:09,070 INFO L225 Difference]: With dead ends: 31399 [2022-01-18 09:23:09,070 INFO L226 Difference]: Without dead ends: 31324 [2022-01-18 09:23:09,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=328, Invalid=2143, Unknown=7, NotChecked=714, Total=3192 [2022-01-18 09:23:09,071 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 1054 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1441 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:23:09,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 5465 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1363 Invalid, 0 Unknown, 1441 Unchecked, 0.4s Time] [2022-01-18 09:23:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31324 states. [2022-01-18 09:23:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31324 to 11830. [2022-01-18 09:23:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11828 states have (on average 2.843253297260737) internal successors, (33630), 11829 states have internal predecessors, (33630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:23:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 33630 transitions. [2022-01-18 09:23:09,342 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 33630 transitions. Word has length 91 [2022-01-18 09:23:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:23:09,342 INFO L470 AbstractCegarLoop]: Abstraction has 11830 states and 33630 transitions. [2022-01-18 09:23:09,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 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-01-18 09:23:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 33630 transitions. [2022-01-18 09:23:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-18 09:23:09,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:23:09,352 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:23:09,367 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-01-18 09:23:09,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:09,553 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:23:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:23:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -483029707, now seen corresponding path program 20 times [2022-01-18 09:23:09,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:23:09,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717592736] [2022-01-18 09:23:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:23:09,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:23:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:23:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:23:09,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:23:09,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717592736] [2022-01-18 09:23:09,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717592736] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:23:09,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937844604] [2022-01-18 09:23:09,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:23:09,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:23:09,699 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-01-18 09:23:09,700 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-01-18 09:23:09,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:23:09,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:23:09,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:23:09,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:23:09,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:23:09,822 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:23:09,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:23:09,928 INFO L387 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-01-18 09:23:09,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:23:10,053 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:23:10,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:23:10,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:23:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:23:10,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:23:12,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int)) (or (forall ((v_ArrVal_770 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) is different from false [2022-01-18 09:23:12,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) is different from false [2022-01-18 09:23:12,248 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:23:12,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:23:12,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:23:12,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:23:12,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:23:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-01-18 09:23:12,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937844604] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:23:12,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:23:12,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:23:12,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718207791] [2022-01-18 09:23:12,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:23:12,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:23:12,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:23:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:23:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:23:12,414 INFO L87 Difference]: Start difference. First operand 11830 states and 33630 transitions. Second operand has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:23:12,971 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:13,423 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:15,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int)) (or (forall ((v_ArrVal_770 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:17,483 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int)) (or (forall ((v_ArrVal_770 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:23:18,137 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:18,850 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:20,943 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int)) (or (forall ((v_ArrVal_770 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:21,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:23:22,761 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:24,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int)) (or (forall ((v_ArrVal_770 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:26,334 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_87| Int) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_769) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_87| 4) c_~data~0.offset) v_ArrVal_770) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_87|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:23:26,864 INFO L93 Difference]: Finished difference Result 59644 states and 170245 transitions. [2022-01-18 09:23:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-01-18 09:23:26,864 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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 91 [2022-01-18 09:23:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:23:26,982 INFO L225 Difference]: With dead ends: 59644 [2022-01-18 09:23:26,982 INFO L226 Difference]: Without dead ends: 59215 [2022-01-18 09:23:26,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7590 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2367, Invalid=18842, Unknown=13, NotChecked=3900, Total=25122 [2022-01-18 09:23:26,985 INFO L933 BasicCegarLoop]: 788 mSDtfsCounter, 1869 mSDsluCounter, 14525 mSDsCounter, 0 mSdLazyCounter, 5092 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 14274 SdHoareTripleChecker+Invalid, 9355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 5092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4199 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:23:26,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1869 Valid, 14274 Invalid, 9355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 5092 Invalid, 0 Unknown, 4199 Unchecked, 1.6s Time] [2022-01-18 09:23:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59215 states. [2022-01-18 09:23:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59215 to 12578. [2022-01-18 09:23:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12578 states, 12576 states have (on average 2.8485209923664123) internal successors, (35823), 12577 states have internal predecessors, (35823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:23:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12578 states to 12578 states and 35823 transitions. [2022-01-18 09:23:27,457 INFO L78 Accepts]: Start accepts. Automaton has 12578 states and 35823 transitions. Word has length 91 [2022-01-18 09:23:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:23:27,457 INFO L470 AbstractCegarLoop]: Abstraction has 12578 states and 35823 transitions. [2022-01-18 09:23:27,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:23:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12578 states and 35823 transitions. [2022-01-18 09:23:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-18 09:23:27,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:23:27,467 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:23:27,487 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-01-18 09:23:27,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:27,668 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:23:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:23:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 739312439, now seen corresponding path program 21 times [2022-01-18 09:23:27,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:23:27,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975458564] [2022-01-18 09:23:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:23:27,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:23:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:23:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:23:27,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:23:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975458564] [2022-01-18 09:23:27,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975458564] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:23:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394663749] [2022-01-18 09:23:27,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:23:27,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:23:27,849 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-01-18 09:23:27,852 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-01-18 09:23:27,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 09:23:27,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:23:27,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:23:27,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:23:27,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:23:27,987 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:23:27,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:23:28,099 INFO L387 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-01-18 09:23:28,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:23:28,232 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:23:28,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:23:28,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:23:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 09:23:28,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:23:30,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_91| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)) (forall ((v_ArrVal_805 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:23:30,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) is different from false [2022-01-18 09:23:30,447 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:23:30,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:23:30,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:23:30,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:23:30,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:23:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2022-01-18 09:23:30,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394663749] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:23:30,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:23:30,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:23:30,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750063260] [2022-01-18 09:23:30,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:23:30,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:23:30,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:23:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:23:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:23:30,621 INFO L87 Difference]: Start difference. First operand 12578 states and 35823 transitions. Second operand has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:23:31,174 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:31,635 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:33,675 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_91| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)) (forall ((v_ArrVal_805 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:35,711 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_91| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)) (forall ((v_ArrVal_805 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:23:36,377 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:36,921 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:39,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_91| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)) (forall ((v_ArrVal_805 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:39,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:23:40,386 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:42,633 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_91| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)) (forall ((v_ArrVal_805 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:43,963 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_803 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_91| Int) (v_ArrVal_805 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_803) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_91| 4) c_~data~0.offset) v_ArrVal_805) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_91|)))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:23:44,769 INFO L93 Difference]: Finished difference Result 58488 states and 167050 transitions. [2022-01-18 09:23:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-01-18 09:23:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 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-01-18 09:23:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:23:44,891 INFO L225 Difference]: With dead ends: 58488 [2022-01-18 09:23:44,891 INFO L226 Difference]: Without dead ends: 58149 [2022-01-18 09:23:44,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 5856 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1914, Invalid=15155, Unknown=13, NotChecked=3510, Total=20592 [2022-01-18 09:23:44,893 INFO L933 BasicCegarLoop]: 905 mSDtfsCounter, 2034 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 4838 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 13540 SdHoareTripleChecker+Invalid, 11727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6818 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:23:44,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2034 Valid, 13540 Invalid, 11727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 4838 Invalid, 0 Unknown, 6818 Unchecked, 1.6s Time] [2022-01-18 09:23:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58149 states. [2022-01-18 09:23:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58149 to 12609. [2022-01-18 09:23:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12609 states, 12607 states have (on average 2.847862298722932) internal successors, (35903), 12608 states have internal predecessors, (35903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:23:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 35903 transitions. [2022-01-18 09:23:45,390 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 35903 transitions. Word has length 91 [2022-01-18 09:23:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:23:45,390 INFO L470 AbstractCegarLoop]: Abstraction has 12609 states and 35903 transitions. [2022-01-18 09:23:45,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:23:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 35903 transitions. [2022-01-18 09:23:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-18 09:23:45,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:23:45,402 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:23:45,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-18 09:23:45,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:45,619 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:23:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:23:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1628622841, now seen corresponding path program 22 times [2022-01-18 09:23:45,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:23:45,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605514368] [2022-01-18 09:23:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:23:45,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:23:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:23:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:23:45,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:23:45,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605514368] [2022-01-18 09:23:45,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605514368] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:23:45,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778113964] [2022-01-18 09:23:45,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:23:45,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:23:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:23:45,784 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-01-18 09:23:45,788 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-01-18 09:23:45,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:23:45,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:23:45,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:23:45,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:23:45,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:23:45,921 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:23:45,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:23:46,028 INFO L387 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-01-18 09:23:46,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:23:46,171 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:23:46,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:23:46,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:23:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:23:46,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:23:48,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (forall ((v_ArrVal_839 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:23:48,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_837) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:23:48,408 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:23:48,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:23:48,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:23:48,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:23:48,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:23:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-01-18 09:23:48,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778113964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:23:48,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:23:48,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:23:48,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719348428] [2022-01-18 09:23:48,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:23:48,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:23:48,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:23:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:23:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:23:48,584 INFO L87 Difference]: Start difference. First operand 12609 states and 35903 transitions. Second operand has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:23:49,127 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_837) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:51,217 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (forall ((v_ArrVal_839 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:53,252 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (forall ((v_ArrVal_839 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:23:53,888 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_837) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:56,138 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (forall ((v_ArrVal_839 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:23:56,729 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_837) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:23:59,283 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (forall ((v_ArrVal_839 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:00,431 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_95| Int) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_95|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_837) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_95| 4) c_~data~0.offset) v_ArrVal_839) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:00,863 INFO L93 Difference]: Finished difference Result 51450 states and 146935 transitions. [2022-01-18 09:24:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-01-18 09:24:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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 92 [2022-01-18 09:24:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:00,972 INFO L225 Difference]: With dead ends: 51450 [2022-01-18 09:24:00,972 INFO L226 Difference]: Without dead ends: 51192 [2022-01-18 09:24:00,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4818 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1678, Invalid=12632, Unknown=10, NotChecked=2450, Total=16770 [2022-01-18 09:24:00,975 INFO L933 BasicCegarLoop]: 763 mSDtfsCounter, 1901 mSDsluCounter, 10437 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 10593 SdHoareTripleChecker+Invalid, 7285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3806 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:00,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1901 Valid, 10593 Invalid, 7285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3420 Invalid, 0 Unknown, 3806 Unchecked, 1.1s Time] [2022-01-18 09:24:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51192 states. [2022-01-18 09:24:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51192 to 13637. [2022-01-18 09:24:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13637 states, 13635 states have (on average 2.8562522918958564) internal successors, (38945), 13636 states have internal predecessors, (38945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13637 states to 13637 states and 38945 transitions. [2022-01-18 09:24:01,476 INFO L78 Accepts]: Start accepts. Automaton has 13637 states and 38945 transitions. Word has length 92 [2022-01-18 09:24:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:01,477 INFO L470 AbstractCegarLoop]: Abstraction has 13637 states and 38945 transitions. [2022-01-18 09:24:01,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 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-01-18 09:24:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13637 states and 38945 transitions. [2022-01-18 09:24:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-18 09:24:01,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:01,490 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:01,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-18 09:24:01,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:01,691 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1879239159, now seen corresponding path program 23 times [2022-01-18 09:24:01,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:01,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440059624] [2022-01-18 09:24:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:01,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:24:01,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440059624] [2022-01-18 09:24:01,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440059624] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717154303] [2022-01-18 09:24:01,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:24:01,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:01,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:01,860 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-01-18 09:24:01,861 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-01-18 09:24:01,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:24:01,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:01,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:01,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:01,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:01,996 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:01,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:02,114 INFO L387 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-01-18 09:24:02,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:02,234 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:02,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:02,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 09:24:02,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:24:04,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (forall ((v_ArrVal_873 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)))) is different from false [2022-01-18 09:24:04,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:24:04,428 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:24:04,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:24:04,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:24:04,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:24:04,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:24:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 9 not checked. [2022-01-18 09:24:04,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717154303] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:24:04,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:24:04,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:24:04,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264088770] [2022-01-18 09:24:04,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:24:04,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:24:04,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:24:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:24:04,620 INFO L87 Difference]: Start difference. First operand 13637 states and 38945 transitions. Second operand has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:05,208 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:05,666 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:07,688 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (forall ((v_ArrVal_873 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:09,726 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (forall ((v_ArrVal_873 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:24:10,374 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:11,020 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:13,107 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (forall ((v_ArrVal_873 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:13,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:24:14,771 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:16,914 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (forall ((v_ArrVal_873 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:18,382 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_99| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_99|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_871) c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_99| 4) c_~data~0.offset) v_ArrVal_873) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:19,097 INFO L93 Difference]: Finished difference Result 57325 states and 163679 transitions. [2022-01-18 09:24:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-01-18 09:24:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 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-01-18 09:24:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:19,218 INFO L225 Difference]: With dead ends: 57325 [2022-01-18 09:24:19,218 INFO L226 Difference]: Without dead ends: 57079 [2022-01-18 09:24:19,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6456 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2033, Invalid=16366, Unknown=13, NotChecked=3640, Total=22052 [2022-01-18 09:24:19,221 INFO L933 BasicCegarLoop]: 796 mSDtfsCounter, 1847 mSDsluCounter, 14063 mSDsCounter, 0 mSdLazyCounter, 5384 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 13871 SdHoareTripleChecker+Invalid, 8722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 5384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3276 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:19,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1847 Valid, 13871 Invalid, 8722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 5384 Invalid, 0 Unknown, 3276 Unchecked, 1.7s Time] [2022-01-18 09:24:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57079 states. [2022-01-18 09:24:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57079 to 13126. [2022-01-18 09:24:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13126 states, 13124 states have (on average 2.8511124657116733) internal successors, (37418), 13125 states have internal predecessors, (37418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13126 states to 13126 states and 37418 transitions. [2022-01-18 09:24:19,727 INFO L78 Accepts]: Start accepts. Automaton has 13126 states and 37418 transitions. Word has length 92 [2022-01-18 09:24:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:19,727 INFO L470 AbstractCegarLoop]: Abstraction has 13126 states and 37418 transitions. [2022-01-18 09:24:19,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13126 states and 37418 transitions. [2022-01-18 09:24:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-18 09:24:19,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:19,739 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:19,755 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-01-18 09:24:19,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-18 09:24:19,940 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 620522807, now seen corresponding path program 24 times [2022-01-18 09:24:19,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544533267] [2022-01-18 09:24:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:19,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:24:20,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544533267] [2022-01-18 09:24:20,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544533267] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141980634] [2022-01-18 09:24:20,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:24:20,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:20,105 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-01-18 09:24:20,105 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-01-18 09:24:20,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 09:24:20,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:20,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:20,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:20,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:20,243 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:20,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:20,355 INFO L387 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-01-18 09:24:20,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:20,478 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:20,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:20,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:24:20,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:24:22,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (forall ((v_ArrVal_907 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)))) is different from false [2022-01-18 09:24:22,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (v_ArrVal_905 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_905) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:24:22,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:24:22,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-18 09:24:22,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-01-18 09:24:22,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:24:22,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-01-18 09:24:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2022-01-18 09:24:22,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141980634] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:24:22,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:24:22,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-01-18 09:24:22,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273414724] [2022-01-18 09:24:22,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:24:22,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:24:22,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:24:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=760, Unknown=2, NotChecked=114, Total=992 [2022-01-18 09:24:22,874 INFO L87 Difference]: Start difference. First operand 13126 states and 37418 transitions. Second operand has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:23,454 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((v_ArrVal_907 Int) (v_ArrVal_905 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_905) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:25,563 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (forall ((v_ArrVal_907 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:27,600 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (forall ((v_ArrVal_907 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:24:28,274 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((v_ArrVal_907 Int) (v_ArrVal_905 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_905) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:30,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (forall ((v_ArrVal_907 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:31,179 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((v_ArrVal_907 Int) (v_ArrVal_905 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_905) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:24:33,809 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (forall ((v_ArrVal_907 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:35,134 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (forall ((v_ArrVal_907 Int) (v_ArrVal_905 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_103| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_103|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_905) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_103|) c_~data~0.offset) v_ArrVal_907) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:24:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:35,718 INFO L93 Difference]: Finished difference Result 52291 states and 149297 transitions. [2022-01-18 09:24:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-01-18 09:24:35,718 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-01-18 09:24:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:35,839 INFO L225 Difference]: With dead ends: 52291 [2022-01-18 09:24:35,839 INFO L226 Difference]: Without dead ends: 51958 [2022-01-18 09:24:35,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4611 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1641, Invalid=12195, Unknown=10, NotChecked=2410, Total=16256 [2022-01-18 09:24:35,842 INFO L933 BasicCegarLoop]: 741 mSDtfsCounter, 1672 mSDsluCounter, 13330 mSDsCounter, 0 mSdLazyCounter, 4897 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 13298 SdHoareTripleChecker+Invalid, 6555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1600 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:35,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 13298 Invalid, 6555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4897 Invalid, 0 Unknown, 1600 Unchecked, 1.6s Time] [2022-01-18 09:24:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51958 states. [2022-01-18 09:24:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51958 to 13742. [2022-01-18 09:24:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13742 states, 13740 states have (on average 2.855967976710335) internal successors, (39241), 13741 states have internal predecessors, (39241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13742 states to 13742 states and 39241 transitions. [2022-01-18 09:24:36,361 INFO L78 Accepts]: Start accepts. Automaton has 13742 states and 39241 transitions. Word has length 93 [2022-01-18 09:24:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:36,361 INFO L470 AbstractCegarLoop]: Abstraction has 13742 states and 39241 transitions. [2022-01-18 09:24:36,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.09375) internal successors, (195), 32 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 13742 states and 39241 transitions. [2022-01-18 09:24:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-18 09:24:36,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:36,373 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:36,389 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-01-18 09:24:36,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-01-18 09:24:36,582 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1560145568, now seen corresponding path program 4 times [2022-01-18 09:24:36,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:36,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249851394] [2022-01-18 09:24:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:36,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:36,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:36,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249851394] [2022-01-18 09:24:36,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249851394] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:36,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383105221] [2022-01-18 09:24:36,733 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:24:36,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:36,734 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-01-18 09:24:36,734 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-01-18 09:24:36,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:24:36,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:36,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:36,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:36,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:36,863 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:36,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:37,032 INFO L387 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-01-18 09:24:37,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:37,061 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:37,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:37,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:37,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 09:24:37,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383105221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:24:37,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 09:24:37,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 23 [2022-01-18 09:24:37,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623962784] [2022-01-18 09:24:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:24:37,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 09:24:37,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 09:24:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-18 09:24:37,093 INFO L87 Difference]: Start difference. First operand 13742 states and 39241 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:38,381 INFO L93 Difference]: Finished difference Result 33342 states and 95423 transitions. [2022-01-18 09:24:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:24:38,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-01-18 09:24:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:38,449 INFO L225 Difference]: With dead ends: 33342 [2022-01-18 09:24:38,449 INFO L226 Difference]: Without dead ends: 33180 [2022-01-18 09:24:38,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-01-18 09:24:38,450 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 1821 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:38,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1821 Valid, 2936 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 09:24:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33180 states. [2022-01-18 09:24:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33180 to 14262. [2022-01-18 09:24:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14262 states, 14260 states have (on average 2.858415147265077) internal successors, (40761), 14261 states have internal predecessors, (40761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14262 states to 14262 states and 40761 transitions. [2022-01-18 09:24:38,816 INFO L78 Accepts]: Start accepts. Automaton has 14262 states and 40761 transitions. Word has length 94 [2022-01-18 09:24:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:38,816 INFO L470 AbstractCegarLoop]: Abstraction has 14262 states and 40761 transitions. [2022-01-18 09:24:38,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 14262 states and 40761 transitions. [2022-01-18 09:24:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-18 09:24:38,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:38,830 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:38,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-18 09:24:39,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-01-18 09:24:39,030 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash -639069948, now seen corresponding path program 25 times [2022-01-18 09:24:39,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:39,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850007225] [2022-01-18 09:24:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:39,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:39,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:39,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850007225] [2022-01-18 09:24:39,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850007225] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:39,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981214920] [2022-01-18 09:24:39,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 09:24:39,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:39,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:39,179 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-01-18 09:24:39,180 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-01-18 09:24:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:39,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:39,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:39,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:39,320 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:39,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:39,487 INFO L387 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-01-18 09:24:39,505 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:39,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:39,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:39,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:39,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 09:24:39,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981214920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:24:39,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 09:24:39,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 23 [2022-01-18 09:24:39,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256180616] [2022-01-18 09:24:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:24:39,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 09:24:39,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 09:24:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-18 09:24:39,549 INFO L87 Difference]: Start difference. First operand 14262 states and 40761 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:40,980 INFO L93 Difference]: Finished difference Result 37249 states and 106455 transitions. [2022-01-18 09:24:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 09:24:40,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-01-18 09:24:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:41,054 INFO L225 Difference]: With dead ends: 37249 [2022-01-18 09:24:41,055 INFO L226 Difference]: Without dead ends: 36925 [2022-01-18 09:24:41,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=917, Invalid=4339, Unknown=0, NotChecked=0, Total=5256 [2022-01-18 09:24:41,056 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 1235 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:41,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 3575 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 09:24:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36925 states. [2022-01-18 09:24:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36925 to 14058. [2022-01-18 09:24:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14058 states, 14056 states have (on average 2.8569294251565167) internal successors, (40157), 14057 states have internal predecessors, (40157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14058 states to 14058 states and 40157 transitions. [2022-01-18 09:24:41,443 INFO L78 Accepts]: Start accepts. Automaton has 14058 states and 40157 transitions. Word has length 94 [2022-01-18 09:24:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:41,443 INFO L470 AbstractCegarLoop]: Abstraction has 14058 states and 40157 transitions. [2022-01-18 09:24:41,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14058 states and 40157 transitions. [2022-01-18 09:24:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-18 09:24:41,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:41,455 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:41,471 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-01-18 09:24:41,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:41,656 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1426566334, now seen corresponding path program 26 times [2022-01-18 09:24:41,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:41,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254968311] [2022-01-18 09:24:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:41,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:41,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254968311] [2022-01-18 09:24:41,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254968311] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819458252] [2022-01-18 09:24:41,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:24:41,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:41,822 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-01-18 09:24:41,823 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-01-18 09:24:41,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 09:24:41,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:41,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:41,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:41,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:41,960 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:41,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:42,126 INFO L387 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-01-18 09:24:42,199 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:42,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:42,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:42,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:42,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 09:24:42,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819458252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:24:42,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 09:24:42,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 24 [2022-01-18 09:24:42,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672363102] [2022-01-18 09:24:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:24:42,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 09:24:42,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 09:24:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-01-18 09:24:42,239 INFO L87 Difference]: Start difference. First operand 14058 states and 40157 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:43,626 INFO L93 Difference]: Finished difference Result 37479 states and 107130 transitions. [2022-01-18 09:24:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-18 09:24:43,627 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-01-18 09:24:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:43,701 INFO L225 Difference]: With dead ends: 37479 [2022-01-18 09:24:43,701 INFO L226 Difference]: Without dead ends: 37425 [2022-01-18 09:24:43,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1137, Invalid=5025, Unknown=0, NotChecked=0, Total=6162 [2022-01-18 09:24:43,702 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 2050 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:43,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 3039 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 09:24:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37425 states. [2022-01-18 09:24:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37425 to 13904. [2022-01-18 09:24:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13904 states, 13902 states have (on average 2.8556322831247303) internal successors, (39699), 13903 states have internal predecessors, (39699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13904 states to 13904 states and 39699 transitions. [2022-01-18 09:24:44,084 INFO L78 Accepts]: Start accepts. Automaton has 13904 states and 39699 transitions. Word has length 94 [2022-01-18 09:24:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:44,085 INFO L470 AbstractCegarLoop]: Abstraction has 13904 states and 39699 transitions. [2022-01-18 09:24:44,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13904 states and 39699 transitions. [2022-01-18 09:24:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-18 09:24:44,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:44,097 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:44,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-18 09:24:44,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-18 09:24:44,298 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -583608190, now seen corresponding path program 27 times [2022-01-18 09:24:44,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976820206] [2022-01-18 09:24:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:44,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:44,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:44,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976820206] [2022-01-18 09:24:44,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976820206] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:44,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511449671] [2022-01-18 09:24:44,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:24:44,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:44,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:44,469 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-01-18 09:24:44,469 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-01-18 09:24:44,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 09:24:44,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:44,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:44,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:44,605 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:44,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:44,741 INFO L387 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-01-18 09:24:44,786 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:44,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:44,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:44,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:44,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 09:24:44,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511449671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:24:44,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 09:24:44,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 23 [2022-01-18 09:24:44,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903379994] [2022-01-18 09:24:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:24:44,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 09:24:44,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 09:24:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-18 09:24:44,824 INFO L87 Difference]: Start difference. First operand 13904 states and 39699 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:46,012 INFO L93 Difference]: Finished difference Result 34188 states and 97785 transitions. [2022-01-18 09:24:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-18 09:24:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-01-18 09:24:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:46,079 INFO L225 Difference]: With dead ends: 34188 [2022-01-18 09:24:46,079 INFO L226 Difference]: Without dead ends: 34026 [2022-01-18 09:24:46,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=910, Invalid=3920, Unknown=0, NotChecked=0, Total=4830 [2022-01-18 09:24:46,080 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 2135 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:46,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2135 Valid, 2554 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 09:24:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34026 states. [2022-01-18 09:24:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34026 to 13984. [2022-01-18 09:24:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13984 states, 13982 states have (on average 2.8557430982692034) internal successors, (39929), 13983 states have internal predecessors, (39929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13984 states to 13984 states and 39929 transitions. [2022-01-18 09:24:46,447 INFO L78 Accepts]: Start accepts. Automaton has 13984 states and 39929 transitions. Word has length 94 [2022-01-18 09:24:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:46,447 INFO L470 AbstractCegarLoop]: Abstraction has 13984 states and 39929 transitions. [2022-01-18 09:24:46,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13984 states and 39929 transitions. [2022-01-18 09:24:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-18 09:24:46,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:46,459 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:46,475 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-01-18 09:24:46,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-01-18 09:24:46,660 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:46,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash 501016470, now seen corresponding path program 5 times [2022-01-18 09:24:46,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776398946] [2022-01-18 09:24:46,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:46,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:46,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776398946] [2022-01-18 09:24:46,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776398946] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095354245] [2022-01-18 09:24:46,824 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:24:46,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:46,832 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-01-18 09:24:46,833 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-01-18 09:24:46,927 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:24:46,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:24:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 09:24:46,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:46,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:24:46,968 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:24:46,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:24:47,129 INFO L387 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-01-18 09:24:47,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:24:47,151 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:47,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:47,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:24:47,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 09:24:47,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095354245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:24:47,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 09:24:47,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 23 [2022-01-18 09:24:47,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439739952] [2022-01-18 09:24:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:24:47,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 09:24:47,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 09:24:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-18 09:24:47,181 INFO L87 Difference]: Start difference. First operand 13984 states and 39929 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:48,604 INFO L93 Difference]: Finished difference Result 34596 states and 98898 transitions. [2022-01-18 09:24:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 09:24:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-01-18 09:24:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:48,672 INFO L225 Difference]: With dead ends: 34596 [2022-01-18 09:24:48,672 INFO L226 Difference]: Without dead ends: 34458 [2022-01-18 09:24:48,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=896, Invalid=4360, Unknown=0, NotChecked=0, Total=5256 [2022-01-18 09:24:48,673 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1319 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:48,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 3452 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 09:24:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34458 states. [2022-01-18 09:24:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34458 to 13112. [2022-01-18 09:24:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13112 states, 13110 states have (on average 2.853775743707094) internal successors, (37413), 13111 states have internal predecessors, (37413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 37413 transitions. [2022-01-18 09:24:49,041 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 37413 transitions. Word has length 94 [2022-01-18 09:24:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:49,041 INFO L470 AbstractCegarLoop]: Abstraction has 13112 states and 37413 transitions. [2022-01-18 09:24:49,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 37413 transitions. [2022-01-18 09:24:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:24:49,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:49,055 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:49,071 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-01-18 09:24:49,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-01-18 09:24:49,255 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -45528521, now seen corresponding path program 1 times [2022-01-18 09:24:49,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:49,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16061300] [2022-01-18 09:24:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:49,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:49,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16061300] [2022-01-18 09:24:49,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16061300] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693217911] [2022-01-18 09:24:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:49,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:49,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:49,357 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-01-18 09:24:49,358 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-01-18 09:24:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:49,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 09:24:49,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:49,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:24:49,634 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:49,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:49,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:49,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:24:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:49,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693217911] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:24:49,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:24:49,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 26 [2022-01-18 09:24:49,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349726716] [2022-01-18 09:24:49,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:24:49,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 09:24:49,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:49,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 09:24:49,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-01-18 09:24:49,849 INFO L87 Difference]: Start difference. First operand 13112 states and 37413 transitions. Second operand has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 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-01-18 09:24:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:24:54,067 INFO L93 Difference]: Finished difference Result 93169 states and 263282 transitions. [2022-01-18 09:24:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-01-18 09:24:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 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 100 [2022-01-18 09:24:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:24:54,291 INFO L225 Difference]: With dead ends: 93169 [2022-01-18 09:24:54,291 INFO L226 Difference]: Without dead ends: 92077 [2022-01-18 09:24:54,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18289 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4544, Invalid=40188, Unknown=0, NotChecked=0, Total=44732 [2022-01-18 09:24:54,297 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 3171 mSDsluCounter, 6648 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3171 SdHoareTripleChecker+Valid, 6896 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:24:54,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3171 Valid, 6896 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-18 09:24:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92077 states. [2022-01-18 09:24:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92077 to 21230. [2022-01-18 09:24:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21230 states, 21228 states have (on average 2.8706425475786697) internal successors, (60938), 21229 states have internal predecessors, (60938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:24:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21230 states to 21230 states and 60938 transitions. [2022-01-18 09:24:55,356 INFO L78 Accepts]: Start accepts. Automaton has 21230 states and 60938 transitions. Word has length 100 [2022-01-18 09:24:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:24:55,357 INFO L470 AbstractCegarLoop]: Abstraction has 21230 states and 60938 transitions. [2022-01-18 09:24:55,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 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-01-18 09:24:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21230 states and 60938 transitions. [2022-01-18 09:24:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:24:55,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:24:55,377 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:24:55,393 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-01-18 09:24:55,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:55,578 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:24:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:24:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 712630067, now seen corresponding path program 1 times [2022-01-18 09:24:55,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:24:55,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606542709] [2022-01-18 09:24:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:55,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:24:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:55,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:24:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606542709] [2022-01-18 09:24:55,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606542709] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:24:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119080566] [2022-01-18 09:24:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:24:55,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:24:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:24:55,679 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-01-18 09:24:55,680 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-01-18 09:24:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:24:55,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 09:24:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:24:55,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:24:55,960 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:24:55,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:24:55,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:24:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:55,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:24:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:24:56,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119080566] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:24:56,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:24:56,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-18 09:24:56,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163255913] [2022-01-18 09:24:56,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:24:56,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 09:24:56,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:24:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 09:24:56,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2022-01-18 09:24:56,142 INFO L87 Difference]: Start difference. First operand 21230 states and 60938 transitions. Second operand has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:01,232 INFO L93 Difference]: Finished difference Result 105062 states and 292157 transitions. [2022-01-18 09:25:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2022-01-18 09:25:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 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 100 [2022-01-18 09:25:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:01,478 INFO L225 Difference]: With dead ends: 105062 [2022-01-18 09:25:01,478 INFO L226 Difference]: Without dead ends: 104054 [2022-01-18 09:25:01,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 352 SyntacticMatches, 3 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30637 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7571, Invalid=60811, Unknown=0, NotChecked=0, Total=68382 [2022-01-18 09:25:01,486 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 8290 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8290 SdHoareTripleChecker+Valid, 4938 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:01,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8290 Valid, 4938 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-18 09:25:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104054 states. [2022-01-18 09:25:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104054 to 31182. [2022-01-18 09:25:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31182 states, 31180 states have (on average 2.8685375240538806) internal successors, (89441), 31181 states have internal predecessors, (89441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31182 states to 31182 states and 89441 transitions. [2022-01-18 09:25:02,666 INFO L78 Accepts]: Start accepts. Automaton has 31182 states and 89441 transitions. Word has length 100 [2022-01-18 09:25:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:02,666 INFO L470 AbstractCegarLoop]: Abstraction has 31182 states and 89441 transitions. [2022-01-18 09:25:02,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31182 states and 89441 transitions. [2022-01-18 09:25:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:25:02,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:02,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:02,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-01-18 09:25:02,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:02,896 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash -402452987, now seen corresponding path program 1 times [2022-01-18 09:25:02,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:02,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947732851] [2022-01-18 09:25:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:02,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:02,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:02,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947732851] [2022-01-18 09:25:02,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947732851] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:02,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77796158] [2022-01-18 09:25:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:02,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:03,000 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-01-18 09:25:03,001 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-01-18 09:25:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:03,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 09:25:03,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:03,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:25:03,287 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:03,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:03,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:03,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:03,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77796158] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:03,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:03,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-01-18 09:25:03,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382555520] [2022-01-18 09:25:03,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:03,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 09:25:03,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 09:25:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-01-18 09:25:03,523 INFO L87 Difference]: Start difference. First operand 31182 states and 89441 transitions. Second operand has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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-01-18 09:25:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:08,521 INFO L93 Difference]: Finished difference Result 358580 states and 1022062 transitions. [2022-01-18 09:25:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-01-18 09:25:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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 100 [2022-01-18 09:25:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:10,547 INFO L225 Difference]: With dead ends: 358580 [2022-01-18 09:25:10,547 INFO L226 Difference]: Without dead ends: 358136 [2022-01-18 09:25:10,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15276 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4727, Invalid=30429, Unknown=0, NotChecked=0, Total=35156 [2022-01-18 09:25:10,548 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 8270 mSDsluCounter, 5017 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8270 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:10,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8270 Valid, 5100 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-18 09:25:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358136 states. [2022-01-18 09:25:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358136 to 37090. [2022-01-18 09:25:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37090 states, 37088 states have (on average 2.862893658326143) internal successors, (106179), 37089 states have internal predecessors, (106179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37090 states to 37090 states and 106179 transitions. [2022-01-18 09:25:14,295 INFO L78 Accepts]: Start accepts. Automaton has 37090 states and 106179 transitions. Word has length 100 [2022-01-18 09:25:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:14,296 INFO L470 AbstractCegarLoop]: Abstraction has 37090 states and 106179 transitions. [2022-01-18 09:25:14,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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-01-18 09:25:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37090 states and 106179 transitions. [2022-01-18 09:25:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:25:14,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:14,317 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:14,332 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-01-18 09:25:14,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:14,518 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1021486655, now seen corresponding path program 2 times [2022-01-18 09:25:14,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:14,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951987432] [2022-01-18 09:25:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:14,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:14,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951987432] [2022-01-18 09:25:14,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951987432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563068744] [2022-01-18 09:25:14,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:25:14,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:14,849 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-01-18 09:25:14,850 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-01-18 09:25:14,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 09:25:14,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:25:14,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-18 09:25:14,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:15,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:25:15,100 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:15,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:15,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-18 09:25:15,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-18 09:25:15,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563068744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:15,266 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:15,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 19 [2022-01-18 09:25:15,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523536359] [2022-01-18 09:25:15,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:15,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 09:25:15,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:15,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 09:25:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-01-18 09:25:15,267 INFO L87 Difference]: Start difference. First operand 37090 states and 106179 transitions. Second operand has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:18,163 INFO L93 Difference]: Finished difference Result 110056 states and 313321 transitions. [2022-01-18 09:25:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-01-18 09:25:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 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 100 [2022-01-18 09:25:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:18,552 INFO L225 Difference]: With dead ends: 110056 [2022-01-18 09:25:18,552 INFO L226 Difference]: Without dead ends: 109804 [2022-01-18 09:25:18,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7714 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2813, Invalid=16369, Unknown=0, NotChecked=0, Total=19182 [2022-01-18 09:25:18,553 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 3928 mSDsluCounter, 5405 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:18,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3928 Valid, 5468 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-18 09:25:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109804 states. [2022-01-18 09:25:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109804 to 36377. [2022-01-18 09:25:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36377 states, 36375 states have (on average 2.8661168384879727) internal successors, (104255), 36376 states have internal predecessors, (104255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 104255 transitions. [2022-01-18 09:25:19,794 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 104255 transitions. Word has length 100 [2022-01-18 09:25:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:19,795 INFO L470 AbstractCegarLoop]: Abstraction has 36377 states and 104255 transitions. [2022-01-18 09:25:19,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 104255 transitions. [2022-01-18 09:25:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:25:19,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:19,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:19,833 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-01-18 09:25:20,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-01-18 09:25:20,020 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 330410493, now seen corresponding path program 1 times [2022-01-18 09:25:20,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101333924] [2022-01-18 09:25:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:20,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:20,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:20,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101333924] [2022-01-18 09:25:20,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101333924] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309732557] [2022-01-18 09:25:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:20,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:20,113 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-01-18 09:25:20,113 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-01-18 09:25:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:20,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 09:25:20,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:20,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:25:20,368 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:20,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:20,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:20,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:20,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309732557] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:20,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:20,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-01-18 09:25:20,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541108032] [2022-01-18 09:25:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:20,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 09:25:20,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 09:25:20,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-01-18 09:25:20,552 INFO L87 Difference]: Start difference. First operand 36377 states and 104255 transitions. Second operand has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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-01-18 09:25:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:26,304 INFO L93 Difference]: Finished difference Result 354508 states and 1005391 transitions. [2022-01-18 09:25:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-01-18 09:25:26,304 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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 100 [2022-01-18 09:25:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:27,733 INFO L225 Difference]: With dead ends: 354508 [2022-01-18 09:25:27,733 INFO L226 Difference]: Without dead ends: 353794 [2022-01-18 09:25:27,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22016 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5198, Invalid=46104, Unknown=0, NotChecked=0, Total=51302 [2022-01-18 09:25:27,735 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 4004 mSDsluCounter, 6613 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 6870 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:27,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4004 Valid, 6870 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-18 09:25:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353794 states. [2022-01-18 09:25:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353794 to 41137. [2022-01-18 09:25:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41137 states, 41135 states have (on average 2.871204570317248) internal successors, (118107), 41136 states have internal predecessors, (118107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41137 states to 41137 states and 118107 transitions. [2022-01-18 09:25:31,378 INFO L78 Accepts]: Start accepts. Automaton has 41137 states and 118107 transitions. Word has length 100 [2022-01-18 09:25:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:31,378 INFO L470 AbstractCegarLoop]: Abstraction has 41137 states and 118107 transitions. [2022-01-18 09:25:31,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 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-01-18 09:25:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 41137 states and 118107 transitions. [2022-01-18 09:25:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:25:31,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:31,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:31,422 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-01-18 09:25:31,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-01-18 09:25:31,605 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -364469627, now seen corresponding path program 3 times [2022-01-18 09:25:31,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:31,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121915091] [2022-01-18 09:25:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:31,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:31,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121915091] [2022-01-18 09:25:31,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121915091] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207706261] [2022-01-18 09:25:31,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:25:31,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:31,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:31,916 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-01-18 09:25:31,918 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-01-18 09:25:32,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 09:25:32,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:25:32,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 09:25:32,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:32,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:25:32,184 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:32,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:32,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:32,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:25:32,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207706261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:32,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:32,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-18 09:25:32,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468043831] [2022-01-18 09:25:32,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:32,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 09:25:32,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:32,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 09:25:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2022-01-18 09:25:32,370 INFO L87 Difference]: Start difference. First operand 41137 states and 118107 transitions. Second operand has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:38,929 INFO L93 Difference]: Finished difference Result 285902 states and 811293 transitions. [2022-01-18 09:25:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 263 states. [2022-01-18 09:25:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 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 100 [2022-01-18 09:25:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:39,780 INFO L225 Difference]: With dead ends: 285902 [2022-01-18 09:25:39,780 INFO L226 Difference]: Without dead ends: 284894 [2022-01-18 09:25:39,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 400 SyntacticMatches, 3 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34070 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=8219, Invalid=67681, Unknown=0, NotChecked=0, Total=75900 [2022-01-18 09:25:39,783 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 7858 mSDsluCounter, 5952 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7858 SdHoareTripleChecker+Valid, 6059 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:39,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7858 Valid, 6059 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-18 09:25:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284894 states. [2022-01-18 09:25:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284894 to 50719. [2022-01-18 09:25:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50719 states, 50717 states have (on average 2.8762545103219828) internal successors, (145875), 50718 states have internal predecessors, (145875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50719 states to 50719 states and 145875 transitions. [2022-01-18 09:25:43,221 INFO L78 Accepts]: Start accepts. Automaton has 50719 states and 145875 transitions. Word has length 100 [2022-01-18 09:25:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:43,222 INFO L470 AbstractCegarLoop]: Abstraction has 50719 states and 145875 transitions. [2022-01-18 09:25:43,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50719 states and 145875 transitions. [2022-01-18 09:25:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 09:25:43,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:43,247 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:43,264 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-01-18 09:25:43,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:43,447 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -230608953, now seen corresponding path program 4 times [2022-01-18 09:25:43,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802140236] [2022-01-18 09:25:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:43,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:25:43,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802140236] [2022-01-18 09:25:43,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802140236] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677878849] [2022-01-18 09:25:43,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:25:43,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:43,623 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-01-18 09:25:43,623 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-01-18 09:25:43,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:25:43,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:25:43,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:25:43,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:43,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:25:43,762 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:25:43,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:25:43,903 INFO L387 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-01-18 09:25:43,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:25:43,988 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:43,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:43,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 09:25:44,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:44,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1377 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1377) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|))) is different from false [2022-01-18 09:25:44,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:25:44,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:25:44,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:25:44,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:25:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-01-18 09:25:44,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677878849] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:44,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:44,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-01-18 09:25:44,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700850219] [2022-01-18 09:25:44,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:44,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 09:25:44,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 09:25:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=812, Unknown=1, NotChecked=58, Total=992 [2022-01-18 09:25:44,389 INFO L87 Difference]: Start difference. First operand 50719 states and 145875 transitions. Second operand has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 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-01-18 09:25:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:46,693 INFO L93 Difference]: Finished difference Result 140260 states and 401416 transitions. [2022-01-18 09:25:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-18 09:25:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 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 100 [2022-01-18 09:25:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:47,317 INFO L225 Difference]: With dead ends: 140260 [2022-01-18 09:25:47,318 INFO L226 Difference]: Without dead ends: 140098 [2022-01-18 09:25:47,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 6 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1079, Invalid=6756, Unknown=1, NotChecked=174, Total=8010 [2022-01-18 09:25:47,318 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 2905 mSDsluCounter, 5549 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2905 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1040 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:47,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2905 Valid, 5512 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2117 Invalid, 0 Unknown, 1040 Unchecked, 0.7s Time] [2022-01-18 09:25:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140098 states. [2022-01-18 09:25:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140098 to 46846. [2022-01-18 09:25:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46846 states, 46844 states have (on average 2.868158141917855) internal successors, (134356), 46845 states have internal predecessors, (134356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46846 states to 46846 states and 134356 transitions. [2022-01-18 09:25:49,172 INFO L78 Accepts]: Start accepts. Automaton has 46846 states and 134356 transitions. Word has length 100 [2022-01-18 09:25:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:49,172 INFO L470 AbstractCegarLoop]: Abstraction has 46846 states and 134356 transitions. [2022-01-18 09:25:49,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 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-01-18 09:25:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 46846 states and 134356 transitions. [2022-01-18 09:25:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:25:49,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:49,199 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:49,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-18 09:25:49,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-01-18 09:25:49,400 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -263128987, now seen corresponding path program 2 times [2022-01-18 09:25:49,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:49,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065353082] [2022-01-18 09:25:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:49,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:25:49,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065353082] [2022-01-18 09:25:49,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065353082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144940553] [2022-01-18 09:25:49,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:25:49,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:49,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:49,551 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-01-18 09:25:49,551 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-01-18 09:25:49,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:25:49,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:25:49,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:25:49,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:49,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:25:49,695 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:25:49,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:25:49,839 INFO L387 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-01-18 09:25:49,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:25:49,928 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:49,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:49,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:25:49,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:50,054 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1423 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1423) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2022-01-18 09:25:50,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:25:50,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:25:50,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:25:50,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:25:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 09:25:50,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144940553] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:50,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:50,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 28 [2022-01-18 09:25:50,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152809726] [2022-01-18 09:25:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:50,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:25:50,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:25:50,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=621, Unknown=1, NotChecked=50, Total=756 [2022-01-18 09:25:50,211 INFO L87 Difference]: Start difference. First operand 46846 states and 134356 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:52,917 INFO L93 Difference]: Finished difference Result 121443 states and 347282 transitions. [2022-01-18 09:25:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 09:25:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-18 09:25:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:53,233 INFO L225 Difference]: With dead ends: 121443 [2022-01-18 09:25:53,233 INFO L226 Difference]: Without dead ends: 121053 [2022-01-18 09:25:53,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1249, Invalid=7310, Unknown=1, NotChecked=182, Total=8742 [2022-01-18 09:25:53,234 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 1825 mSDsluCounter, 6210 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 6382 SdHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:53,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1825 Valid, 6382 Invalid, 3590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2951 Invalid, 0 Unknown, 494 Unchecked, 1.2s Time] [2022-01-18 09:25:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121053 states. [2022-01-18 09:25:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121053 to 44818. [2022-01-18 09:25:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44818 states, 44816 states have (on average 2.877298286326312) internal successors, (128949), 44817 states have internal predecessors, (128949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44818 states to 44818 states and 128949 transitions. [2022-01-18 09:25:54,986 INFO L78 Accepts]: Start accepts. Automaton has 44818 states and 128949 transitions. Word has length 106 [2022-01-18 09:25:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:25:54,986 INFO L470 AbstractCegarLoop]: Abstraction has 44818 states and 128949 transitions. [2022-01-18 09:25:54,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44818 states and 128949 transitions. [2022-01-18 09:25:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:25:55,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:25:55,015 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:25:55,033 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-01-18 09:25:55,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-01-18 09:25:55,216 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:25:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:25:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -711221671, now seen corresponding path program 3 times [2022-01-18 09:25:55,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:25:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101488431] [2022-01-18 09:25:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:25:55,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:25:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:25:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:25:55,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:25:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101488431] [2022-01-18 09:25:55,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101488431] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:25:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104791247] [2022-01-18 09:25:55,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:25:55,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:25:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:25:55,361 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-01-18 09:25:55,361 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-01-18 09:25:55,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 09:25:55,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:25:55,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:25:55,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:25:55,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:25:55,496 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:25:55,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:25:55,682 INFO L387 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-01-18 09:25:55,708 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:25:55,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:25:55,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:25:55,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:25:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 09:25:55,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:25:55,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1471) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:25:55,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1469 Int)) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1469)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1471) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:25:55,787 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-01-18 09:25:55,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-01-18 09:25:55,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-18 09:25:55,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:25:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 3 not checked. [2022-01-18 09:25:55,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104791247] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:25:55,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:25:55,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 28 [2022-01-18 09:25:55,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505294571] [2022-01-18 09:25:55,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:25:55,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:25:55,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:25:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:25:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=572, Unknown=2, NotChecked=98, Total=756 [2022-01-18 09:25:55,996 INFO L87 Difference]: Start difference. First operand 44818 states and 128949 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:25:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:25:59,325 INFO L93 Difference]: Finished difference Result 131867 states and 376958 transitions. [2022-01-18 09:25:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-18 09:25:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-18 09:25:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:25:59,661 INFO L225 Difference]: With dead ends: 131867 [2022-01-18 09:25:59,661 INFO L226 Difference]: Without dead ends: 131477 [2022-01-18 09:25:59,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 198 SyntacticMatches, 12 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1693, Invalid=10523, Unknown=2, NotChecked=438, Total=12656 [2022-01-18 09:25:59,662 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 2643 mSDsluCounter, 6532 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 6714 SdHoareTripleChecker+Invalid, 4025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 930 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:25:59,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2643 Valid, 6714 Invalid, 4025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2908 Invalid, 0 Unknown, 930 Unchecked, 1.2s Time] [2022-01-18 09:25:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131477 states. [2022-01-18 09:26:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131477 to 52048. [2022-01-18 09:26:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52048 states, 52046 states have (on average 2.882238788763786) internal successors, (150009), 52047 states have internal predecessors, (150009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52048 states to 52048 states and 150009 transitions. [2022-01-18 09:26:01,601 INFO L78 Accepts]: Start accepts. Automaton has 52048 states and 150009 transitions. Word has length 106 [2022-01-18 09:26:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:01,601 INFO L470 AbstractCegarLoop]: Abstraction has 52048 states and 150009 transitions. [2022-01-18 09:26:01,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 52048 states and 150009 transitions. [2022-01-18 09:26:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:01,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:01,631 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:01,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-01-18 09:26:01,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:01,832 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1599099767, now seen corresponding path program 2 times [2022-01-18 09:26:01,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:01,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714880497] [2022-01-18 09:26:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:01,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:01,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:01,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714880497] [2022-01-18 09:26:01,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714880497] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:01,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19081897] [2022-01-18 09:26:01,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:26:01,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:02,000 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-01-18 09:26:02,001 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-01-18 09:26:02,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 09:26:02,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:02,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:26:02,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:02,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:02,139 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:02,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:02,323 INFO L387 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-01-18 09:26:02,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:02,370 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:02,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:02,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 09:26:02,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:02,443 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1515 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1515) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:26:02,448 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:26:02,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:26:02,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:26:02,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:26:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-01-18 09:26:02,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19081897] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:02,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:02,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 28 [2022-01-18 09:26:02,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135411341] [2022-01-18 09:26:02,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:02,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:26:02,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:26:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=619, Unknown=1, NotChecked=50, Total=756 [2022-01-18 09:26:02,661 INFO L87 Difference]: Start difference. First operand 52048 states and 150009 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:06,383 INFO L93 Difference]: Finished difference Result 160215 states and 458860 transitions. [2022-01-18 09:26:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-01-18 09:26:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-18 09:26:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:07,016 INFO L225 Difference]: With dead ends: 160215 [2022-01-18 09:26:07,016 INFO L226 Difference]: Without dead ends: 149105 [2022-01-18 09:26:07,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 9 DeprecatedPredicates, 6476 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2821, Invalid=15004, Unknown=1, NotChecked=264, Total=18090 [2022-01-18 09:26:07,017 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 3560 mSDsluCounter, 5273 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3560 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:07,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3560 Valid, 5382 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2332 Invalid, 0 Unknown, 585 Unchecked, 0.9s Time] [2022-01-18 09:26:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149105 states. [2022-01-18 09:26:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149105 to 57277. [2022-01-18 09:26:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57277 states, 57275 states have (on average 2.872090790048014) internal successors, (164499), 57276 states have internal predecessors, (164499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57277 states to 57277 states and 164499 transitions. [2022-01-18 09:26:09,086 INFO L78 Accepts]: Start accepts. Automaton has 57277 states and 164499 transitions. Word has length 106 [2022-01-18 09:26:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:09,087 INFO L470 AbstractCegarLoop]: Abstraction has 57277 states and 164499 transitions. [2022-01-18 09:26:09,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57277 states and 164499 transitions. [2022-01-18 09:26:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:09,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:09,124 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:09,141 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-01-18 09:26:09,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:09,325 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash 242350021, now seen corresponding path program 3 times [2022-01-18 09:26:09,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:09,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108845206] [2022-01-18 09:26:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:09,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:09,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:09,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108845206] [2022-01-18 09:26:09,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108845206] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:09,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274974547] [2022-01-18 09:26:09,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:26:09,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:09,494 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-01-18 09:26:09,495 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-01-18 09:26:09,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 09:26:09,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:09,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:26:09,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:09,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:09,650 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:09,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:09,848 INFO L387 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-01-18 09:26:09,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:09,896 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:09,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:09,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 09:26:09,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:09,968 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1561 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1561) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:26:09,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:26:09,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:26:09,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:26:09,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:26:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-01-18 09:26:10,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274974547] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:10,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:10,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 28 [2022-01-18 09:26:10,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995812633] [2022-01-18 09:26:10,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:10,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:26:10,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:26:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=619, Unknown=1, NotChecked=50, Total=756 [2022-01-18 09:26:10,230 INFO L87 Difference]: Start difference. First operand 57277 states and 164499 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:13,836 INFO L93 Difference]: Finished difference Result 127190 states and 363547 transitions. [2022-01-18 09:26:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-01-18 09:26:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-18 09:26:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:14,121 INFO L225 Difference]: With dead ends: 127190 [2022-01-18 09:26:14,121 INFO L226 Difference]: Without dead ends: 102786 [2022-01-18 09:26:14,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 201 SyntacticMatches, 13 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 7 DeprecatedPredicates, 4846 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2189, Invalid=11856, Unknown=1, NotChecked=234, Total=14280 [2022-01-18 09:26:14,123 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 2599 mSDsluCounter, 7578 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2599 SdHoareTripleChecker+Valid, 7600 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 706 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:14,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2599 Valid, 7600 Invalid, 4315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3409 Invalid, 0 Unknown, 706 Unchecked, 1.2s Time] [2022-01-18 09:26:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102786 states. [2022-01-18 09:26:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102786 to 49036. [2022-01-18 09:26:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49036 states, 49034 states have (on average 2.870885508014847) internal successors, (140771), 49035 states have internal predecessors, (140771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49036 states to 49036 states and 140771 transitions. [2022-01-18 09:26:15,741 INFO L78 Accepts]: Start accepts. Automaton has 49036 states and 140771 transitions. Word has length 106 [2022-01-18 09:26:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:15,741 INFO L470 AbstractCegarLoop]: Abstraction has 49036 states and 140771 transitions. [2022-01-18 09:26:15,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 49036 states and 140771 transitions. [2022-01-18 09:26:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:15,768 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:15,768 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:15,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-01-18 09:26:15,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:15,968 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -806920903, now seen corresponding path program 4 times [2022-01-18 09:26:15,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763923592] [2022-01-18 09:26:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:15,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:16,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:16,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763923592] [2022-01-18 09:26:16,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763923592] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21500337] [2022-01-18 09:26:16,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:26:16,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:16,126 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-01-18 09:26:16,127 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-01-18 09:26:16,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:26:16,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:16,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:26:16,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:16,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:16,278 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:16,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:16,481 INFO L387 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-01-18 09:26:16,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:16,525 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:16,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:16,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:16,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:16,596 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1607 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1607) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:26:16,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:26:16,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:26:16,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:26:16,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:26:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 09:26:16,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21500337] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:16,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:16,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 33 [2022-01-18 09:26:16,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163578044] [2022-01-18 09:26:16,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:16,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 09:26:16,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 09:26:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=870, Unknown=1, NotChecked=60, Total=1056 [2022-01-18 09:26:16,909 INFO L87 Difference]: Start difference. First operand 49036 states and 140771 transitions. Second operand has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:26:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:22,094 INFO L93 Difference]: Finished difference Result 285093 states and 818126 transitions. [2022-01-18 09:26:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-01-18 09:26:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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 106 [2022-01-18 09:26:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:23,269 INFO L225 Difference]: With dead ends: 285093 [2022-01-18 09:26:23,269 INFO L226 Difference]: Without dead ends: 284919 [2022-01-18 09:26:23,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 190 SyntacticMatches, 14 SemanticMatches, 173 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12199 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4361, Invalid=25744, Unknown=1, NotChecked=344, Total=30450 [2022-01-18 09:26:23,271 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 5191 mSDsluCounter, 6306 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5191 SdHoareTripleChecker+Valid, 6396 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:23,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5191 Valid, 6396 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2753 Invalid, 0 Unknown, 652 Unchecked, 1.3s Time] [2022-01-18 09:26:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284919 states. [2022-01-18 09:26:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284919 to 51056. [2022-01-18 09:26:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51056 states, 51054 states have (on average 2.8668468680220944) internal successors, (146364), 51055 states have internal predecessors, (146364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51056 states to 51056 states and 146364 transitions. [2022-01-18 09:26:26,478 INFO L78 Accepts]: Start accepts. Automaton has 51056 states and 146364 transitions. Word has length 106 [2022-01-18 09:26:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:26,479 INFO L470 AbstractCegarLoop]: Abstraction has 51056 states and 146364 transitions. [2022-01-18 09:26:26,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:26:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51056 states and 146364 transitions. [2022-01-18 09:26:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:26,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:26,507 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:26,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-01-18 09:26:26,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-01-18 09:26:26,726 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1288830877, now seen corresponding path program 4 times [2022-01-18 09:26:26,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:26,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873207095] [2022-01-18 09:26:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:26,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:26,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873207095] [2022-01-18 09:26:26,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873207095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003309589] [2022-01-18 09:26:26,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:26:26,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:26,888 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-01-18 09:26:26,888 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-01-18 09:26:26,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:26:26,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:26,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:26:27,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:27,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:27,047 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:27,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:27,248 INFO L387 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-01-18 09:26:27,273 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:27,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:27,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:27,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:27,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:27,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1655) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:26:27,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 Int)) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1654)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1655) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:26:27,351 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-01-18 09:26:27,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-01-18 09:26:27,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-18 09:26:27,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:26:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-01-18 09:26:27,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003309589] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:27,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:27,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 33 [2022-01-18 09:26:27,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592861793] [2022-01-18 09:26:27,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:27,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 09:26:27,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 09:26:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=813, Unknown=2, NotChecked=118, Total=1056 [2022-01-18 09:26:27,665 INFO L87 Difference]: Start difference. First operand 51056 states and 146364 transitions. Second operand has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:26:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:33,181 INFO L93 Difference]: Finished difference Result 294852 states and 844611 transitions. [2022-01-18 09:26:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-01-18 09:26:33,182 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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 106 [2022-01-18 09:26:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:34,065 INFO L225 Difference]: With dead ends: 294852 [2022-01-18 09:26:34,065 INFO L226 Difference]: Without dead ends: 293708 [2022-01-18 09:26:34,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 190 SyntacticMatches, 16 SemanticMatches, 186 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 13825 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4905, Invalid=29511, Unknown=2, NotChecked=738, Total=35156 [2022-01-18 09:26:34,067 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 3073 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3073 SdHoareTripleChecker+Valid, 7007 SdHoareTripleChecker+Invalid, 5941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2654 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:34,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3073 Valid, 7007 Invalid, 5941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3148 Invalid, 0 Unknown, 2654 Unchecked, 1.2s Time] [2022-01-18 09:26:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293708 states. [2022-01-18 09:26:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293708 to 51204. [2022-01-18 09:26:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51204 states, 51202 states have (on average 2.8657279012538575) internal successors, (146731), 51203 states have internal predecessors, (146731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51204 states to 51204 states and 146731 transitions. [2022-01-18 09:26:37,408 INFO L78 Accepts]: Start accepts. Automaton has 51204 states and 146731 transitions. Word has length 106 [2022-01-18 09:26:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:37,409 INFO L470 AbstractCegarLoop]: Abstraction has 51204 states and 146731 transitions. [2022-01-18 09:26:37,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:26:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 51204 states and 146731 transitions. [2022-01-18 09:26:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:37,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:37,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:37,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-01-18 09:26:37,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-01-18 09:26:37,637 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1647629333, now seen corresponding path program 5 times [2022-01-18 09:26:37,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:37,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483397355] [2022-01-18 09:26:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:37,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:37,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:37,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483397355] [2022-01-18 09:26:37,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483397355] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46737652] [2022-01-18 09:26:37,792 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:26:37,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:37,793 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:26:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-01-18 09:26:37,906 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:26:37,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:37,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:26:37,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:37,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:37,948 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:37,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:38,131 INFO L387 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-01-18 09:26:38,187 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:38,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:38,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:38,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:38,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:38,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1701) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:26:38,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1699 Int)) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1701) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:26:38,280 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-01-18 09:26:38,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-01-18 09:26:38,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-18 09:26:38,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:26:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 09:26:38,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46737652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:38,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:38,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 33 [2022-01-18 09:26:38,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402027825] [2022-01-18 09:26:38,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:38,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 09:26:38,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 09:26:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=813, Unknown=2, NotChecked=118, Total=1056 [2022-01-18 09:26:38,743 INFO L87 Difference]: Start difference. First operand 51204 states and 146731 transitions. Second operand has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 33 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:45,745 INFO L93 Difference]: Finished difference Result 394733 states and 1125055 transitions. [2022-01-18 09:26:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-01-18 09:26:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 33 states have internal predecessors, (212), 0 states have call successors, (0), 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 106 [2022-01-18 09:26:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:47,441 INFO L225 Difference]: With dead ends: 394733 [2022-01-18 09:26:47,442 INFO L226 Difference]: Without dead ends: 394391 [2022-01-18 09:26:47,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 201 SyntacticMatches, 13 SemanticMatches, 226 ConstructedPredicates, 2 IntricatePredicates, 5 DeprecatedPredicates, 23002 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7572, Invalid=43284, Unknown=2, NotChecked=898, Total=51756 [2022-01-18 09:26:47,445 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 8710 mSDsluCounter, 6124 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8710 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 926 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:47,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8710 Valid, 6113 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2578 Invalid, 0 Unknown, 926 Unchecked, 1.2s Time] [2022-01-18 09:26:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394391 states. [2022-01-18 09:26:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394391 to 50639. [2022-01-18 09:26:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50639 states, 50637 states have (on average 2.867172225842763) internal successors, (145185), 50638 states have internal predecessors, (145185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50639 states to 50639 states and 145185 transitions. [2022-01-18 09:26:51,527 INFO L78 Accepts]: Start accepts. Automaton has 50639 states and 145185 transitions. Word has length 106 [2022-01-18 09:26:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:51,527 INFO L470 AbstractCegarLoop]: Abstraction has 50639 states and 145185 transitions. [2022-01-18 09:26:51,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 33 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 50639 states and 145185 transitions. [2022-01-18 09:26:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:51,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:51,553 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:51,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-01-18 09:26:51,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-01-18 09:26:51,754 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -563004673, now seen corresponding path program 2 times [2022-01-18 09:26:51,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382758907] [2022-01-18 09:26:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:51,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:51,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:51,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382758907] [2022-01-18 09:26:51,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382758907] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:51,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729904470] [2022-01-18 09:26:51,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:26:51,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:51,903 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:26:51,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-01-18 09:26:52,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 09:26:52,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:52,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:26:52,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:52,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:52,065 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:52,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:52,250 INFO L387 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-01-18 09:26:52,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:52,294 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:52,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:52,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 09:26:52,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:52,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1745) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:26:52,374 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:26:52,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:26:52,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:26:52,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:26:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-01-18 09:26:52,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729904470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:52,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:52,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 28 [2022-01-18 09:26:52,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017625808] [2022-01-18 09:26:52,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:52,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 09:26:52,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 09:26:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=618, Unknown=1, NotChecked=50, Total=756 [2022-01-18 09:26:52,617 INFO L87 Difference]: Start difference. First operand 50639 states and 145185 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:26:55,861 INFO L93 Difference]: Finished difference Result 143668 states and 411181 transitions. [2022-01-18 09:26:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-01-18 09:26:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-18 09:26:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:26:56,242 INFO L225 Difference]: With dead ends: 143668 [2022-01-18 09:26:56,243 INFO L226 Difference]: Without dead ends: 143056 [2022-01-18 09:26:56,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 197 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 4523 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1777, Invalid=11566, Unknown=1, NotChecked=228, Total=13572 [2022-01-18 09:26:56,243 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 2777 mSDsluCounter, 5826 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 6006 SdHoareTripleChecker+Invalid, 3848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:26:56,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2777 Valid, 6006 Invalid, 3848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2645 Invalid, 0 Unknown, 1059 Unchecked, 0.9s Time] [2022-01-18 09:26:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143056 states. [2022-01-18 09:26:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143056 to 50689. [2022-01-18 09:26:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50689 states, 50687 states have (on average 2.867086235129323) internal successors, (145324), 50688 states have internal predecessors, (145324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50689 states to 50689 states and 145324 transitions. [2022-01-18 09:26:57,922 INFO L78 Accepts]: Start accepts. Automaton has 50689 states and 145324 transitions. Word has length 106 [2022-01-18 09:26:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:26:57,922 INFO L470 AbstractCegarLoop]: Abstraction has 50689 states and 145324 transitions. [2022-01-18 09:26:57,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 28 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:26:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 50689 states and 145324 transitions. [2022-01-18 09:26:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:26:57,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:26:57,947 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:26:57,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-01-18 09:26:58,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-01-18 09:26:58,163 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:26:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:26:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1707716469, now seen corresponding path program 3 times [2022-01-18 09:26:58,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:26:58,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846676158] [2022-01-18 09:26:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:26:58,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:26:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:26:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:58,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:26:58,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846676158] [2022-01-18 09:26:58,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846676158] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:26:58,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200319880] [2022-01-18 09:26:58,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:26:58,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:26:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:26:58,320 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:26:58,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-01-18 09:26:58,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 09:26:58,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:26:58,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:26:58,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:26:58,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:26:58,488 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:26:58,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:26:58,694 INFO L387 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-01-18 09:26:58,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:26:58,934 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:26:58,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:26:58,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:26:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:26:58,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:26:59,004 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_ArrVal_1791 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1791) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:26:59,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:26:59,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:26:59,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:26:59,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:26:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-01-18 09:26:59,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200319880] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:26:59,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:26:59,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 33 [2022-01-18 09:26:59,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722333450] [2022-01-18 09:26:59,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:26:59,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 09:26:59,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:26:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 09:26:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=870, Unknown=1, NotChecked=60, Total=1056 [2022-01-18 09:26:59,317 INFO L87 Difference]: Start difference. First operand 50689 states and 145324 transitions. Second operand has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:27:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:27:05,943 INFO L93 Difference]: Finished difference Result 379657 states and 1086529 transitions. [2022-01-18 09:27:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-01-18 09:27:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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 106 [2022-01-18 09:27:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:27:07,504 INFO L225 Difference]: With dead ends: 379657 [2022-01-18 09:27:07,505 INFO L226 Difference]: Without dead ends: 379399 [2022-01-18 09:27:07,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 204 SyntacticMatches, 16 SemanticMatches, 217 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 19541 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5854, Invalid=41455, Unknown=1, NotChecked=432, Total=47742 [2022-01-18 09:27:07,507 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 3731 mSDsluCounter, 7535 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3731 SdHoareTripleChecker+Valid, 7752 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:27:07,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3731 Valid, 7752 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 3636 Invalid, 0 Unknown, 621 Unchecked, 1.4s Time] [2022-01-18 09:27:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379399 states. [2022-01-18 09:27:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379399 to 52207. [2022-01-18 09:27:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52207 states, 52205 states have (on average 2.871353318647639) internal successors, (149899), 52206 states have internal predecessors, (149899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52207 states to 52207 states and 149899 transitions. [2022-01-18 09:27:11,598 INFO L78 Accepts]: Start accepts. Automaton has 52207 states and 149899 transitions. Word has length 106 [2022-01-18 09:27:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:27:11,598 INFO L470 AbstractCegarLoop]: Abstraction has 52207 states and 149899 transitions. [2022-01-18 09:27:11,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 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-01-18 09:27:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 52207 states and 149899 transitions. [2022-01-18 09:27:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:27:11,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:27:11,626 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:27:11,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-01-18 09:27:11,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:27:11,826 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:27:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:27:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 340552099, now seen corresponding path program 4 times [2022-01-18 09:27:11,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:27:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479746087] [2022-01-18 09:27:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:27:11,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:27:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:27:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:11,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:27:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479746087] [2022-01-18 09:27:11,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479746087] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:27:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110699833] [2022-01-18 09:27:11,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:27:11,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:27:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:27:11,981 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:27:11,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-01-18 09:27:12,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:27:12,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:27:12,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:27:12,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:27:12,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:27:12,141 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:27:12,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:27:12,338 INFO L387 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-01-18 09:27:12,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:27:12,404 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:27:12,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:27:12,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:27:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:12,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:27:12,476 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1837 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1837) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:27:12,486 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1837 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1837) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:27:12,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:27:12,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-18 09:27:12,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-01-18 09:27:12,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:27:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 09:27:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110699833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:27:12,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:27:12,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2022-01-18 09:27:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604066914] [2022-01-18 09:27:12,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:27:12,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-18 09:27:12,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:27:12,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-18 09:27:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=927, Unknown=2, NotChecked=126, Total=1190 [2022-01-18 09:27:12,729 INFO L87 Difference]: Start difference. First operand 52207 states and 149899 transitions. Second operand has 35 states, 35 states have (on average 6.114285714285714) internal successors, (214), 35 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:27:19,737 INFO L93 Difference]: Finished difference Result 345974 states and 989834 transitions. [2022-01-18 09:27:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-18 09:27:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.114285714285714) internal successors, (214), 35 states have internal predecessors, (214), 0 states have call successors, (0), 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 106 [2022-01-18 09:27:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:27:20,846 INFO L225 Difference]: With dead ends: 345974 [2022-01-18 09:27:20,846 INFO L226 Difference]: Without dead ends: 344390 [2022-01-18 09:27:20,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 197 SyntacticMatches, 17 SemanticMatches, 206 ConstructedPredicates, 2 IntricatePredicates, 10 DeprecatedPredicates, 17949 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5093, Invalid=37143, Unknown=2, NotChecked=818, Total=43056 [2022-01-18 09:27:20,848 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 3537 mSDsluCounter, 7711 mSDsCounter, 0 mSdLazyCounter, 3518 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3537 SdHoareTripleChecker+Valid, 7878 SdHoareTripleChecker+Invalid, 5106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1315 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:27:20,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3537 Valid, 7878 Invalid, 5106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3518 Invalid, 0 Unknown, 1315 Unchecked, 1.4s Time] [2022-01-18 09:27:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344390 states. [2022-01-18 09:27:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344390 to 63751. [2022-01-18 09:27:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63751 states, 63749 states have (on average 2.8710568008909942) internal successors, (183027), 63750 states have internal predecessors, (183027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63751 states to 63751 states and 183027 transitions. [2022-01-18 09:27:24,963 INFO L78 Accepts]: Start accepts. Automaton has 63751 states and 183027 transitions. Word has length 106 [2022-01-18 09:27:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:27:24,964 INFO L470 AbstractCegarLoop]: Abstraction has 63751 states and 183027 transitions. [2022-01-18 09:27:24,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.114285714285714) internal successors, (214), 35 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 63751 states and 183027 transitions. [2022-01-18 09:27:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-18 09:27:25,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:27:25,005 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:27:25,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-01-18 09:27:25,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-01-18 09:27:25,207 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:27:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:27:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1373714167, now seen corresponding path program 5 times [2022-01-18 09:27:25,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:27:25,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795215272] [2022-01-18 09:27:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:27:25,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:27:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:27:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:25,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:27:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795215272] [2022-01-18 09:27:25,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795215272] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:27:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787656923] [2022-01-18 09:27:25,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:27:25,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:27:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:27:25,398 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:27:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-01-18 09:27:25,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:27:25,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:27:25,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-18 09:27:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:27:25,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:27:25,556 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:27:25,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:27:25,722 INFO L387 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-01-18 09:27:25,748 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:27:25,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:27:25,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-18 09:27:25,897 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-01-18 09:27:25,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2022-01-18 09:27:25,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:27:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:25,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:27:26,010 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1885 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1885) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:27:26,039 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1885) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:27:26,052 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-18 09:27:26,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-01-18 09:27:26,055 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-18 09:27:26,055 INFO L387 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 54 treesize of output 30 [2022-01-18 09:27:26,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:27:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 09:27:26,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787656923] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:27:26,564 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:27:26,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2022-01-18 09:27:26,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678183190] [2022-01-18 09:27:26,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:27:26,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-18 09:27:26,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:27:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-18 09:27:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1050, Unknown=2, NotChecked=134, Total=1332 [2022-01-18 09:27:26,565 INFO L87 Difference]: Start difference. First operand 63751 states and 183027 transitions. Second operand has 37 states, 37 states have (on average 5.783783783783784) internal successors, (214), 37 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:27:31,312 INFO L93 Difference]: Finished difference Result 334702 states and 957525 transitions. [2022-01-18 09:27:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-01-18 09:27:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.783783783783784) internal successors, (214), 37 states have internal predecessors, (214), 0 states have call successors, (0), 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 106 [2022-01-18 09:27:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:27:32,762 INFO L225 Difference]: With dead ends: 334702 [2022-01-18 09:27:32,762 INFO L226 Difference]: Without dead ends: 334420 [2022-01-18 09:27:32,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 151 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 8198 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2997, Invalid=19659, Unknown=2, NotChecked=598, Total=23256 [2022-01-18 09:27:32,764 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 3049 mSDsluCounter, 7038 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 7105 SdHoareTripleChecker+Invalid, 5307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1981 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:27:32,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3049 Valid, 7105 Invalid, 5307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 3166 Invalid, 0 Unknown, 1981 Unchecked, 1.1s Time] [2022-01-18 09:27:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334420 states. [2022-01-18 09:27:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334420 to 63847. [2022-01-18 09:27:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63847 states, 63845 states have (on average 2.871062730049338) internal successors, (183303), 63846 states have internal predecessors, (183303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63847 states to 63847 states and 183303 transitions. [2022-01-18 09:27:36,732 INFO L78 Accepts]: Start accepts. Automaton has 63847 states and 183303 transitions. Word has length 106 [2022-01-18 09:27:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:27:36,732 INFO L470 AbstractCegarLoop]: Abstraction has 63847 states and 183303 transitions. [2022-01-18 09:27:36,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.783783783783784) internal successors, (214), 37 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 63847 states and 183303 transitions. [2022-01-18 09:27:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-18 09:27:36,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:27:36,770 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:27:36,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-01-18 09:27:36,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-01-18 09:27:36,971 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:27:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:27:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 322491842, now seen corresponding path program 5 times [2022-01-18 09:27:36,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:27:36,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626609376] [2022-01-18 09:27:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:27:36,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:27:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:27:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:37,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:27:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626609376] [2022-01-18 09:27:37,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626609376] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:27:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041852758] [2022-01-18 09:27:37,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:27:37,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:27:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:27:37,126 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:27:37,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-01-18 09:27:37,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:27:37,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:27:37,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 09:27:37,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:27:37,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:27:37,564 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:27:37,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:27:37,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 09:27:37,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:27:37,599 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:27:37,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:27:37,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:27:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:37,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:27:37,679 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1936 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1936) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:27:37,685 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_ArrVal_1934 Int) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1934)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1936) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:27:37,700 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-01-18 09:27:37,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-01-18 09:27:37,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-18 09:27:37,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:27:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-01-18 09:27:38,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041852758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:27:38,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:27:38,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 38 [2022-01-18 09:27:38,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656415011] [2022-01-18 09:27:38,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:27:38,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-18 09:27:38,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:27:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-18 09:27:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1125, Unknown=2, NotChecked=138, Total=1406 [2022-01-18 09:27:38,050 INFO L87 Difference]: Start difference. First operand 63847 states and 183303 transitions. Second operand has 38 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 38 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:27:46,393 INFO L93 Difference]: Finished difference Result 481027 states and 1382163 transitions. [2022-01-18 09:27:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-01-18 09:27:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 38 states have internal predecessors, (238), 0 states have call successors, (0), 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 107 [2022-01-18 09:27:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:27:48,024 INFO L225 Difference]: With dead ends: 481027 [2022-01-18 09:27:48,025 INFO L226 Difference]: Without dead ends: 480549 [2022-01-18 09:27:48,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 188 SyntacticMatches, 18 SemanticMatches, 197 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 14919 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5474, Invalid=33144, Unknown=2, NotChecked=782, Total=39402 [2022-01-18 09:27:48,026 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 4455 mSDsluCounter, 8621 mSDsCounter, 0 mSdLazyCounter, 4250 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 8795 SdHoareTripleChecker+Invalid, 5442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 4250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 990 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:27:48,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4455 Valid, 8795 Invalid, 5442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 4250 Invalid, 0 Unknown, 990 Unchecked, 1.8s Time] [2022-01-18 09:27:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480549 states. [2022-01-18 09:27:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480549 to 64047. [2022-01-18 09:27:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64047 states, 64045 states have (on average 2.868311343586541) internal successors, (183701), 64046 states have internal predecessors, (183701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64047 states to 64047 states and 183701 transitions. [2022-01-18 09:27:53,517 INFO L78 Accepts]: Start accepts. Automaton has 64047 states and 183701 transitions. Word has length 107 [2022-01-18 09:27:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:27:53,518 INFO L470 AbstractCegarLoop]: Abstraction has 64047 states and 183701 transitions. [2022-01-18 09:27:53,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 38 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64047 states and 183701 transitions. [2022-01-18 09:27:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-18 09:27:53,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:27:53,557 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:27:53,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-01-18 09:27:53,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-01-18 09:27:53,760 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:27:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:27:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -412800964, now seen corresponding path program 6 times [2022-01-18 09:27:53,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:27:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297575831] [2022-01-18 09:27:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:27:53,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:27:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:27:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:54,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:27:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297575831] [2022-01-18 09:27:54,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297575831] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:27:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826674868] [2022-01-18 09:27:54,003 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:27:54,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:27:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:27:54,004 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:27:54,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-01-18 09:27:54,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 09:27:54,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:27:54,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-18 09:27:54,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:27:54,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:27:54,183 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:27:54,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:27:54,274 INFO L387 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-01-18 09:27:54,296 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:27:54,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:27:54,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:27:54,355 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-18 09:27:54,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-18 09:27:54,381 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-18 09:27:54,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-01-18 09:27:54,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:27:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:27:54,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:27:56,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_1989 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1989) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)))) is different from false [2022-01-18 09:27:56,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |thrThread1of2ForFork0_~c~0#1| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:27:56,531 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:27:56,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:27:56,828 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-18 09:27:56,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-01-18 09:27:56,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2022-01-18 09:27:56,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 09:27:56,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:27:56,851 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-18 09:27:56,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 46 [2022-01-18 09:27:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2022-01-18 09:27:57,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826674868] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:27:57,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:27:57,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 13] total 27 [2022-01-18 09:27:57,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280022580] [2022-01-18 09:27:57,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:27:57,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:27:57,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:27:57,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:27:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=482, Unknown=3, NotChecked=138, Total=702 [2022-01-18 09:27:57,004 INFO L87 Difference]: Start difference. First operand 64047 states and 183701 transitions. Second operand has 27 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:27:57,710 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:00,124 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:02,187 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:04,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:04,839 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |thrThread1of2ForFork0_~c~0#1| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:05,390 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |thrThread1of2ForFork0_~c~0#1| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:07,779 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_1989 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1989) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:28:09,785 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_1989 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1989) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:28:12,304 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1988 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_183| Int) (|thrThread1of2ForFork0_~c~0#1| Int) (v_ArrVal_1989 Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_183| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1988) c_~data~0.base) (+ .cse1 c_~data~0.offset) v_ArrVal_1989) (+ .cse0 c_~data~0.offset)) 1)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:28:14,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_1989 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1989) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) is different from false [2022-01-18 09:28:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:28:16,028 INFO L93 Difference]: Finished difference Result 315328 states and 895723 transitions. [2022-01-18 09:28:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-18 09:28:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 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 107 [2022-01-18 09:28:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:28:17,032 INFO L225 Difference]: With dead ends: 315328 [2022-01-18 09:28:17,032 INFO L226 Difference]: Without dead ends: 314818 [2022-01-18 09:28:17,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1118, Invalid=7111, Unknown=13, NotChecked=2470, Total=10712 [2022-01-18 09:28:17,033 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1453 mSDsluCounter, 8098 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 8195 SdHoareTripleChecker+Invalid, 8014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4620 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:28:17,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1453 Valid, 8195 Invalid, 8014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3332 Invalid, 0 Unknown, 4620 Unchecked, 1.2s Time] [2022-01-18 09:28:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314818 states. [2022-01-18 09:28:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314818 to 110394. [2022-01-18 09:28:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110394 states, 110392 states have (on average 2.9199217334589465) internal successors, (322336), 110393 states have internal predecessors, (322336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110394 states to 110394 states and 322336 transitions. [2022-01-18 09:28:22,026 INFO L78 Accepts]: Start accepts. Automaton has 110394 states and 322336 transitions. Word has length 107 [2022-01-18 09:28:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:28:22,026 INFO L470 AbstractCegarLoop]: Abstraction has 110394 states and 322336 transitions. [2022-01-18 09:28:22,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 110394 states and 322336 transitions. [2022-01-18 09:28:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-18 09:28:22,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:28:22,093 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:28:22,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-01-18 09:28:22,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:28:22,294 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:28:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:28:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 498629504, now seen corresponding path program 7 times [2022-01-18 09:28:22,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:28:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386320868] [2022-01-18 09:28:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:28:22,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:28:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:28:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:28:22,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:28:22,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386320868] [2022-01-18 09:28:22,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386320868] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:28:22,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754528018] [2022-01-18 09:28:22,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 09:28:22,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:28:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:28:22,512 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:28:22,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-01-18 09:28:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:28:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-18 09:28:22,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:28:22,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:28:22,914 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:28:22,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:28:23,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 09:28:23,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-18 09:28:23,097 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-01-18 09:28:23,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2022-01-18 09:28:23,166 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-01-18 09:28:23,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2022-01-18 09:28:23,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:28:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:28:23,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:28:23,310 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2041 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2041) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:28:23,346 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2041 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2041) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:28:23,359 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-18 09:28:23,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-01-18 09:28:23,363 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-18 09:28:23,364 INFO L387 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 54 treesize of output 30 [2022-01-18 09:28:23,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:28:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-01-18 09:28:23,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754528018] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:28:23,625 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:28:23,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 41 [2022-01-18 09:28:23,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064644284] [2022-01-18 09:28:23,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:28:23,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-18 09:28:23,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:28:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-18 09:28:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1327, Unknown=2, NotChecked=150, Total=1640 [2022-01-18 09:28:23,626 INFO L87 Difference]: Start difference. First operand 110394 states and 322336 transitions. Second operand has 41 states, 41 states have (on average 5.926829268292683) internal successors, (243), 41 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:28:33,142 INFO L93 Difference]: Finished difference Result 613448 states and 1792271 transitions. [2022-01-18 09:28:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-01-18 09:28:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.926829268292683) internal successors, (243), 41 states have internal predecessors, (243), 0 states have call successors, (0), 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 107 [2022-01-18 09:28:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:28:35,965 INFO L225 Difference]: With dead ends: 613448 [2022-01-18 09:28:35,965 INFO L226 Difference]: Without dead ends: 613142 [2022-01-18 09:28:35,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 195 SyntacticMatches, 15 SemanticMatches, 192 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 13890 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4929, Invalid=31749, Unknown=2, NotChecked=762, Total=37442 [2022-01-18 09:28:35,966 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 4286 mSDsluCounter, 8255 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4286 SdHoareTripleChecker+Valid, 8465 SdHoareTripleChecker+Invalid, 6266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2427 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 09:28:35,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4286 Valid, 8465 Invalid, 6266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 3590 Invalid, 0 Unknown, 2427 Unchecked, 1.8s Time] [2022-01-18 09:28:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613142 states. [2022-01-18 09:28:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613142 to 120225. [2022-01-18 09:28:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120225 states, 120223 states have (on average 2.9204561523169446) internal successors, (351106), 120224 states have internal predecessors, (351106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120225 states to 120225 states and 351106 transitions. [2022-01-18 09:28:44,503 INFO L78 Accepts]: Start accepts. Automaton has 120225 states and 351106 transitions. Word has length 107 [2022-01-18 09:28:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:28:44,503 INFO L470 AbstractCegarLoop]: Abstraction has 120225 states and 351106 transitions. [2022-01-18 09:28:44,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.926829268292683) internal successors, (243), 41 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 120225 states and 351106 transitions. [2022-01-18 09:28:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-18 09:28:44,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:28:44,597 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:28:44,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-01-18 09:28:44,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:28:44,813 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:28:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:28:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash 775290472, now seen corresponding path program 8 times [2022-01-18 09:28:44,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:28:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931774666] [2022-01-18 09:28:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:28:44,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:28:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:28:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:28:44,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:28:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931774666] [2022-01-18 09:28:44,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931774666] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:28:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624494649] [2022-01-18 09:28:44,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 09:28:44,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:28:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:28:44,913 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:28:44,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-01-18 09:28:45,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 09:28:45,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:28:45,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 09:28:45,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:28:45,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:28:45,222 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:28:45,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:28:45,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:28:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:28:45,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:28:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 09:28:45,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624494649] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:28:45,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:28:45,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2022-01-18 09:28:45,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470777337] [2022-01-18 09:28:45,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:28:45,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 09:28:45,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:28:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 09:28:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-01-18 09:28:45,446 INFO L87 Difference]: Start difference. First operand 120225 states and 351106 transitions. Second operand has 27 states, 27 states have (on average 8.222222222222221) internal successors, (222), 27 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:28:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:28:53,819 INFO L93 Difference]: Finished difference Result 579113 states and 1672369 transitions. [2022-01-18 09:28:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-01-18 09:28:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.222222222222221) internal successors, (222), 27 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-01-18 09:28:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:28:55,949 INFO L225 Difference]: With dead ends: 579113 [2022-01-18 09:28:55,949 INFO L226 Difference]: Without dead ends: 577514 [2022-01-18 09:28:55,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27359 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6538, Invalid=57218, Unknown=0, NotChecked=0, Total=63756 [2022-01-18 09:28:55,952 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 4076 mSDsluCounter, 6724 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 6931 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:28:55,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4076 Valid, 6931 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-18 09:28:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577514 states. [2022-01-18 09:29:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577514 to 138982. [2022-01-18 09:29:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138982 states, 138980 states have (on average 2.9320549719384084) internal successors, (407497), 138981 states have internal predecessors, (407497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138982 states to 138982 states and 407497 transitions. [2022-01-18 09:29:04,294 INFO L78 Accepts]: Start accepts. Automaton has 138982 states and 407497 transitions. Word has length 112 [2022-01-18 09:29:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:29:04,294 INFO L470 AbstractCegarLoop]: Abstraction has 138982 states and 407497 transitions. [2022-01-18 09:29:04,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.222222222222221) internal successors, (222), 27 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 138982 states and 407497 transitions. [2022-01-18 09:29:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-18 09:29:04,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:29:04,415 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:29:04,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-01-18 09:29:04,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:29:04,616 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:29:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:29:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -385324116, now seen corresponding path program 9 times [2022-01-18 09:29:04,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:29:04,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862430173] [2022-01-18 09:29:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:29:04,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:29:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:29:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:04,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:29:04,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862430173] [2022-01-18 09:29:04,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862430173] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:29:04,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621872121] [2022-01-18 09:29:04,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 09:29:04,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:29:04,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:29:04,811 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:29:04,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-01-18 09:29:04,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 09:29:04,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:29:04,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:29:04,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:29:05,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:29:05,131 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:29:05,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:29:05,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 09:29:05,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:29:05,210 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-18 09:29:05,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-18 09:29:05,239 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-18 09:29:05,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-01-18 09:29:05,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:29:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:05,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:29:07,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)) (forall ((v_ArrVal_2143 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2143) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:29:07,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int)) (let ((.cse1 (* |c_thrThread2of2ForFork0_~c~0#1| 4)) (.cse0 (* |thrThread1of2ForFork0_~c~0#1| 4))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ .cse0 c_~data~0.offset) v_ArrVal_2143) (+ .cse1 c_~data~0.offset)) 1) (= .cse1 .cse0)))) is different from false [2022-01-18 09:29:07,440 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:29:07,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) is different from false [2022-01-18 09:29:07,463 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-18 09:29:07,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-01-18 09:29:07,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2022-01-18 09:29:07,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 09:29:07,470 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-18 09:29:07,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2022-01-18 09:29:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 14 not checked. [2022-01-18 09:29:07,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621872121] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:29:07,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:29:07,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 13] total 30 [2022-01-18 09:29:07,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22776398] [2022-01-18 09:29:07,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:29:07,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 09:29:07,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:29:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 09:29:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=625, Unknown=3, NotChecked=156, Total=870 [2022-01-18 09:29:07,611 INFO L87 Difference]: Start difference. First operand 138982 states and 407497 transitions. Second operand has 30 states, 30 states have (on average 8.766666666666667) internal successors, (263), 30 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:08,877 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1)) is different from false [2022-01-18 09:29:10,587 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:29:12,663 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:29:13,830 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-01-18 09:29:14,343 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int)) (let ((.cse1 (* |c_thrThread2of2ForFork0_~c~0#1| 4)) (.cse0 (* |thrThread1of2ForFork0_~c~0#1| 4))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ .cse0 c_~data~0.offset) v_ArrVal_2143) (+ .cse1 c_~data~0.offset)) 1) (= .cse1 .cse0)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:29:14,840 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int)) (let ((.cse1 (* |c_thrThread2of2ForFork0_~c~0#1| 4)) (.cse0 (* |thrThread1of2ForFork0_~c~0#1| 4))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ .cse0 c_~data~0.offset) v_ArrVal_2143) (+ .cse1 c_~data~0.offset)) 1) (= .cse1 .cse0)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:29:17,711 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)) (forall ((v_ArrVal_2143 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2143) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:29:19,716 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)) (forall ((v_ArrVal_2143 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2143) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:29:22,278 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 Int) (v_ArrVal_2142 (Array Int Int)) (|thrThread1of2ForFork0_~c~0#1| Int) (|v_thrThread1of2ForFork0_~c~0#1_201| Int)) (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_201| 4)) (.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (or (= .cse0 .cse1) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2142) c_~data~0.base) (+ c_~data~0.offset .cse1) v_ArrVal_2143) (+ .cse0 c_~data~0.offset)) 1)))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:29:24,371 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (= (* |c_thrThread2of2ForFork0_~c~0#1| 4) (* |thrThread1of2ForFork0_~c~0#1| 4)) (forall ((v_ArrVal_2143 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2143) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:29:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:29:26,786 INFO L93 Difference]: Finished difference Result 468370 states and 1356333 transitions. [2022-01-18 09:29:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-18 09:29:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.766666666666667) internal successors, (263), 30 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-01-18 09:29:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:29:28,955 INFO L225 Difference]: With dead ends: 468370 [2022-01-18 09:29:28,955 INFO L226 Difference]: Without dead ends: 468280 [2022-01-18 09:29:28,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1136, Invalid=7459, Unknown=13, NotChecked=2522, Total=11130 [2022-01-18 09:29:28,955 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1652 mSDsluCounter, 9100 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 9147 SdHoareTripleChecker+Invalid, 6688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2953 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 09:29:28,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1652 Valid, 9147 Invalid, 6688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3674 Invalid, 0 Unknown, 2953 Unchecked, 1.4s Time] [2022-01-18 09:29:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468280 states. [2022-01-18 09:29:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468280 to 175666. [2022-01-18 09:29:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175666 states, 175664 states have (on average 2.952893023043993) internal successors, (518717), 175665 states have internal predecessors, (518717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175666 states to 175666 states and 518717 transitions. [2022-01-18 09:29:36,706 INFO L78 Accepts]: Start accepts. Automaton has 175666 states and 518717 transitions. Word has length 116 [2022-01-18 09:29:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:29:36,706 INFO L470 AbstractCegarLoop]: Abstraction has 175666 states and 518717 transitions. [2022-01-18 09:29:36,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.766666666666667) internal successors, (263), 30 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 175666 states and 518717 transitions. [2022-01-18 09:29:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-18 09:29:36,845 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:29:36,845 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:29:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-01-18 09:29:37,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-01-18 09:29:37,046 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:29:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:29:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash -746759662, now seen corresponding path program 10 times [2022-01-18 09:29:37,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:29:37,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575137567] [2022-01-18 09:29:37,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:29:37,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:29:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:29:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:37,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:29:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575137567] [2022-01-18 09:29:37,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575137567] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:29:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16970190] [2022-01-18 09:29:37,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 09:29:37,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:29:37,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:29:37,244 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:29:37,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-01-18 09:29:37,376 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 09:29:37,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:29:37,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 09:29:37,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:29:37,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:29:37,420 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:29:37,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:29:37,598 INFO L387 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-01-18 09:29:37,626 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:29:37,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:29:37,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-18 09:29:37,794 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-01-18 09:29:37,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2022-01-18 09:29:37,851 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-01-18 09:29:37,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2022-01-18 09:29:37,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:29:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:37,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:29:38,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2196) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-01-18 09:29:38,027 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2196) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:29:38,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2196) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2022-01-18 09:29:38,076 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-18 09:29:38,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-01-18 09:29:38,079 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-18 09:29:38,080 INFO L387 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 54 treesize of output 30 [2022-01-18 09:29:38,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-18 09:29:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-01-18 09:29:38,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16970190] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:29:38,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:29:38,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 38 [2022-01-18 09:29:38,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523142881] [2022-01-18 09:29:38,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:29:38,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-18 09:29:38,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:29:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-18 09:29:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1046, Unknown=3, NotChecked=204, Total=1406 [2022-01-18 09:29:38,321 INFO L87 Difference]: Start difference. First operand 175666 states and 518717 transitions. Second operand has 38 states, 38 states have (on average 5.921052631578948) internal successors, (225), 38 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:29:43,434 INFO L93 Difference]: Finished difference Result 505555 states and 1487972 transitions. [2022-01-18 09:29:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 09:29:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.921052631578948) internal successors, (225), 38 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-01-18 09:29:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:29:45,754 INFO L225 Difference]: With dead ends: 505555 [2022-01-18 09:29:45,754 INFO L226 Difference]: Without dead ends: 505525 [2022-01-18 09:29:45,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 219 SyntacticMatches, 10 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1265, Invalid=8844, Unknown=3, NotChecked=600, Total=10712 [2022-01-18 09:29:45,755 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1976 mSDsluCounter, 5659 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 5897 SdHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2776 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 09:29:45,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1976 Valid, 5897 Invalid, 5043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2216 Invalid, 0 Unknown, 2776 Unchecked, 1.3s Time] [2022-01-18 09:29:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505525 states. [2022-01-18 09:29:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505525 to 175918. [2022-01-18 09:29:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175918 states, 175916 states have (on average 2.9527899679392435) internal successors, (519443), 175917 states have internal predecessors, (519443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175918 states to 175918 states and 519443 transitions. [2022-01-18 09:29:54,306 INFO L78 Accepts]: Start accepts. Automaton has 175918 states and 519443 transitions. Word has length 116 [2022-01-18 09:29:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:29:54,306 INFO L470 AbstractCegarLoop]: Abstraction has 175918 states and 519443 transitions. [2022-01-18 09:29:54,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.921052631578948) internal successors, (225), 38 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 175918 states and 519443 transitions. [2022-01-18 09:29:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 09:29:54,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:29:54,429 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:29:54,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-01-18 09:29:54,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-01-18 09:29:54,630 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:29:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:29:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -620754061, now seen corresponding path program 11 times [2022-01-18 09:29:54,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:29:54,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238912137] [2022-01-18 09:29:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:29:54,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:29:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:29:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:54,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:29:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238912137] [2022-01-18 09:29:54,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238912137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:29:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318739622] [2022-01-18 09:29:54,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 09:29:54,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:29:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:29:54,844 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:29:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-01-18 09:29:54,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 09:29:54,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:29:54,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-18 09:29:54,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:29:55,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 09:29:55,024 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 09:29:55,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 09:29:55,201 INFO L387 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-01-18 09:29:55,229 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:29:55,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:29:55,312 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:29:55,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:29:55,325 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:29:55,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:29:55,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:29:55,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:29:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 09:29:55,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:29:55,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:29:55,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-01-18 09:29:55,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_215| Int)) (or (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-01-18 09:29:55,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2252 Int) (|v_thrThread1of2ForFork0_~c~0#1_215| Int) (v_ArrVal_2249 Int) (v_ArrVal_2254 (Array Int Int))) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2249) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:29:55,565 INFO L353 Elim1Store]: treesize reduction 96, result has 39.6 percent of original size [2022-01-18 09:29:55,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 77 [2022-01-18 09:29:55,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 09:29:55,572 INFO L387 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 80 treesize of output 72 [2022-01-18 09:29:55,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 09:29:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 15 not checked. [2022-01-18 09:29:55,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318739622] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:29:55,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:29:55,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 37 [2022-01-18 09:29:55,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943166194] [2022-01-18 09:29:55,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:29:55,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-18 09:29:55,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:29:55,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-18 09:29:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=928, Unknown=4, NotChecked=260, Total=1332 [2022-01-18 09:29:55,828 INFO L87 Difference]: Start difference. First operand 175918 states and 519443 transitions. Second operand has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:29:58,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_215| Int)) (or (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:30:00,766 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_215| Int)) (or (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:30:03,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (.cse1 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_215| Int)) (or (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (< .cse0 |c_thrThread2of2ForFork0_~c~0#1|) (< .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse1)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:30:05,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_215| Int)) (or (forall ((v_ArrVal_2252 Int) (v_ArrVal_2254 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_215| 4) c_~data~0.offset) v_ArrVal_2252)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2254) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_215| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:30:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:30:14,814 INFO L93 Difference]: Finished difference Result 1146238 states and 3378181 transitions. [2022-01-18 09:30:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-01-18 09:30:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 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 117 [2022-01-18 09:30:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:30:21,608 INFO L225 Difference]: With dead ends: 1146238 [2022-01-18 09:30:21,608 INFO L226 Difference]: Without dead ends: 1146148 [2022-01-18 09:30:21,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 227 SyntacticMatches, 13 SemanticMatches, 188 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 13128 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=4313, Invalid=28653, Unknown=8, NotChecked=2936, Total=35910 [2022-01-18 09:30:21,610 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 3171 mSDsluCounter, 6497 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3171 SdHoareTripleChecker+Valid, 6695 SdHoareTripleChecker+Invalid, 5021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2038 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:30:21,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3171 Valid, 6695 Invalid, 5021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2791 Invalid, 0 Unknown, 2038 Unchecked, 1.2s Time] [2022-01-18 09:30:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146148 states. [2022-01-18 09:30:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146148 to 175909. [2022-01-18 09:30:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175909 states, 175907 states have (on average 2.9527932373356376) internal successors, (519417), 175908 states have internal predecessors, (519417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:30:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175909 states to 175909 states and 519417 transitions. [2022-01-18 09:30:39,317 INFO L78 Accepts]: Start accepts. Automaton has 175909 states and 519417 transitions. Word has length 117 [2022-01-18 09:30:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:30:39,317 INFO L470 AbstractCegarLoop]: Abstraction has 175909 states and 519417 transitions. [2022-01-18 09:30:39,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:30:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 175909 states and 519417 transitions. [2022-01-18 09:30:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 09:30:39,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:30:39,459 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 09:30:39,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-01-18 09:30:39,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-01-18 09:30:39,660 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 09:30:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:30:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 345029469, now seen corresponding path program 12 times [2022-01-18 09:30:39,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:30:39,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214673227] [2022-01-18 09:30:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:30:39,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:30:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:30:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 09:30:39,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:30:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214673227] [2022-01-18 09:30:39,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214673227] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 09:30:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142955048] [2022-01-18 09:30:39,874 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 09:30:39,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 09:30:39,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:30:39,876 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 09:30:39,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-01-18 09:30:40,014 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 09:30:40,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 09:30:40,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-18 09:30:40,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 09:30:40,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 09:30:40,285 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:30:40,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:30:40,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 09:30:40,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 09:30:40,384 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:30:40,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:30:40,397 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-18 09:30:40,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-18 09:30:40,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 09:30:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 09:30:40,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 09:30:42,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_222| Int)) (or (forall ((v_ArrVal_2306 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-01-18 09:30:42,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2303 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_222| Int) (v_ArrVal_2306 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2303) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-01-18 09:30:42,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 Int) (|v_thrThread1of2ForFork0_~c~0#1_222| Int) (v_ArrVal_2306 Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (= (select (store (select (store (store |c_#memory_int| c_~data~0.base (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2302)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2303) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-01-18 09:30:42,628 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-01-18 09:30:42,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2022-01-18 09:30:42,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-01-18 09:30:42,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2022-01-18 09:30:42,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-18 09:30:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2022-01-18 09:30:42,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142955048] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 09:30:42,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 09:30:42,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 39 [2022-01-18 09:30:42,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875148830] [2022-01-18 09:30:42,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 09:30:42,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 09:30:42,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:30:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 09:30:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1132, Unknown=3, NotChecked=210, Total=1482 [2022-01-18 09:30:42,943 INFO L87 Difference]: Start difference. First operand 175909 states and 519417 transitions. Second operand has 39 states, 39 states have (on average 6.82051282051282) internal successors, (266), 39 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:30:44,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_222| Int) (v_ArrVal_2306 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2303) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:30:45,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2303 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_222| Int) (v_ArrVal_2306 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2303) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-01-18 09:30:48,056 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_222| Int)) (or (forall ((v_ArrVal_2306 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2022-01-18 09:30:54,315 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 46 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 09:30:58,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (|v_thrThread1of2ForFork0_~c~0#1_222| Int) (v_ArrVal_2306 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2303) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_222| 4) c_~data~0.offset) v_ArrVal_2306) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_222| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) (< .cse0 |c_thrThread2of2ForFork0_~c~0#1|) (< .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (< (+ c_~data~0.base 1) |c_ULTIMATE.start_main_~#t~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t~0#1.base|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-01-18 09:30:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-18 09:30:58,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 2692 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1422, Invalid=8300, Unknown=8, NotChecked=1400, Total=11130 [2022-01-18 09:30:58,842 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 2273 mSDsluCounter, 5436 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2273 SdHoareTripleChecker+Valid, 5482 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1471 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 09:30:58,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2273 Valid, 5482 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2480 Invalid, 0 Unknown, 1471 Unchecked, 0.9s Time] [2022-01-18 09:30:58,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-01-18 09:30:59,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-01-18 09:30:59,056 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 09:30:59,058 INFO L158 Benchmark]: Toolchain (without parser) took 734735.36ms. Allocated memory was 421.5MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 366.8MB in the beginning and 12.7GB in the end (delta: -12.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2022-01-18 09:30:59,058 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 421.5MB. Free memory was 385.6MB in the beginning and 385.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:30:59,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.55ms. Allocated memory is still 421.5MB. Free memory was 366.6MB in the beginning and 376.8MB in the end (delta: -10.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.0GB. [2022-01-18 09:30:59,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.82ms. Allocated memory is still 421.5MB. Free memory was 376.8MB in the beginning and 373.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 09:30:59,058 INFO L158 Benchmark]: Boogie Preprocessor took 22.25ms. Allocated memory is still 421.5MB. Free memory was 373.7MB in the beginning and 372.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:30:59,058 INFO L158 Benchmark]: RCFGBuilder took 415.55ms. Allocated memory is still 421.5MB. Free memory was 372.6MB in the beginning and 358.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2022-01-18 09:30:59,059 INFO L158 Benchmark]: TraceAbstraction took 733809.54ms. Allocated memory was 421.5MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 356.9MB in the beginning and 12.7GB in the end (delta: -12.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2022-01-18 09:30:59,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 421.5MB. Free memory was 385.6MB in the beginning and 385.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 441.55ms. Allocated memory is still 421.5MB. Free memory was 366.6MB in the beginning and 376.8MB in the end (delta: -10.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.82ms. Allocated memory is still 421.5MB. Free memory was 376.8MB in the beginning and 373.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.25ms. Allocated memory is still 421.5MB. Free memory was 373.7MB in the beginning and 372.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 415.55ms. Allocated memory is still 421.5MB. Free memory was 372.6MB in the beginning and 358.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 733809.54ms. Allocated memory was 421.5MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 356.9MB in the beginning and 12.7GB in the end (delta: -12.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-18 09:30:59,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...