/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:22:01,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:22:01,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:22:01,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:22:01,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:22:01,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:22:01,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:22:02,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:22:02,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:22:02,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:22:02,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:22:02,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:22:02,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:22:02,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:22:02,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:22:02,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:22:02,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:22:02,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:22:02,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:22:02,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:22:02,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:22:02,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:22:02,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:22:02,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:22:02,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:22:02,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:22:02,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:22:02,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:22:02,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:22:02,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:22:02,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:22:02,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:22:02,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:22:02,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:22:02,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:22:02,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:22:02,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:22:02,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:22:02,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:22:02,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:22:02,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:22:02,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:22:02,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:22:02,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:22:02,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:22:02,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:22:02,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:22:02,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:22:02,061 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:22:02,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:22:02,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:22:02,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:22:02,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:22:02,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:22:02,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:22:02,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:22:02,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:22:02,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:22:02,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:22:02,065 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:22:02,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:22:02,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:22:02,065 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:22:02,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:22:02,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:22:02,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:22:02,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:22:02,293 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:22:02,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2022-03-15 19:22:02,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210274ff2/30de531adb2e4f8999627d1bbf7fa976/FLAG311fb8af5 [2022-03-15 19:22:02,705 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:22:02,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2022-03-15 19:22:02,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210274ff2/30de531adb2e4f8999627d1bbf7fa976/FLAG311fb8af5 [2022-03-15 19:22:03,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210274ff2/30de531adb2e4f8999627d1bbf7fa976 [2022-03-15 19:22:03,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:22:03,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:22:03,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:22:03,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:22:03,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:22:03,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf539ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03, skipping insertion in model container [2022-03-15 19:22:03,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:22:03,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:22:03,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-03-15 19:22:03,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:22:03,372 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:22:03,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-03-15 19:22:03,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:22:03,418 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:22:03,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03 WrapperNode [2022-03-15 19:22:03,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:22:03,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:22:03,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:22:03,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:22:03,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,485 INFO L137 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 303 [2022-03-15 19:22:03,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:22:03,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:22:03,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:22:03,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:22:03,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:22:03,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:22:03,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:22:03,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:22:03,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (1/1) ... [2022-03-15 19:22:03,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:22:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:03,546 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-03-15 19:22:03,550 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-03-15 19:22:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:22:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:22:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:22:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:22:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:22:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:22:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:22:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:22:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:22:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:22:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:22:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:22:03,597 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:22:03,683 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:22:03,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:22:04,067 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:22:04,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:22:04,193 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 19:22:04,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:22:04 BoogieIcfgContainer [2022-03-15 19:22:04,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:22:04,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:22:04,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:22:04,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:22:04,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:22:03" (1/3) ... [2022-03-15 19:22:04,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b5cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:22:04, skipping insertion in model container [2022-03-15 19:22:04,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:22:03" (2/3) ... [2022-03-15 19:22:04,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b5cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:22:04, skipping insertion in model container [2022-03-15 19:22:04,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:22:04" (3/3) ... [2022-03-15 19:22:04,207 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2022-03-15 19:22:04,211 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:22:04,211 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:22:04,211 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:22:04,211 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:22:04,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,275 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,279 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,280 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,281 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,282 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,287 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,287 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,288 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,288 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,288 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,288 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,289 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,289 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,290 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,290 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,293 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,298 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,299 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,300 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,300 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,300 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,301 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,301 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,305 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,305 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,305 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,305 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,305 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:22:04,319 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:22:04,347 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:22:04,351 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:22:04,351 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:22:04,360 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:22:04,366 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 229 transitions, 490 flow [2022-03-15 19:22:04,368 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 229 transitions, 490 flow [2022-03-15 19:22:04,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 224 places, 229 transitions, 490 flow [2022-03-15 19:22:04,441 INFO L129 PetriNetUnfolder]: 18/225 cut-off events. [2022-03-15 19:22:04,441 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:22:04,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 225 events. 18/225 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-03-15 19:22:04,448 INFO L116 LiptonReduction]: Number of co-enabled transitions 1824 [2022-03-15 19:22:11,649 INFO L131 LiptonReduction]: Checked pairs total: 3198 [2022-03-15 19:22:11,650 INFO L133 LiptonReduction]: Total number of compositions: 224 [2022-03-15 19:22:11,657 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 40 transitions, 112 flow [2022-03-15 19:22:11,728 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:22:11,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:11,754 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] [2022-03-15 19:22:11,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1530872799, now seen corresponding path program 1 times [2022-03-15 19:22:11,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:11,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665206028] [2022-03-15 19:22:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:12,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:12,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665206028] [2022-03-15 19:22:12,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665206028] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:12,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:12,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:22:12,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278757540] [2022-03-15 19:22:12,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:12,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:12,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 324 states and 947 transitions. [2022-03-15 19:22:12,266 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:14,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:22:14,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:22:14,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:22:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:22:14,705 INFO L87 Difference]: Start difference. First operand has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 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 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:14,767 INFO L93 Difference]: Finished difference Result 777 states and 3199 transitions. [2022-03-15 19:22:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:22:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-03-15 19:22:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:14,794 INFO L225 Difference]: With dead ends: 777 [2022-03-15 19:22:14,794 INFO L226 Difference]: Without dead ends: 748 [2022-03-15 19:22:14,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:22:14,797 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:14,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:22:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-03-15 19:22:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2022-03-15 19:22:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 4.127175368139223) internal successors, (3083), 747 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 3083 transitions. [2022-03-15 19:22:14,848 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 3083 transitions. Word has length 27 [2022-03-15 19:22:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:14,848 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 3083 transitions. [2022-03-15 19:22:14,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 3083 transitions. [2022-03-15 19:22:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:22:14,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:14,851 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] [2022-03-15 19:22:14,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:22:14,851 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:14,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1468633367, now seen corresponding path program 1 times [2022-03-15 19:22:14,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:14,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372337941] [2022-03-15 19:22:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:14,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:14,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372337941] [2022-03-15 19:22:14,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372337941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:14,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:14,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:22:14,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934116328] [2022-03-15 19:22:14,944 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:14,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:15,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 484 states and 1485 transitions. [2022-03-15 19:22:15,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:19,495 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3558#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:22:19,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:19,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:19,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:19,497 INFO L87 Difference]: Start difference. First operand 748 states and 3083 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:19,564 INFO L93 Difference]: Finished difference Result 1102 states and 4351 transitions. [2022-03-15 19:22:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:22:19,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 29 [2022-03-15 19:22:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:19,570 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 19:22:19,570 INFO L226 Difference]: Without dead ends: 1072 [2022-03-15 19:22:19,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:19,572 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:19,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:22:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-03-15 19:22:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 978. [2022-03-15 19:22:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 4.048106448311157) internal successors, (3955), 977 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3955 transitions. [2022-03-15 19:22:19,607 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3955 transitions. Word has length 29 [2022-03-15 19:22:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:19,607 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 3955 transitions. [2022-03-15 19:22:19,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3955 transitions. [2022-03-15 19:22:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:22:19,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:19,610 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] [2022-03-15 19:22:19,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:22:19,611 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash -970636886, now seen corresponding path program 1 times [2022-03-15 19:22:19,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:19,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891041188] [2022-03-15 19:22:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:19,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:19,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891041188] [2022-03-15 19:22:19,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891041188] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:19,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:19,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:22:19,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043946925] [2022-03-15 19:22:19,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:19,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:19,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 489 states and 1507 transitions. [2022-03-15 19:22:19,832 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:25,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6620#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0))] [2022-03-15 19:22:25,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:25,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:25,236 INFO L87 Difference]: Start difference. First operand 978 states and 3955 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:25,344 INFO L93 Difference]: Finished difference Result 1328 states and 5114 transitions. [2022-03-15 19:22:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:22:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 29 [2022-03-15 19:22:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:25,351 INFO L225 Difference]: With dead ends: 1328 [2022-03-15 19:22:25,351 INFO L226 Difference]: Without dead ends: 1270 [2022-03-15 19:22:25,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:25,353 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:25,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-03-15 19:22:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1148. [2022-03-15 19:22:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 3.96512641673932) internal successors, (4548), 1147 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 4548 transitions. [2022-03-15 19:22:25,411 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 4548 transitions. Word has length 29 [2022-03-15 19:22:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:25,411 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 4548 transitions. [2022-03-15 19:22:25,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 4548 transitions. [2022-03-15 19:22:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:22:25,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:25,417 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] [2022-03-15 19:22:25,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:22:25,417 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1107011950, now seen corresponding path program 1 times [2022-03-15 19:22:25,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:25,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136316184] [2022-03-15 19:22:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:25,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:25,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:25,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136316184] [2022-03-15 19:22:25,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136316184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:25,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:25,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:22:25,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657391369] [2022-03-15 19:22:25,539 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:25,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:25,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 372 states and 1091 transitions. [2022-03-15 19:22:25,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:28,575 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:22:28,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:28,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:28,576 INFO L87 Difference]: Start difference. First operand 1148 states and 4548 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:28,651 INFO L93 Difference]: Finished difference Result 1683 states and 6377 transitions. [2022-03-15 19:22:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:22:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 30 [2022-03-15 19:22:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:28,659 INFO L225 Difference]: With dead ends: 1683 [2022-03-15 19:22:28,659 INFO L226 Difference]: Without dead ends: 1631 [2022-03-15 19:22:28,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:28,660 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:28,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 18 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-03-15 19:22:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1387. [2022-03-15 19:22:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1386 states have (on average 3.94011544011544) internal successors, (5461), 1386 states have internal predecessors, (5461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 5461 transitions. [2022-03-15 19:22:28,690 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 5461 transitions. Word has length 30 [2022-03-15 19:22:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:28,690 INFO L470 AbstractCegarLoop]: Abstraction has 1387 states and 5461 transitions. [2022-03-15 19:22:28,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 5461 transitions. [2022-03-15 19:22:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:22:28,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:28,694 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] [2022-03-15 19:22:28,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:22:28,694 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 787372768, now seen corresponding path program 1 times [2022-03-15 19:22:28,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:28,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724999025] [2022-03-15 19:22:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:28,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:28,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724999025] [2022-03-15 19:22:28,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724999025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:28,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:28,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:22:28,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067692679] [2022-03-15 19:22:28,751 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:28,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:28,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 364 states and 1036 transitions. [2022-03-15 19:22:28,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:31,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:22:31,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:31,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:31,613 INFO L87 Difference]: Start difference. First operand 1387 states and 5461 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:31,710 INFO L93 Difference]: Finished difference Result 2061 states and 7729 transitions. [2022-03-15 19:22:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:22:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 30 [2022-03-15 19:22:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:31,718 INFO L225 Difference]: With dead ends: 2061 [2022-03-15 19:22:31,719 INFO L226 Difference]: Without dead ends: 1886 [2022-03-15 19:22:31,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:22:31,719 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:31,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 18 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-03-15 19:22:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1698. [2022-03-15 19:22:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 3.9133765468473776) internal successors, (6641), 1697 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 6641 transitions. [2022-03-15 19:22:31,753 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 6641 transitions. Word has length 30 [2022-03-15 19:22:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:31,753 INFO L470 AbstractCegarLoop]: Abstraction has 1698 states and 6641 transitions. [2022-03-15 19:22:31,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 6641 transitions. [2022-03-15 19:22:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:22:31,757 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:31,757 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] [2022-03-15 19:22:31,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:22:31,758 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1253380278, now seen corresponding path program 1 times [2022-03-15 19:22:31,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:31,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970833001] [2022-03-15 19:22:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:31,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:31,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970833001] [2022-03-15 19:22:31,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970833001] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:31,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672748650] [2022-03-15 19:22:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:31,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:31,877 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-03-15 19:22:31,879 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-03-15 19:22:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:31,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:22:31,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:32,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:22:32,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672748650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:32,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:22:32,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-03-15 19:22:32,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575347807] [2022-03-15 19:22:32,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:32,127 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:32,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 365 states and 1037 transitions. [2022-03-15 19:22:32,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:35,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [20275#(or (not (< ~j~0 ~N~0)) (< (+ ~j~0 1) ~N~0)), 20282#(or (<= ~N~0 ~j~0) (< ~i~0 ~N~0) (< (+ ~j~0 1) ~N~0)), 20280#(and (or (<= ~N~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (<= ~N~0 ~j~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))))), 20270#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 20285#(and (or (<= ~N~0 0) (< ~i~0 ~N~0)) (or (<= ~N~0 ~j~0) (< ~i~0 ~N~0))), 20273#(or (< ~i~0 ~N~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 20286#(and (or (<= ~N~0 0) (< ~i~0 ~N~0)) (or (<= 0 ~j~0) (< ~i~0 ~N~0))), 20272#(or (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 20277#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< (+ ~j~0 1) ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 20279#(and (or (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (<= ~N~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))))), 20269#(not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 20278#(or (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 20284#(and (or (<= ~N~0 0) (< ~i~0 ~N~0)) (or (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0))), 20276#(and (<= ~N~0 0) (<= ~N~0 ~j~0)), 20271#(< ~i~0 ~N~0), 20281#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< ~i~0 ~N~0) (< (+ ~j~0 1) ~N~0)), 20274#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< (+ ~j~0 1) ~N~0)), 20283#(and (or (<= ~N~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (<= 0 ~j~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))))] [2022-03-15 19:22:35,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:22:35,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:22:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:22:35,767 INFO L87 Difference]: Start difference. First operand 1698 states and 6641 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:36,643 INFO L93 Difference]: Finished difference Result 1658 states and 6311 transitions. [2022-03-15 19:22:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:22:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:22:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:36,659 INFO L225 Difference]: With dead ends: 1658 [2022-03-15 19:22:36,659 INFO L226 Difference]: Without dead ends: 1353 [2022-03-15 19:22:36,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:22:36,660 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 244 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:36,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 2 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:22:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-03-15 19:22:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1337. [2022-03-15 19:22:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1336 states have (on average 3.9176646706586826) internal successors, (5234), 1336 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 5234 transitions. [2022-03-15 19:22:36,703 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 5234 transitions. Word has length 31 [2022-03-15 19:22:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:36,703 INFO L470 AbstractCegarLoop]: Abstraction has 1337 states and 5234 transitions. [2022-03-15 19:22:36,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 5234 transitions. [2022-03-15 19:22:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:22:36,707 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:36,707 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] [2022-03-15 19:22:36,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:22:36,924 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,SelfDestructingSolverStorable5 [2022-03-15 19:22:36,924 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1490067650, now seen corresponding path program 1 times [2022-03-15 19:22:36,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:36,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028345502] [2022-03-15 19:22:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:37,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:37,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028345502] [2022-03-15 19:22:37,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028345502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:37,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456683041] [2022-03-15 19:22:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:37,079 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-03-15 19:22:37,089 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-03-15 19:22:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:37,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:22:37,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:37,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:37,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456683041] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:37,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:22:37,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 13 [2022-03-15 19:22:37,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399097592] [2022-03-15 19:22:37,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:37,480 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:37,604 INFO L252 McrAutomatonBuilder]: Finished intersection with 373 states and 1092 transitions. [2022-03-15 19:22:37,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:46,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [24846#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 24854#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24857#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 24842#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0)), 24839#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0)), 24852#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24853#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24858#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24861#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24836#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256))), 24848#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24851#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24850#(or (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24838#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 24843#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 24865#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24841#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~j~0 ~N~0)), 24845#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 24864#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24847#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 24849#(or (< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24862#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24855#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24840#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 24844#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0)), 24837#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 24859#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24866#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24860#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24835#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 24863#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 24856#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)))] [2022-03-15 19:22:46,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:22:46,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:22:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:22:46,247 INFO L87 Difference]: Start difference. First operand 1337 states and 5234 transitions. Second operand has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 38 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:47,399 INFO L93 Difference]: Finished difference Result 2355 states and 8428 transitions. [2022-03-15 19:22:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:22:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 38 states have internal predecessors, (290), 0 states have call successors, (0), 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 31 [2022-03-15 19:22:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:47,410 INFO L225 Difference]: With dead ends: 2355 [2022-03-15 19:22:47,410 INFO L226 Difference]: Without dead ends: 2079 [2022-03-15 19:22:47,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 346 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=565, Invalid=2857, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:22:47,411 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 700 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:47,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 2 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:22:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2022-03-15 19:22:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1333. [2022-03-15 19:22:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 3.9204204204204203) internal successors, (5222), 1332 states have internal predecessors, (5222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 5222 transitions. [2022-03-15 19:22:47,463 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 5222 transitions. Word has length 31 [2022-03-15 19:22:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:47,463 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 5222 transitions. [2022-03-15 19:22:47,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 38 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 5222 transitions. [2022-03-15 19:22:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:22:47,467 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:47,467 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] [2022-03-15 19:22:47,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:22:47,683 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,SelfDestructingSolverStorable6 [2022-03-15 19:22:47,684 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 999116396, now seen corresponding path program 2 times [2022-03-15 19:22:47,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:47,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374707717] [2022-03-15 19:22:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:47,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:47,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374707717] [2022-03-15 19:22:47,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374707717] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:47,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134811711] [2022-03-15 19:22:47,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:22:47,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:47,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:47,813 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-03-15 19:22:47,830 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-03-15 19:22:47,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:22:47,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:47,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:22:47,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:48,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:48,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134811711] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:48,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:22:48,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2022-03-15 19:22:48,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778563281] [2022-03-15 19:22:48,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:48,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:48,307 INFO L252 McrAutomatonBuilder]: Finished intersection with 379 states and 1104 transitions. [2022-03-15 19:22:48,307 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:52,934 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [30108#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 30111#(or (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30115#(or (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))), 30112#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 30110#(< ~j~0 ~N~0), 30114#(or (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (< ~i~0 ~N~0))), 30109#(or (< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30113#(or (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0)))] [2022-03-15 19:22:52,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:22:52,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:22:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:22:52,935 INFO L87 Difference]: Start difference. First operand 1333 states and 5222 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:53,662 INFO L93 Difference]: Finished difference Result 1819 states and 6600 transitions. [2022-03-15 19:22:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:22:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 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 31 [2022-03-15 19:22:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:53,670 INFO L225 Difference]: With dead ends: 1819 [2022-03-15 19:22:53,670 INFO L226 Difference]: Without dead ends: 1705 [2022-03-15 19:22:53,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 324 SyntacticMatches, 68 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:22:53,671 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 272 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:53,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 4 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:22:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-03-15 19:22:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1191. [2022-03-15 19:22:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 3.7596638655462185) internal successors, (4474), 1190 states have internal predecessors, (4474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 4474 transitions. [2022-03-15 19:22:53,739 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 4474 transitions. Word has length 31 [2022-03-15 19:22:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:53,739 INFO L470 AbstractCegarLoop]: Abstraction has 1191 states and 4474 transitions. [2022-03-15 19:22:53,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 4474 transitions. [2022-03-15 19:22:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:53,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:53,751 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:53,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:53,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:53,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1563484962, now seen corresponding path program 3 times [2022-03-15 19:22:53,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:53,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610256966] [2022-03-15 19:22:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:54,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:54,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610256966] [2022-03-15 19:22:54,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610256966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:54,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510476966] [2022-03-15 19:22:54,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:22:54,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:54,065 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-03-15 19:22:54,066 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-03-15 19:22:54,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:22:54,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:54,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:22:54,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:54,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:54,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510476966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:54,337 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:54,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:22:54,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435536730] [2022-03-15 19:22:54,337 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:54,341 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:54,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 389 states and 1129 transitions. [2022-03-15 19:22:54,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:58,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [34503#(or (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 34539#(or (<= ~n1~0 0) (<= ~q1_back~0 0)), 34540#(or (<= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0))] [2022-03-15 19:22:58,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:22:58,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:22:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:22:58,270 INFO L87 Difference]: Start difference. First operand 1191 states and 4474 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:58,417 INFO L93 Difference]: Finished difference Result 2274 states and 8353 transitions. [2022-03-15 19:22:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:22:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 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 32 [2022-03-15 19:22:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:58,430 INFO L225 Difference]: With dead ends: 2274 [2022-03-15 19:22:58,430 INFO L226 Difference]: Without dead ends: 2119 [2022-03-15 19:22:58,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 408 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:22:58,431 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 78 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:58,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 45 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-03-15 19:22:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1681. [2022-03-15 19:22:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 3.8285714285714287) internal successors, (6432), 1680 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 6432 transitions. [2022-03-15 19:22:58,472 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 6432 transitions. Word has length 32 [2022-03-15 19:22:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:58,472 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 6432 transitions. [2022-03-15 19:22:58,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 6432 transitions. [2022-03-15 19:22:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:22:58,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:58,476 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] [2022-03-15 19:22:58,495 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-03-15 19:22:58,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:58,691 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:22:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1861592578, now seen corresponding path program 1 times [2022-03-15 19:22:58,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:58,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896597304] [2022-03-15 19:22:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:22:58,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:58,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896597304] [2022-03-15 19:22:58,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896597304] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:58,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382345739] [2022-03-15 19:22:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:58,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:58,782 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-03-15 19:22:58,783 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-03-15 19:22:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:58,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:22:58,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:22:58,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:22:58,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382345739] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:58,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:22:58,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-03-15 19:22:58,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246979223] [2022-03-15 19:22:58,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:58,980 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:59,057 INFO L252 McrAutomatonBuilder]: Finished intersection with 282 states and 758 transitions. [2022-03-15 19:22:59,057 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:01,140 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [40282#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))] [2022-03-15 19:23:01,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:23:01,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:23:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:23:01,141 INFO L87 Difference]: Start difference. First operand 1681 states and 6432 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 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-03-15 19:23:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:01,279 INFO L93 Difference]: Finished difference Result 2697 states and 10430 transitions. [2022-03-15 19:23:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:23:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 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 33 [2022-03-15 19:23:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:01,305 INFO L225 Difference]: With dead ends: 2697 [2022-03-15 19:23:01,305 INFO L226 Difference]: Without dead ends: 2697 [2022-03-15 19:23:01,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 254 SyntacticMatches, 24 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:23:01,306 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 76 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:01,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 37 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:23:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2022-03-15 19:23:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1883. [2022-03-15 19:23:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 3.860786397449522) internal successors, (7266), 1882 states have internal predecessors, (7266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 7266 transitions. [2022-03-15 19:23:01,367 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 7266 transitions. Word has length 33 [2022-03-15 19:23:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:01,367 INFO L470 AbstractCegarLoop]: Abstraction has 1883 states and 7266 transitions. [2022-03-15 19:23:01,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 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-03-15 19:23:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 7266 transitions. [2022-03-15 19:23:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:23:01,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:01,372 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] [2022-03-15 19:23:01,390 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-03-15 19:23:01,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:23:01,588 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:23:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1363596097, now seen corresponding path program 1 times [2022-03-15 19:23:01,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:01,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548875849] [2022-03-15 19:23:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:01,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:01,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548875849] [2022-03-15 19:23:01,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548875849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:23:01,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:23:01,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:23:01,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875877131] [2022-03-15 19:23:01,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:01,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:01,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 278 states and 752 transitions. [2022-03-15 19:23:01,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:04,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [46760#(or (<= ~q2_front~0 ~q2_back~0) (< ~q2_back~0 0)), 46759#(not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))] [2022-03-15 19:23:04,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:23:04,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:23:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:23:04,107 INFO L87 Difference]: Start difference. First operand 1883 states and 7266 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:04,252 INFO L93 Difference]: Finished difference Result 2895 states and 11476 transitions. [2022-03-15 19:23:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:23:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 33 [2022-03-15 19:23:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:04,265 INFO L225 Difference]: With dead ends: 2895 [2022-03-15 19:23:04,265 INFO L226 Difference]: Without dead ends: 2895 [2022-03-15 19:23:04,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 220 SyntacticMatches, 23 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:23:04,266 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:04,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:23:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2022-03-15 19:23:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2093. [2022-03-15 19:23:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2092 states have (on average 3.910133843212237) internal successors, (8180), 2092 states have internal predecessors, (8180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 8180 transitions. [2022-03-15 19:23:04,320 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 8180 transitions. Word has length 33 [2022-03-15 19:23:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:04,322 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 8180 transitions. [2022-03-15 19:23:04,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 8180 transitions. [2022-03-15 19:23:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:23:04,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:04,326 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] [2022-03-15 19:23:04,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 19:23:04,327 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:23:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 758664543, now seen corresponding path program 2 times [2022-03-15 19:23:04,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:04,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466587853] [2022-03-15 19:23:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:04,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:04,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466587853] [2022-03-15 19:23:04,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466587853] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:04,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157707289] [2022-03-15 19:23:04,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:23:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:04,426 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-03-15 19:23:04,427 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-03-15 19:23:04,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:23:04,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:04,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:23:04,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:04,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:23:04,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157707289] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:23:04,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:23:04,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-03-15 19:23:04,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579975015] [2022-03-15 19:23:04,712 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:04,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:04,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 374 states and 1090 transitions. [2022-03-15 19:23:04,832 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:11,507 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [53958#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< (+ ~j~0 1) ~N~0)), 53960#(or (not (< ~j~0 ~N~0)) (< (+ ~j~0 1) ~N~0)), 53956#(not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 53959#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< (+ ~j~0 1) ~N~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 53955#(not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 53957#(or (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 53962#(<= ~N~0 ~j~0), 53963#(and (or (not (< ~j~0 ~N~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (or (= |thread4Thread1of1ForFork0_~cond~3#1| 0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), 53964#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< ~j~0 ~N~0)), 53961#(or (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))] [2022-03-15 19:23:11,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:23:11,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:23:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:23:11,508 INFO L87 Difference]: Start difference. First operand 2093 states and 8180 transitions. Second operand has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:11,920 INFO L93 Difference]: Finished difference Result 2369 states and 9186 transitions. [2022-03-15 19:23:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:23:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:23:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:11,927 INFO L225 Difference]: With dead ends: 2369 [2022-03-15 19:23:11,927 INFO L226 Difference]: Without dead ends: 2261 [2022-03-15 19:23:11,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 323 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:23:11,928 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:11,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 19 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:23:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2022-03-15 19:23:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1799. [2022-03-15 19:23:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1798 states have (on average 3.806451612903226) internal successors, (6844), 1798 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6844 transitions. [2022-03-15 19:23:11,962 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6844 transitions. Word has length 33 [2022-03-15 19:23:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:11,962 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 6844 transitions. [2022-03-15 19:23:11,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6844 transitions. [2022-03-15 19:23:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:23:11,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:11,966 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] [2022-03-15 19:23:11,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 19:23:12,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:12,187 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:23:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1572333612, now seen corresponding path program 2 times [2022-03-15 19:23:12,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:12,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567310089] [2022-03-15 19:23:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:12,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:12,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567310089] [2022-03-15 19:23:12,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567310089] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:12,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199896497] [2022-03-15 19:23:12,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:23:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:12,323 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-03-15 19:23:12,325 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-03-15 19:23:12,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:23:12,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:23:12,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:23:12,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:12,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:12,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199896497] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:12,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:23:12,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2022-03-15 19:23:12,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785264370] [2022-03-15 19:23:12,724 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:12,728 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:12,834 INFO L252 McrAutomatonBuilder]: Finished intersection with 338 states and 950 transitions. [2022-03-15 19:23:12,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:17,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [60159#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0)), 60155#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 60158#(or (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0))), 60160#(or (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (< ~i~0 ~N~0))), 60157#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 60156#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 60154#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))] [2022-03-15 19:23:17,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:23:17,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:17,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:23:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:23:17,503 INFO L87 Difference]: Start difference. First operand 1799 states and 6844 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:17,960 INFO L93 Difference]: Finished difference Result 2481 states and 9175 transitions. [2022-03-15 19:23:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 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 33 [2022-03-15 19:23:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:17,967 INFO L225 Difference]: With dead ends: 2481 [2022-03-15 19:23:17,967 INFO L226 Difference]: Without dead ends: 2361 [2022-03-15 19:23:17,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 285 SyntacticMatches, 79 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:23:17,968 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 122 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:17,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 16 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:23:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2022-03-15 19:23:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1811. [2022-03-15 19:23:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 3.7779005524861877) internal successors, (6838), 1810 states have internal predecessors, (6838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 6838 transitions. [2022-03-15 19:23:18,002 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 6838 transitions. Word has length 33 [2022-03-15 19:23:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:18,003 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 6838 transitions. [2022-03-15 19:23:18,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 6838 transitions. [2022-03-15 19:23:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:23:18,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:18,006 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 19:23:18,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:23:18,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:18,242 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:23:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:18,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1145988338, now seen corresponding path program 4 times [2022-03-15 19:23:18,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:18,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797608973] [2022-03-15 19:23:18,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:23:18,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:18,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797608973] [2022-03-15 19:23:18,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797608973] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:23:18,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:23:18,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:23:18,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324846995] [2022-03-15 19:23:18,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:23:18,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:23:18,494 INFO L252 McrAutomatonBuilder]: Finished intersection with 390 states and 1130 transitions. [2022-03-15 19:23:18,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:23:21,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [66303#(or (<= ~N~0 (+ ~i~0 1)) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< (+ 2 ~i~0) ~N~0)), 66299#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 66296#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 66306#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0)), 66308#(or (<= ~N~0 (+ ~i~0 1)) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0) (< (+ 2 ~i~0) ~N~0)), 66307#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (< ~j~0 ~N~0)) (or (< ~j~0 ~N~0) (<= ~N~0 ~i~0))), 66298#(or (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 66301#(or (<= ~N~0 (+ ~i~0 1)) (< (+ 2 ~i~0) ~N~0)), 66302#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 66297#(or (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 66305#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))) (or (<= ~N~0 ~i~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))) (or (<= ~N~0 ~j~0) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)))), 66304#(or (<= ~N~0 (+ ~i~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< (+ 2 ~i~0) ~N~0)), 66295#(< ~j~0 ~N~0), 66294#(not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 66300#(or (<= ~N~0 (+ ~i~0 1)) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< (+ 2 ~i~0) ~N~0)), 66309#(or (<= ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0) (< (+ 2 ~i~0) ~N~0))] [2022-03-15 19:23:21,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:23:21,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:23:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:23:21,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:23:21,705 INFO L87 Difference]: Start difference. First operand 1811 states and 6838 transitions. Second operand has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:23:22,362 INFO L93 Difference]: Finished difference Result 1631 states and 6260 transitions. [2022-03-15 19:23:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:23:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 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 33 [2022-03-15 19:23:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:23:22,366 INFO L225 Difference]: With dead ends: 1631 [2022-03-15 19:23:22,366 INFO L226 Difference]: Without dead ends: 1518 [2022-03-15 19:23:22,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:23:22,367 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 304 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:23:22,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 3 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:23:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2022-03-15 19:23:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2022-03-15 19:23:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 3.898483849703362) internal successors, (5914), 1517 states have internal predecessors, (5914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 5914 transitions. [2022-03-15 19:23:22,391 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 5914 transitions. Word has length 33 [2022-03-15 19:23:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:23:22,391 INFO L470 AbstractCegarLoop]: Abstraction has 1518 states and 5914 transitions. [2022-03-15 19:23:22,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:23:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 5914 transitions. [2022-03-15 19:23:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:23:22,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:23:22,394 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] [2022-03-15 19:23:22,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 19:23:22,394 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:23:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:23:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 370487303, now seen corresponding path program 1 times [2022-03-15 19:23:22,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:23:22,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361358469] [2022-03-15 19:23:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:23:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:23,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:23:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361358469] [2022-03-15 19:23:23,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361358469] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:23:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553102124] [2022-03-15 19:23:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:23:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:23:23,514 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-03-15 19:23:23,515 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-03-15 19:23:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:23:23,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:23:23,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:23:23,727 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 135 treesize of output 127 [2022-03-15 19:23:23,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, 3 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-03-15 19:23:24,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:23:24,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:23:24,148 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:23:24,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2022-03-15 19:23:24,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:24,262 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 45 treesize of output 33 [2022-03-15 19:23:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:23:24,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:24,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_753 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 1)))) (forall ((v_ArrVal_753 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) 0))) is different from false [2022-03-15 19:23:24,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int) (v_ArrVal_752 (Array Int Int))) (or (not (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) c_~C~0) 0)) (and (forall ((v_ArrVal_753 (Array Int Int))) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0 1)))) (forall ((v_ArrVal_753 (Array Int Int))) (<= (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0)) 0))))) is different from false [2022-03-15 19:23:24,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) c_~C~0) 0)) (and (forall ((v_ArrVal_753 (Array Int Int))) (< 0 (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0 1)))) (forall ((v_ArrVal_753 (Array Int Int))) (<= (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_753))) (+ (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0)) 0))))) is different from false [2022-03-15 19:23:24,692 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:24,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 358616 treesize of output 334068 [2022-03-15 19:23:25,403 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:25,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 333960 treesize of output 315564 [2022-03-15 19:23:26,088 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:26,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315516 treesize of output 278676 [2022-03-15 19:23:26,781 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:26,782 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 278509 treesize of output 229374 [2022-03-15 19:23:27,529 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:27,530 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 229357 treesize of output 204798 [2022-03-15 19:23:28,246 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:23:28,272 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-03-15 19:23:28,451 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,SelfDestructingSolverStorable14 [2022-03-15 19:23:28,452 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) 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:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) 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-03-15 19:23:28,455 INFO L158 Benchmark]: Toolchain (without parser) took 85338.99ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 132.7MB in the beginning and 571.5MB in the end (delta: -438.8MB). Peak memory consumption was 752.4MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,455 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:23:28,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.46ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 157.5MB in the end (delta: -24.9MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.37ms. Allocated memory is still 188.7MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,455 INFO L158 Benchmark]: Boogie Preprocessor took 23.09ms. Allocated memory is still 188.7MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,456 INFO L158 Benchmark]: RCFGBuilder took 686.14ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 115.6MB in the end (delta: 37.1MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,456 INFO L158 Benchmark]: TraceAbstraction took 84256.65ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 115.5MB in the beginning and 571.5MB in the end (delta: -456.0MB). Peak memory consumption was 735.7MB. Max. memory is 8.0GB. [2022-03-15 19:23:28,457 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.09ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.46ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 157.5MB in the end (delta: -24.9MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.37ms. Allocated memory is still 188.7MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.09ms. Allocated memory is still 188.7MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 686.14ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 115.6MB in the end (delta: 37.1MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 84256.65ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 115.5MB in the beginning and 571.5MB in the end (delta: -456.0MB). Peak memory consumption was 735.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 224 PlacesBefore, 47 PlacesAfterwards, 229 TransitionsBefore, 40 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 8 FixpointIterations, 152 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 8 ConcurrentYvCompositions, 12 ChoiceCompositions, 224 TotalNumberOfCompositions, 3198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2630, positive: 2546, positive conditional: 0, positive unconditional: 2546, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 950, positive: 928, positive conditional: 0, positive unconditional: 928, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2630, positive: 1618, positive conditional: 0, positive unconditional: 1618, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 950, unknown conditional: 0, unknown unconditional: 950] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:23:28,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...