/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/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:49:42,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:49:42,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:49:42,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:49:42,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:49:42,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:49:42,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:49:42,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:49:42,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:49:42,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:49:42,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:49:42,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:49:42,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:49:42,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:49:42,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:49:42,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:49:42,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:49:42,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:49:42,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:49:42,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:49:42,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:49:42,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:49:42,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:49:42,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:49:42,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:49:42,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:49:42,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:49:42,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:49:42,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:49:42,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:49:42,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:49:42,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:49:42,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:49:42,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:49:42,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:49:42,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:49:42,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:49:42,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:49:42,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:49:42,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:49:42,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:49:42,767 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:49:42,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:49:42,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:49:42,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:49:42,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:49:42,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:49:42,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:49:42,801 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:49:42,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:49:42,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:49:42,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:49:42,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:49:42,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:49:42,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:49:42,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:49:42,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:49:42,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:49:42,805 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:49:43,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:49:43,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:49:43,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:49:43,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:49:43,067 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:49:43,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2022-03-15 19:49:43,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405f7aea/365e4eb09d69442590bd88352e6cc803/FLAG010de79dd [2022-03-15 19:49:43,506 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:49:43,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2022-03-15 19:49:43,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405f7aea/365e4eb09d69442590bd88352e6cc803/FLAG010de79dd [2022-03-15 19:49:43,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0405f7aea/365e4eb09d69442590bd88352e6cc803 [2022-03-15 19:49:43,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:49:43,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:49:43,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:49:43,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:49:43,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:49:43,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:49:43" (1/1) ... [2022-03-15 19:49:43,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60905172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:43, skipping insertion in model container [2022-03-15 19:49:43,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:49:43" (1/1) ... [2022-03-15 19:49:43,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:49:43,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:49:44,165 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/test-hard1.wvr.c[3373,3386] [2022-03-15 19:49:44,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:49:44,181 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:49:44,217 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/test-hard1.wvr.c[3373,3386] [2022-03-15 19:49:44,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:49:44,232 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:49:44,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44 WrapperNode [2022-03-15 19:49:44,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:49:44,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:49:44,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:49:44,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:49:44,240 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:49:44" (1/1) ... [2022-03-15 19:49:44,256 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:49:44" (1/1) ... [2022-03-15 19:49:44,279 INFO L137 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2022-03-15 19:49:44,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:49:44,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:49:44,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:49:44,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:49:44,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:49:44,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:49:44,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:49:44,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:49:44,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (1/1) ... [2022-03-15 19:49:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:49:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:44,352 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:49:44,370 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:49:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:49:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:49:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:49:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:49:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:49:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:49:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:49:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:49:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:49:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:49:44,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:49:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:49:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:49:44,401 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:49:44,493 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:49:44,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:49:44,731 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:49:44,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:49:44,771 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:49:44,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:49:44 BoogieIcfgContainer [2022-03-15 19:49:44,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:49:44,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:49:44,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:49:44,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:49:44,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:49:43" (1/3) ... [2022-03-15 19:49:44,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5df24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:49:44, skipping insertion in model container [2022-03-15 19:49:44,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:44" (2/3) ... [2022-03-15 19:49:44,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5df24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:49:44, skipping insertion in model container [2022-03-15 19:49:44,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:49:44" (3/3) ... [2022-03-15 19:49:44,780 INFO L111 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2022-03-15 19:49:44,784 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:49:44,785 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:49:44,785 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:49:44,785 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:49:44,820 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,820 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,821 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,821 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,821 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,822 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,823 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,824 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,824 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,825 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,825 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,825 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,825 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,826 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,826 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,828 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,828 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,829 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,829 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,829 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,829 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,830 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,831 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,831 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,831 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,831 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,832 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,832 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,832 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,832 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,833 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,833 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,833 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,833 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,834 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,834 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,834 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,834 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,835 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,835 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,837 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,838 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,838 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,838 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,839 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,840 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,840 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,840 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:44,858 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:49:44,911 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:49:44,919 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:49:44,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:49:44,937 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:49:44,944 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 135 transitions, 302 flow [2022-03-15 19:49:44,947 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 135 transitions, 302 flow [2022-03-15 19:49:44,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 135 transitions, 302 flow [2022-03-15 19:49:45,014 INFO L129 PetriNetUnfolder]: 10/131 cut-off events. [2022-03-15 19:49:45,015 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:49:45,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 10/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-03-15 19:49:45,022 INFO L116 LiptonReduction]: Number of co-enabled transitions 1824 [2022-03-15 19:49:49,047 INFO L131 LiptonReduction]: Checked pairs total: 3596 [2022-03-15 19:49:49,047 INFO L133 LiptonReduction]: Total number of compositions: 110 [2022-03-15 19:49:49,053 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 38 transitions, 108 flow [2022-03-15 19:49:49,156 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 852 states, 851 states have (on average 4.1786133960047005) internal successors, (3556), 851 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:49:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 852 states, 851 states have (on average 4.1786133960047005) internal successors, (3556), 851 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:49:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:49:49,187 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:49,188 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] [2022-03-15 19:49:49,188 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:49:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1109298265, now seen corresponding path program 1 times [2022-03-15 19:49:49,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:49,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221564495] [2022-03-15 19:49:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:49,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:49,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221564495] [2022-03-15 19:49:49,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221564495] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:49,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:49:49,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:49:49,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277148593] [2022-03-15 19:49:49,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:49,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:49,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 322 states and 945 transitions. [2022-03-15 19:49:49,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:53,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:49:53,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:49:53,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:49:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:49:53,172 INFO L87 Difference]: Start difference. First operand has 852 states, 851 states have (on average 4.1786133960047005) internal successors, (3556), 851 states have internal predecessors, (3556), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:49:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:53,264 INFO L93 Difference]: Finished difference Result 1163 states and 4823 transitions. [2022-03-15 19:49:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:49:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-03-15 19:49:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:53,285 INFO L225 Difference]: With dead ends: 1163 [2022-03-15 19:49:53,285 INFO L226 Difference]: Without dead ends: 1154 [2022-03-15 19:49:53,286 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:49:53,289 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 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.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:53,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-03-15 19:49:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2022-03-15 19:49:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 4.158716392020815) internal successors, (4795), 1153 states have internal predecessors, (4795), 0 states have call successors, (0), 0 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:49:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 4795 transitions. [2022-03-15 19:49:53,384 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 4795 transitions. Word has length 25 [2022-03-15 19:49:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:53,384 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 4795 transitions. [2022-03-15 19:49:53,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:49:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 4795 transitions. [2022-03-15 19:49:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:49:53,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:53,390 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:49:53,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:49:53,390 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:49:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1710570039, now seen corresponding path program 1 times [2022-03-15 19:49:53,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:53,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320100663] [2022-03-15 19:49:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:53,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:53,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320100663] [2022-03-15 19:49:53,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320100663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:53,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946459821] [2022-03-15 19:49:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:53,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:53,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:53,579 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:49:53,610 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:49:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:53,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:49:53,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:53,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:54,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946459821] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:54,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:54,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-03-15 19:49:54,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [242066951] [2022-03-15 19:49:54,196 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:54,201 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:54,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 410 states and 1207 transitions. [2022-03-15 19:49:54,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:02,703 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [5448#(or (not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)) (< 0 ~n2~0)), 5499#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 5502#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 5503#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0)) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0))), 5495#(< 0 ~n2~0), 5501#(or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 5497#(or (< 1 ~n2~0) (not (< 0 ~n2~0))), 5471#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0)), 5461#(or (< 0 ~n1~0) (< 0 ~n2~0)), 5475#(or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0))), 5440#(not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 5494#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 5505#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 0 ~n2~0)))), 5496#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 5500#(or (< 1 ~n2~0) (<= ~n2~0 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 5498#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 5504#(and (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0)))] [2022-03-15 19:50:02,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:50:02,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:50:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:50:02,705 INFO L87 Difference]: Start difference. First operand 1154 states and 4795 transitions. Second operand has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 23 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:50:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:05,514 INFO L93 Difference]: Finished difference Result 4436 states and 18226 transitions. [2022-03-15 19:50:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:50:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 23 states have internal predecessors, (230), 0 states have call successors, (0), 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:50:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:05,550 INFO L225 Difference]: With dead ends: 4436 [2022-03-15 19:50:05,551 INFO L226 Difference]: Without dead ends: 4436 [2022-03-15 19:50:05,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 314 SyntacticMatches, 97 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=931, Invalid=4325, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:50:05,553 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 587 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:05,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 123 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:50:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2022-03-15 19:50:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 1834. [2022-03-15 19:50:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 4.290780141843972) internal successors, (7865), 1833 states have internal predecessors, (7865), 0 states have call successors, (0), 0 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:50:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 7865 transitions. [2022-03-15 19:50:05,658 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 7865 transitions. Word has length 27 [2022-03-15 19:50:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:05,662 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 7865 transitions. [2022-03-15 19:50:05,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 23 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:50:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 7865 transitions. [2022-03-15 19:50:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:05,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:05,670 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:50:05,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:05,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:05,892 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:50:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -48209536, now seen corresponding path program 1 times [2022-03-15 19:50:05,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:05,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075128578] [2022-03-15 19:50:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:06,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:06,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075128578] [2022-03-15 19:50:06,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075128578] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:06,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739118281] [2022-03-15 19:50:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:06,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:06,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:06,056 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:50:06,057 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:50:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:06,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:50:06,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:06,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:06,350 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:50:06,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739118281] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:06,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:50:06,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-03-15 19:50:06,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022406216] [2022-03-15 19:50:06,351 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:06,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:06,466 INFO L252 McrAutomatonBuilder]: Finished intersection with 436 states and 1304 transitions. [2022-03-15 19:50:06,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:13,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [13861#(< 0 ~n1~0), 13863#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n1~0)), 13862#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n1~0))), 13864#(or (<= ~n1~0 1) (< 2 ~n1~0)), 13860#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))] [2022-03-15 19:50:13,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:50:13,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:50:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:50:13,197 INFO L87 Difference]: Start difference. First operand 1834 states and 7865 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:50:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:13,960 INFO L93 Difference]: Finished difference Result 3360 states and 13797 transitions. [2022-03-15 19:50:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:50:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 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:50:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:13,985 INFO L225 Difference]: With dead ends: 3360 [2022-03-15 19:50:13,985 INFO L226 Difference]: Without dead ends: 3360 [2022-03-15 19:50:13,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 346 SyntacticMatches, 117 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:50:13,988 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 164 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:13,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 314 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:50:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-03-15 19:50:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2460. [2022-03-15 19:50:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 4.36762911752745) internal successors, (10740), 2459 states have internal predecessors, (10740), 0 states have call successors, (0), 0 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:50:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 10740 transitions. [2022-03-15 19:50:14,088 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 10740 transitions. Word has length 27 [2022-03-15 19:50:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:14,088 INFO L470 AbstractCegarLoop]: Abstraction has 2460 states and 10740 transitions. [2022-03-15 19:50:14,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:50:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 10740 transitions. [2022-03-15 19:50:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:14,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:14,098 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:50:14,122 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:50:14,319 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,SelfDestructingSolverStorable2 [2022-03-15 19:50:14,320 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:50:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -493941621, now seen corresponding path program 1 times [2022-03-15 19:50:14,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:14,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713649266] [2022-03-15 19:50:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:14,445 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:50:14,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:14,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713649266] [2022-03-15 19:50:14,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713649266] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:50:14,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:50:14,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:50:14,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305894795] [2022-03-15 19:50:14,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:14,452 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:14,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 380 states and 1120 transitions. [2022-03-15 19:50:14,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:18,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [22183#(= (mod thread1Thread1of1ForFork1_~cond~0 256) 0), 22187#(or (< 0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 22188#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 0 ~n1~0))) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (< 0 ~n1~0)))), 22186#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 22184#(not (< 0 ~n1~0)), 22189#(and (or (= thread2Thread1of1ForFork3_~cond~1 0) (< 0 ~n1~0)) (or (= thread2Thread1of1ForFork3_~cond~1 1) (not (< 0 ~n1~0)))), 22185#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))] [2022-03-15 19:50:18,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:50:18,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:50:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:50:18,785 INFO L87 Difference]: Start difference. First operand 2460 states and 10740 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:50:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:19,608 INFO L93 Difference]: Finished difference Result 3764 states and 15373 transitions. [2022-03-15 19:50:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:50:19,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 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:50:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:19,631 INFO L225 Difference]: With dead ends: 3764 [2022-03-15 19:50:19,632 INFO L226 Difference]: Without dead ends: 3652 [2022-03-15 19:50:19,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 332 SyntacticMatches, 29 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:50:19,633 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 239 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:19,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 292 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:50:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2022-03-15 19:50:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 2560. [2022-03-15 19:50:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 4.205939820242282) internal successors, (10763), 2559 states have internal predecessors, (10763), 0 states have call successors, (0), 0 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:50:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 10763 transitions. [2022-03-15 19:50:19,720 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 10763 transitions. Word has length 27 [2022-03-15 19:50:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:19,720 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 10763 transitions. [2022-03-15 19:50:19,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:50:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 10763 transitions. [2022-03-15 19:50:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:19,729 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:19,729 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:50:19,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:50:19,729 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:50:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1520411932, now seen corresponding path program 1 times [2022-03-15 19:50:19,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:19,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946518096] [2022-03-15 19:50:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:19,840 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:50:19,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946518096] [2022-03-15 19:50:19,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946518096] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:50:19,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:50:19,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:50:19,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896196929] [2022-03-15 19:50:19,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:19,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:19,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 404 states and 1192 transitions. [2022-03-15 19:50:19,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:25,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31124#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 31122#(not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)), 31126#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 31121#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 31127#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 0 ~n2~0)), 31123#(< 0 ~n2~0), 31130#(or (<= ~n2~0 1) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 2 ~n2~0)), 31133#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n2~0 0)), 31125#(or (not (< 1 ~n2~0)) (< 2 ~n2~0)), 31128#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 0 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 2 ~n2~0))), 31129#(or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0)), 31131#(and (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n2~0 0))), 31132#(or (< 0 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 0))] [2022-03-15 19:50:25,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:50:25,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:50:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:50:25,706 INFO L87 Difference]: Start difference. First operand 2560 states and 10763 transitions. Second operand has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:50:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:26,846 INFO L93 Difference]: Finished difference Result 4672 states and 19290 transitions. [2022-03-15 19:50:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:50:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 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:50:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:26,868 INFO L225 Difference]: With dead ends: 4672 [2022-03-15 19:50:26,868 INFO L226 Difference]: Without dead ends: 4622 [2022-03-15 19:50:26,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 355 SyntacticMatches, 27 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:50:26,869 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 292 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:26,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 462 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:50:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-03-15 19:50:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3096. [2022-03-15 19:50:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 4.3424878836833605) internal successors, (13440), 3095 states have internal predecessors, (13440), 0 states have call successors, (0), 0 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:50:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 13440 transitions. [2022-03-15 19:50:26,975 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 13440 transitions. Word has length 27 [2022-03-15 19:50:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:26,975 INFO L470 AbstractCegarLoop]: Abstraction has 3096 states and 13440 transitions. [2022-03-15 19:50:26,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:50:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 13440 transitions. [2022-03-15 19:50:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:26,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:26,986 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:50:26,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:50:26,986 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:50:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash 534796775, now seen corresponding path program 2 times [2022-03-15 19:50:26,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:26,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664987168] [2022-03-15 19:50:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:27,200 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:50:27,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:27,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664987168] [2022-03-15 19:50:27,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664987168] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:50:27,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:50:27,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:50:27,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613450232] [2022-03-15 19:50:27,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:27,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:27,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 378 states and 1095 transitions. [2022-03-15 19:50:27,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:29,854 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [42061#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 42063#(and (<= ~n1~0 0) (<= ~n2~0 0)), 42059#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 42056#(not (< 0 ~n1~0)), 42057#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 42062#(or (<= ~n1~0 0) (< 0 ~n2~0)), 42058#(< 0 ~n2~0), 42055#(= (mod thread1Thread1of1ForFork1_~cond~0 256) 0), 42064#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (or (not (<= ~n2~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (or (not (<= ~n2~0 0)) (not (< 0 ~n1~0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n2~0 0))), 42060#(or (<= ~n1~0 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))] [2022-03-15 19:50:29,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:50:29,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:50:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:50:29,856 INFO L87 Difference]: Start difference. First operand 3096 states and 13440 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:50:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:31,131 INFO L93 Difference]: Finished difference Result 5444 states and 22510 transitions. [2022-03-15 19:50:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:50:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 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:50:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:31,171 INFO L225 Difference]: With dead ends: 5444 [2022-03-15 19:50:31,172 INFO L226 Difference]: Without dead ends: 5380 [2022-03-15 19:50:31,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 336 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:50:31,174 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 326 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:31,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 44 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:50:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2022-03-15 19:50:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 3528. [2022-03-15 19:50:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3527 states have (on average 4.331443152821095) internal successors, (15277), 3527 states have internal predecessors, (15277), 0 states have call successors, (0), 0 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:50:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 15277 transitions. [2022-03-15 19:50:31,307 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 15277 transitions. Word has length 27 [2022-03-15 19:50:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:31,308 INFO L470 AbstractCegarLoop]: Abstraction has 3528 states and 15277 transitions. [2022-03-15 19:50:31,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:50:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 15277 transitions. [2022-03-15 19:50:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:31,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:31,319 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:50:31,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:50:31,319 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:50:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2019247140, now seen corresponding path program 2 times [2022-03-15 19:50:31,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:31,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962785073] [2022-03-15 19:50:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:31,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:31,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962785073] [2022-03-15 19:50:31,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962785073] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:31,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670290763] [2022-03-15 19:50:31,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:50:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:31,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:31,468 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:50:31,469 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:50:31,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:50:31,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:31,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:50:31,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:31,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:32,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670290763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:32,352 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:32,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-03-15 19:50:32,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [692863952] [2022-03-15 19:50:32,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:32,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:32,420 INFO L252 McrAutomatonBuilder]: Finished intersection with 338 states and 967 transitions. [2022-03-15 19:50:32,420 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:37,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [54794#(or (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 54787#(or (< 0 ~n1~0) (< 0 ~n2~0)), 54786#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 54788#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0)) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0))), 54791#(and (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 54795#(or (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 54784#(or (< 0 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 54781#(not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)), 54793#(or (not (< 1 ~n2~0)) (< 2 ~n2~0)), 54783#(or (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 54790#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 54780#(< 0 ~n1~0), 54782#(< 0 ~n2~0), 54785#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)))), 54779#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 54789#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 54792#(and (or (not (<= ~n2~0 0)) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (< 0 ~n1~0) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 1)))] [2022-03-15 19:50:37,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:50:37,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:50:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:50:37,669 INFO L87 Difference]: Start difference. First operand 3528 states and 15277 transitions. Second operand has 24 states, 24 states have (on average 8.416666666666666) internal successors, (202), 23 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:42,649 INFO L93 Difference]: Finished difference Result 12144 states and 47899 transitions. [2022-03-15 19:50:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-15 19:50:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.416666666666666) internal successors, (202), 23 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:50:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:42,694 INFO L225 Difference]: With dead ends: 12144 [2022-03-15 19:50:42,694 INFO L226 Difference]: Without dead ends: 11664 [2022-03-15 19:50:42,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 296 SyntacticMatches, 41 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6540 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2858, Invalid=14434, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 19:50:42,698 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 1154 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 3862 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 3862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:42,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1154 Valid, 58 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 3862 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:50:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11664 states. [2022-03-15 19:50:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11664 to 4176. [2022-03-15 19:50:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 4.342035928143712) internal successors, (18128), 4175 states have internal predecessors, (18128), 0 states have call successors, (0), 0 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:50:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 18128 transitions. [2022-03-15 19:50:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 18128 transitions. Word has length 27 [2022-03-15 19:50:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:42,916 INFO L470 AbstractCegarLoop]: Abstraction has 4176 states and 18128 transitions. [2022-03-15 19:50:42,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.416666666666666) internal successors, (202), 23 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 18128 transitions. [2022-03-15 19:50:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:50:42,928 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:42,928 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:50:42,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:50:43,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:43,151 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:50:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1722029894, now seen corresponding path program 2 times [2022-03-15 19:50:43,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:43,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606921155] [2022-03-15 19:50:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:43,315 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:50:43,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:43,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606921155] [2022-03-15 19:50:43,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606921155] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:50:43,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:50:43,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:50:43,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028668958] [2022-03-15 19:50:43,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:43,320 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:43,388 INFO L252 McrAutomatonBuilder]: Finished intersection with 370 states and 1079 transitions. [2022-03-15 19:50:43,388 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:46,473 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [75500#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 75505#(< 0 ~n2~0), 75496#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 75507#(or (< 0 ~n1~0) (< 0 ~n2~0)), 75502#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 75508#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0)), 75506#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 75510#(and (or (= ~n2~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= (* (- 1) thread2Thread1of1ForFork3_~cond~1) 0)) (or (<= ~n1~0 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 75497#(< 0 ~n1~0), 75503#(not (< 0 ~n1~0)), 75498#(= (mod thread2Thread1of1ForFork3_~cond~1 256) 0), 75499#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 75501#(or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 75504#(or (<= ~n1~0 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 75511#(and (or (< 0 ~n2~0) (= (* (- 1) thread2Thread1of1ForFork3_~cond~1) 0)) (or (< 0 ~n2~0) (= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), 75509#(or (<= ~n1~0 0) (< 0 ~n2~0))] [2022-03-15 19:50:46,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:50:46,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:50:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:50:46,474 INFO L87 Difference]: Start difference. First operand 4176 states and 18128 transitions. Second operand has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:50:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:48,138 INFO L93 Difference]: Finished difference Result 6040 states and 25575 transitions. [2022-03-15 19:50:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:50:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 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:50:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:48,158 INFO L225 Difference]: With dead ends: 6040 [2022-03-15 19:50:48,159 INFO L226 Difference]: Without dead ends: 6024 [2022-03-15 19:50:48,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 322 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=439, Invalid=1913, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:50:48,160 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 560 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:48,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 92 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:50:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2022-03-15 19:50:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4056. [2022-03-15 19:50:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 4.344266337854501) internal successors, (17616), 4055 states have internal predecessors, (17616), 0 states have call successors, (0), 0 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:50:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 17616 transitions. [2022-03-15 19:50:48,283 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 17616 transitions. Word has length 27 [2022-03-15 19:50:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:48,284 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 17616 transitions. [2022-03-15 19:50:48,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:50:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 17616 transitions. [2022-03-15 19:50:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:50:48,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:48,295 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:50:48,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 19:50:48,296 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:50:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1463613371, now seen corresponding path program 1 times [2022-03-15 19:50:48,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:48,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457502662] [2022-03-15 19:50:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:48,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:48,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457502662] [2022-03-15 19:50:48,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457502662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:48,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960984124] [2022-03-15 19:50:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:48,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:48,554 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:50:48,555 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:50:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:48,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:50:48,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:49,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:49,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960984124] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:49,622 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:49,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-03-15 19:50:49,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425335090] [2022-03-15 19:50:49,622 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:49,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:49,701 INFO L252 McrAutomatonBuilder]: Finished intersection with 482 states and 1401 transitions. [2022-03-15 19:50:49,701 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:08,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [89909#(and (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (< 0 ~n1~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)))), 89910#(and (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0)))), 89915#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0))), 89903#(and (or (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n2~0))), 89912#(and (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)))), 89914#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 89913#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0)) (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n1~0)) (< 0 ~n2~0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)))), 89905#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)))), 89902#(and (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296))))), 89907#(and (or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 89904#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0)))), 89908#(and (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 0 ~n1~0) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n1~0) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (< 0 ~n1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 89906#(and (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 89916#(and (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))), 89917#(and (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (or (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n2~0 0)) (or (not (<= ~n2~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))), 89911#(and (or (<= (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0)) (not (< 0 ~n1~0)) (< 0 ~n2~0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0)))] [2022-03-15 19:51:08,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:51:08,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:51:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:51:08,941 INFO L87 Difference]: Start difference. First operand 4056 states and 17616 transitions. Second operand has 22 states, 21 states have (on average 7.571428571428571) internal successors, (159), 21 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:51:14,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:17,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:20,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:22,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:25,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:31,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:33,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:35,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:38,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:43,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:44,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:47,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:49,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:54,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:51:59,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:02,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:04,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:06,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:07,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:12,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:13,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:18,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:21,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:22,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:24,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:26,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:28,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:29,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:34,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:39,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:41,439 INFO L93 Difference]: Finished difference Result 17253 states and 67245 transitions. [2022-03-15 19:52:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 19:52:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.571428571428571) internal successors, (159), 21 states have internal predecessors, (159), 0 states have call successors, (0), 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:52:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:41,498 INFO L225 Difference]: With dead ends: 17253 [2022-03-15 19:52:41,498 INFO L226 Difference]: Without dead ends: 16675 [2022-03-15 19:52:41,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 478 SyntacticMatches, 13 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6100 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=2406, Invalid=13344, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 19:52:41,502 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1572 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 4171 mSolverCounterSat, 294 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 4482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 4171 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:41,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 56 Invalid, 4482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 4171 Invalid, 17 Unknown, 0 Unchecked, 74.3s Time] [2022-03-15 19:52:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16675 states. [2022-03-15 19:52:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16675 to 5264. [2022-03-15 19:52:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5263 states have (on average 4.494964848945468) internal successors, (23657), 5263 states have internal predecessors, (23657), 0 states have call successors, (0), 0 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:52:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 23657 transitions. [2022-03-15 19:52:41,812 INFO L78 Accepts]: Start accepts. Automaton has 5264 states and 23657 transitions. Word has length 29 [2022-03-15 19:52:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:41,812 INFO L470 AbstractCegarLoop]: Abstraction has 5264 states and 23657 transitions. [2022-03-15 19:52:41,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.571428571428571) internal successors, (159), 21 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:52:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5264 states and 23657 transitions. [2022-03-15 19:52:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:52:41,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:41,827 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] [2022-03-15 19:52:41,835 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:52:42,035 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:52:42,036 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:52:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1993672227, now seen corresponding path program 2 times [2022-03-15 19:52:42,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:42,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515385112] [2022-03-15 19:52:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:52:42,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:42,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515385112] [2022-03-15 19:52:42,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515385112] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:42,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149951873] [2022-03-15 19:52:42,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:52:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:42,186 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:52:42,187 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:52:42,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:52:42,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:42,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:52:42,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:52:42,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:52:42,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149951873] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:42,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:52:42,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 13 [2022-03-15 19:52:42,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466205478] [2022-03-15 19:52:42,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:42,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:42,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 498 states and 1469 transitions. [2022-03-15 19:52:42,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:51,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [118090#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)), 118093#(or (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118077#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 118092#(or (<= ~n2~0 1) (< 2 ~n2~0)), 118096#(or (not (< 0 ~n2~0)) (not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118087#(or (< 0 ~n1~0) (< 0 ~n2~0)), 118085#(< 0 ~n1~0), 118083#(or (< 1 ~n2~0) (not (< 0 ~n2~0))), 118082#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118091#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118086#(or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 118080#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 118088#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0)), 118095#(or (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 118078#(< 0 ~n2~0), 118081#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118079#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 118089#(or (< 1 ~n2~0) (< 0 ~n1~0) (<= ~n2~0 0)), 118094#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 118084#(or (< 1 ~n2~0) (<= ~n2~0 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))] [2022-03-15 19:52:51,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:51,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:51,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:52:51,073 INFO L87 Difference]: Start difference. First operand 5264 states and 23657 transitions. Second operand has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:52:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:52,909 INFO L93 Difference]: Finished difference Result 8208 states and 33456 transitions. [2022-03-15 19:52:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:52:52,909 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 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:52:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:52,930 INFO L225 Difference]: With dead ends: 8208 [2022-03-15 19:52:52,930 INFO L226 Difference]: Without dead ends: 8138 [2022-03-15 19:52:52,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 434 SyntacticMatches, 64 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=661, Invalid=2879, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:52:52,931 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 688 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:52,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 72 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:52:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8138 states. [2022-03-15 19:52:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8138 to 5208. [2022-03-15 19:52:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 5207 states have (on average 4.441905127712695) internal successors, (23129), 5207 states have internal predecessors, (23129), 0 states have call successors, (0), 0 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:52:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 23129 transitions. [2022-03-15 19:52:53,119 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 23129 transitions. Word has length 29 [2022-03-15 19:52:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:53,121 INFO L470 AbstractCegarLoop]: Abstraction has 5208 states and 23129 transitions. [2022-03-15 19:52:53,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:52:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 23129 transitions. [2022-03-15 19:52:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:52:53,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:53,136 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:52:53,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:52:53,355 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:52:53,356 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:52:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 275311686, now seen corresponding path program 1 times [2022-03-15 19:52:53,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:53,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428045628] [2022-03-15 19:52:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:53,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:53,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428045628] [2022-03-15 19:52:53,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428045628] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:52:53,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:52:53,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 19:52:53,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755919799] [2022-03-15 19:52:53,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:53,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:53,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 434 states and 1266 transitions. [2022-03-15 19:52:53,585 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:59,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [136782#(< 0 ~n2~0), 136794#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 3 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 136793#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0)), 136801#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 0 ~n2~0))) (or (not (< 0 ~n2~0)) (<= 1 thread2Thread1of1ForFork3_~cond~1))), 136788#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 136800#(<= ~n2~0 0), 136781#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 136789#(< 0 ~n1~0), 136791#(or (< 0 ~n1~0) (< 0 ~n2~0)), 136790#(or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 136787#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 136783#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 136797#(and (or (< 0 ~n1~0) (<= 0 thread3Thread1of1ForFork0_~cond~2)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0))), 136785#(or (not (< 0 ~n2~0)) (< 3 ~n2~0)), 136796#(and (or (<= 0 thread3Thread1of1ForFork0_~cond~2) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (<= thread3Thread1of1ForFork0_~cond~2 (* 256 (div thread3Thread1of1ForFork0_~cond~2 256))) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 136786#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 136784#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 3 ~n2~0)), 136798#(or (<= ~n2~0 0) (< 3 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 136795#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< 3 ~n2~0)), 136799#(or (< 0 ~n1~0) (<= ~n2~0 0) (< 3 ~n2~0)), 136792#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))] [2022-03-15 19:52:59,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:52:59,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:52:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:52:59,907 INFO L87 Difference]: Start difference. First operand 5208 states and 23129 transitions. Second operand has 29 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:53:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:01,875 INFO L93 Difference]: Finished difference Result 8054 states and 33937 transitions. [2022-03-15 19:53:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:53:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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:53:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:01,896 INFO L225 Difference]: With dead ends: 8054 [2022-03-15 19:53:01,897 INFO L226 Difference]: Without dead ends: 7922 [2022-03-15 19:53:01,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 330 SyntacticMatches, 54 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=661, Invalid=2419, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:53:01,898 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 613 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:01,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 98 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:53:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-03-15 19:53:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 5120. [2022-03-15 19:53:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5120 states, 5119 states have (on average 4.443641336198477) internal successors, (22747), 5119 states have internal predecessors, (22747), 0 states have call successors, (0), 0 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:53:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 22747 transitions. [2022-03-15 19:53:02,044 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 22747 transitions. Word has length 29 [2022-03-15 19:53:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:02,045 INFO L470 AbstractCegarLoop]: Abstraction has 5120 states and 22747 transitions. [2022-03-15 19:53:02,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:53:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 22747 transitions. [2022-03-15 19:53:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:53:02,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:02,059 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] [2022-03-15 19:53:02,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 19:53:02,059 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:53:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash 174860831, now seen corresponding path program 3 times [2022-03-15 19:53:02,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:02,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369053422] [2022-03-15 19:53:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:53:02,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:02,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369053422] [2022-03-15 19:53:02,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369053422] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:53:02,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:53:02,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:53:02,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [472440757] [2022-03-15 19:53:02,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:02,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:02,260 INFO L252 McrAutomatonBuilder]: Finished intersection with 390 states and 1109 transitions. [2022-03-15 19:53:02,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:07,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [155158#(< 0 ~n2~0), 155159#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 155167#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 155157#(not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)), 155170#(or (< 0 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 155161#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 155165#(or (< 4 ~n2~0) (<= ~n2~0 3)), 155166#(< 0 ~n1~0), 155175#(or (< 4 ~n2~0) (<= ~n2~0 3) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 155176#(or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 4 ~n2~0) (<= ~n2~0 3)), 155164#(or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 4 ~n2~0) (not (< 3 ~n2~0))), 155172#(and (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 155178#(and (or (not (<= ~n2~0 0)) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (< 0 ~n1~0) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 1))), 155173#(or (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 155160#(or (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 155169#(or (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 155162#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 155177#(or (< 0 ~n1~0) (< 4 ~n2~0) (<= ~n2~0 3)), 155174#(or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 4 ~n2~0) (<= ~n2~0 3) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 155168#(<= ~n2~0 0), 155163#(or (not (< 1 ~n2~0)) (< 2 ~n2~0)), 155171#(or (< 0 ~n1~0) (< 0 ~n2~0))] [2022-03-15 19:53:07,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:53:07,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:07,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:53:07,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:53:07,458 INFO L87 Difference]: Start difference. First operand 5120 states and 22747 transitions. Second operand has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 28 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:53:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:13,201 INFO L93 Difference]: Finished difference Result 14100 states and 59194 transitions. [2022-03-15 19:53:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 19:53:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 28 states have internal predecessors, (240), 0 states have call successors, (0), 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:53:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:13,239 INFO L225 Difference]: With dead ends: 14100 [2022-03-15 19:53:13,239 INFO L226 Difference]: Without dead ends: 13826 [2022-03-15 19:53:13,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 311 SyntacticMatches, 28 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6347 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2675, Invalid=14617, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 19:53:13,242 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1208 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 4994 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 4994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:13,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 98 Invalid, 5313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 4994 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 19:53:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-15 19:53:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 6736. [2022-03-15 19:53:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 4.62746844840386) internal successors, (31166), 6735 states have internal predecessors, (31166), 0 states have call successors, (0), 0 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:53:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 31166 transitions. [2022-03-15 19:53:13,493 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 31166 transitions. Word has length 29 [2022-03-15 19:53:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:13,493 INFO L470 AbstractCegarLoop]: Abstraction has 6736 states and 31166 transitions. [2022-03-15 19:53:13,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 28 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:53:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 31166 transitions. [2022-03-15 19:53:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:53:13,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:13,513 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:53:13,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 19:53:13,514 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:53:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1122616910, now seen corresponding path program 1 times [2022-03-15 19:53:13,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:13,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808274621] [2022-03-15 19:53:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:13,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:13,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808274621] [2022-03-15 19:53:13,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808274621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:13,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322387854] [2022-03-15 19:53:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:13,777 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:53:13,778 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:53:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:13,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:53:13,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:14,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:14,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322387854] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:14,424 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:14,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 19:53:14,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894107528] [2022-03-15 19:53:14,424 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:14,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:14,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 394 states and 1113 transitions. [2022-03-15 19:53:14,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:22,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [183150#(< 0 ~n2~0), 183157#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 183166#(and (or (not (<= ~n2~0 0)) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 1)) (<= ~n2~0 ~n1~0)), 183098#(< 1 ~n1~0), 183156#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 183153#(or (< 0 ~n1~0) (< 0 ~n2~0)), 183165#(and (or (< 1 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))) (or (not (<= ~n2~0 0)) (= thread4Thread1of1ForFork2_~cond~3 0)) (or (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 1))), 183088#(not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 183155#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0)) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0))), 183163#(and (or (< 0 ~n2~0) (< 1 ~n1~0)) (or (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 ~n2~0))), 183158#(and (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0))), 183164#(or (< 1 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 183148#(not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)), 183162#(and (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (< 0 ~n1~0) (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0) (< 0 ~n2~0))), 183168#(or (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 183167#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (<= ~n2~0 1) (< 2 ~n2~0)) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (<= ~n2~0 1) (< 2 ~n2~0))), 183154#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)))), 183160#(or (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 183159#(or (<= ~n2~0 1) (< 2 ~n2~0)), 183152#(or (< 0 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 183106#(or (< 0 ~n2~0) (< 1 ~n1~0)), 183161#(and (or (<= 2 ~n1~0) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0)))), 183149#(or (< 0 (mod thread2Thread1of1ForFork3_~cond~1 256)) (not (= (mod thread4Thread1of1ForFork2_~cond~3 256) 0))), 183151#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))] [2022-03-15 19:53:22,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:53:22,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:22,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:53:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:53:22,077 INFO L87 Difference]: Start difference. First operand 6736 states and 31166 transitions. Second operand has 34 states, 34 states have (on average 7.088235294117647) internal successors, (241), 33 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:53:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:31,695 INFO L93 Difference]: Finished difference Result 14774 states and 64487 transitions. [2022-03-15 19:53:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 19:53:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.088235294117647) internal successors, (241), 33 states have internal predecessors, (241), 0 states have call successors, (0), 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:53:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:31,738 INFO L225 Difference]: With dead ends: 14774 [2022-03-15 19:53:31,738 INFO L226 Difference]: Without dead ends: 14588 [2022-03-15 19:53:31,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 368 SyntacticMatches, 21 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13550 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5298, Invalid=29858, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 19:53:31,740 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 709 mSDsluCounter, 3545 mSDsCounter, 0 mSdLazyCounter, 8424 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 8660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 8424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:31,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 113 Invalid, 8660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 8424 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 19:53:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14588 states. [2022-03-15 19:53:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14588 to 6926. [2022-03-15 19:53:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6926 states, 6925 states have (on average 4.6251263537906135) internal successors, (32029), 6925 states have internal predecessors, (32029), 0 states have call successors, (0), 0 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:53:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6926 states to 6926 states and 32029 transitions. [2022-03-15 19:53:31,974 INFO L78 Accepts]: Start accepts. Automaton has 6926 states and 32029 transitions. Word has length 29 [2022-03-15 19:53:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:31,974 INFO L470 AbstractCegarLoop]: Abstraction has 6926 states and 32029 transitions. [2022-03-15 19:53:31,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.088235294117647) internal successors, (241), 33 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:53:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6926 states and 32029 transitions. [2022-03-15 19:53:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:53:31,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:31,993 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:53:32,009 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:53:32,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:32,194 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:53:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash -503865048, now seen corresponding path program 1 times [2022-03-15 19:53:32,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:32,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130036085] [2022-03-15 19:53:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:32,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:32,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130036085] [2022-03-15 19:53:32,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130036085] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:32,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052400886] [2022-03-15 19:53:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:32,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:32,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:32,396 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:53:32,397 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:53:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:32,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:53:32,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:32,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:33,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052400886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:33,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:33,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-03-15 19:53:33,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349107265] [2022-03-15 19:53:33,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:33,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:33,162 INFO L252 McrAutomatonBuilder]: Finished intersection with 474 states and 1385 transitions. [2022-03-15 19:53:33,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:44,109 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [212281#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 212238#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= 1 ~n1~0) (or (<= 3 ~n1~0) (not (< 1 ~n1~0))))), 212301#(and (or (<= 1 ~n1~0) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n1~0 1))), 212275#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 212278#(< 0 ~n2~0), 212279#(or (< 0 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 212287#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 1 ~n1~0) (< 0 ~n2~0)) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0) (<= 3 ~n1~0) (not (< 1 ~n1~0)))), 212283#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 212292#(or (< 1 ~n2~0) (not (< 0 ~n2~0))), 212286#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= 3 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 212258#(or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= 3 ~n1~0) (not (< 1 ~n1~0))), 212242#(or (<= 3 ~n1~0) (not (< 1 ~n1~0))), 212282#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0)) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0))), 212293#(or (< 1 ~n2~0) (<= ~n2~0 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 212254#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 3 ~n1~0) (not (< 1 ~n1~0))), 212297#(and (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (= thread2Thread1of1ForFork3_~cond~1 1)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (<= ~n1~0 0)))), 212300#(and (or (<= ~n1~0 1) (< 0 ~n2~0)) (or (<= 1 ~n1~0) (< 0 ~n2~0))), 212290#(and (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (<= ~n1~0 0))) (or (= thread2Thread1of1ForFork3_~cond~1 1) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 212299#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 1 ~n2~0) (< 2 ~n1~0) (<= ~n2~0 0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 1 ~n2~0) (< 0 ~n1~0) (<= ~n2~0 0))), 212294#(or (< 1 ~n2~0) (< 0 ~n1~0) (<= ~n2~0 0)), 212274#(not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 212277#(or (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 212285#(and (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0))), 212296#(and (or (= thread2Thread1of1ForFork3_~cond~1 1) (< 0 ~n2~0)) (or (< 0 ~n2~0) (not (<= ~n1~0 0)))), 212288#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0)), 212289#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 1 ~n1~0) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 3 ~n1~0) (not (< 1 ~n1~0)))), 212250#(or (< 0 ~n2~0) (<= 3 ~n1~0) (not (< 1 ~n1~0))), 212302#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 1)) (or (<= 1 ~n1~0) (< 1 ~n2~0) (not (< 0 ~n2~0)))), 212298#(and (or (< 1 ~n2~0) (= thread2Thread1of1ForFork3_~cond~1 1) (not (< 0 ~n2~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (not (<= ~n1~0 0)))), 212246#(or (<= 3 ~n1~0) (not (<= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 1 ~n1~0))), 212276#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 212280#(or (<= 1 ~n1~0) (< 0 ~n2~0)), 212291#(and (or (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n1~0 1))), 212295#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 0 ~n2~0)))), 212284#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))] [2022-03-15 19:53:44,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:53:44,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:53:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:53:44,111 INFO L87 Difference]: Start difference. First operand 6926 states and 32029 transitions. Second operand has 45 states, 45 states have (on average 6.977777777777778) internal successors, (314), 44 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:54:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:00,605 INFO L93 Difference]: Finished difference Result 27938 states and 120159 transitions. [2022-03-15 19:54:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2022-03-15 19:54:00,606 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.977777777777778) internal successors, (314), 44 states have internal predecessors, (314), 0 states have call successors, (0), 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:54:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:00,688 INFO L225 Difference]: With dead ends: 27938 [2022-03-15 19:54:00,689 INFO L226 Difference]: Without dead ends: 27650 [2022-03-15 19:54:00,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 400 SyntacticMatches, 61 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30093 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=9069, Invalid=64101, Unknown=0, NotChecked=0, Total=73170 [2022-03-15 19:54:00,693 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2915 mSDsluCounter, 6013 mSDsCounter, 0 mSdLazyCounter, 12050 mSolverCounterSat, 961 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2915 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 13011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 961 IncrementalHoareTripleChecker+Valid, 12050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:00,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2915 Valid, 48 Invalid, 13011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [961 Valid, 12050 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-03-15 19:54:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27650 states. [2022-03-15 19:54:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27650 to 9846. [2022-03-15 19:54:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9846 states, 9845 states have (on average 4.800914169629253) internal successors, (47265), 9845 states have internal predecessors, (47265), 0 states have call successors, (0), 0 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:54:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 47265 transitions. [2022-03-15 19:54:01,159 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 47265 transitions. Word has length 29 [2022-03-15 19:54:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:01,160 INFO L470 AbstractCegarLoop]: Abstraction has 9846 states and 47265 transitions. [2022-03-15 19:54:01,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.977777777777778) internal successors, (314), 44 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:54:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 47265 transitions. [2022-03-15 19:54:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:54:01,182 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:01,182 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:54:01,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:01,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:01,383 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:54:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -528071245, now seen corresponding path program 1 times [2022-03-15 19:54:01,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:01,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686546655] [2022-03-15 19:54:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:01,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:01,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686546655] [2022-03-15 19:54:01,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686546655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:01,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651647905] [2022-03-15 19:54:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:01,648 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:54:01,648 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:54:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:01,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:54:01,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:02,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:02,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651647905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:02,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:02,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 10 [2022-03-15 19:54:02,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379317788] [2022-03-15 19:54:02,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:02,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:02,622 INFO L252 McrAutomatonBuilder]: Finished intersection with 386 states and 1097 transitions. [2022-03-15 19:54:02,622 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:17,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [260553#(and (or (not (< 1 ~n2~0)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0) (* 4294967295 (mod ~p2~0 4294967296))) 4294967296) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (< 1 ~n2~0) (= (mod (+ (* 4294967295 ~p1~0) (mod ~p2~0 4294967296)) 4294967296) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 260555#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0)) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296) 1)) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n1~0) (< (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296) 1))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n1~0))), 260406#(or (and (< 1 ~n2~0) (= (mod (+ ~p1~0 (* 4294967294 ~m~0) (* 4294967295 (mod ~p2~0 4294967296))) 4294967296) 0)) (and (not (< 1 ~n2~0)) (= (mod (+ (* 4294967295 ~p1~0) (mod ~p2~0 4294967296)) 4294967296) 0))), 260558#(and (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 1 ~n1~0) (<= 2 ~n2~0)) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296) (* (- 1) ~p2~0)) 4294967296) 4294967296) ~p2~0)) (<= 3 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 2 ~n2~0) (<= 3 ~n1~0) (not (< 1 ~n1~0))) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (<= 1 ~n1~0) (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* 2 ~m~0) ~p2~0 (* (div (+ (* (- 2) ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296) (* (- 1) ~p2~0)) 4294967296) 4294967296))))), 260556#(and (or (< (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296) 1)) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (<= (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0)) (< 2 ~n1~0) (not (< 1 ~n1~0)))), 260554#(and (or (< 0 ~n1~0) (< (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296) 1))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (< 0 ~n1~0))), 260552#(and (or (< (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296) 1)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))) (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)))), 260557#(and (or (< 1 ~n2~0) (< 0 ~n1~0) (= (mod (+ (* 4294967295 ~p1~0) (mod ~p2~0 4294967296)) 4294967296) 0)) (or (< 0 ~n1~0) (not (< 1 ~n2~0)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0) (* 4294967295 (mod ~p2~0 4294967296))) 4294967296) 0))), 260559#(and (or (<= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296) (* (- 1) ~p2~0)) 4294967296) 4294967296) ~p2~0)) (<= ~n1~0 1) (<= 3 ~n1~0)) (or (<= 2 ~n2~0) (<= ~n1~0 1) (<= 3 ~n1~0)))] [2022-03-15 19:54:17,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:54:17,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:54:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:54:17,208 INFO L87 Difference]: Start difference. First operand 9846 states and 47265 transitions. Second operand has 18 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:21,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:54:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:25,086 INFO L93 Difference]: Finished difference Result 14315 states and 64067 transitions. [2022-03-15 19:54:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:54:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:54:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:25,127 INFO L225 Difference]: With dead ends: 14315 [2022-03-15 19:54:25,128 INFO L226 Difference]: Without dead ends: 14162 [2022-03-15 19:54:25,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 305 SyntacticMatches, 96 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:54:25,129 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 354 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:25,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 37 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-03-15 19:54:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2022-03-15 19:54:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 9968. [2022-03-15 19:54:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 4.790207685361693) internal successors, (47744), 9967 states have internal predecessors, (47744), 0 states have call successors, (0), 0 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:54:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 47744 transitions. [2022-03-15 19:54:25,454 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 47744 transitions. Word has length 29 [2022-03-15 19:54:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:25,454 INFO L470 AbstractCegarLoop]: Abstraction has 9968 states and 47744 transitions. [2022-03-15 19:54:25,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 47744 transitions. [2022-03-15 19:54:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:25,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:25,474 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] [2022-03-15 19:54:25,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:54:25,675 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:54:25,675 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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:54:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2085382365, now seen corresponding path program 2 times [2022-03-15 19:54:25,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:25,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394181432] [2022-03-15 19:54:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:25,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:25,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394181432] [2022-03-15 19:54:25,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394181432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:25,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698498802] [2022-03-15 19:54:25,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:25,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:25,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:25,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:54:25,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:25,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:54:25,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:26,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:26,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698498802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:26,932 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:26,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2022-03-15 19:54:26,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328600283] [2022-03-15 19:54:26,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:26,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:27,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 586 states and 1707 transitions. [2022-03-15 19:54:27,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:40,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [295060#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 295073#(or (< 0 ~n2~0) (<= 2 ~n1~0)), 295080#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1) (not (< 1 ~n2~0)) (< 2 ~n2~0))), 295064#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 295081#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0) (<= 2 ~n1~0)), 295058#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 295076#(or (< 1 ~n2~0) (< 0 ~n1~0) (<= ~n2~0 0)), 295082#(and (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (<= ~n2~0 1) (< 2 ~n2~0)) (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (<= ~n2~0 1) (< 2 ~n2~0))), 295075#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 2 ~n1~0)), 295061#(< 0 ~n2~0), 295071#(and (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0))), 295072#(or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= 2 ~n1~0)), 295079#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 295078#(or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= 2 ~n1~0)), 295009#(or (< 0 ~n1~0) (< 0 ~n2~0)), 295069#(or (<= ~n2~0 1) (< 2 ~n2~0)), 294996#(or (not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)) (< 0 ~n2~0)), 295074#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0)), 295077#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= 1 thread2Thread1of1ForFork3_~cond~1)) (or (< 1 ~n2~0) (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (not (< 0 ~n2~0)))), 295066#(or (< 1 ~n2~0) (<= ~n2~0 0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 295059#(or (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))), 295062#(and (or (<= 1 thread2Thread1of1ForFork3_~cond~1) (< 0 ~n2~0)) (or (<= (div thread2Thread1of1ForFork3_~cond~1 256) 0) (< 0 ~n2~0))), 294988#(not (<= (mod thread2Thread1of1ForFork3_~cond~1 256) 0)), 295083#(or (< 0 ~n1~0) (<= ~n2~0 1) (< 2 ~n2~0)), 295057#(not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 295065#(or (< 1 ~n2~0) (not (< 0 ~n2~0))), 295068#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 295067#(or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 1 ~n2~0)) (< 2 ~n2~0)), 295070#(or (<= ~n2~0 1) (< 2 ~n2~0) (not (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0))), 295063#(or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)), 295084#(or (<= ~n2~0 1) (< 2 ~n2~0) (<= 2 ~n1~0))] [2022-03-15 19:54:40,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:54:40,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:40,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:54:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2499, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:54:40,304 INFO L87 Difference]: Start difference. First operand 9968 states and 47744 transitions. Second operand has 39 states, 39 states have (on average 8.717948717948717) internal successors, (340), 38 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:52,681 INFO L93 Difference]: Finished difference Result 39644 states and 173153 transitions. [2022-03-15 19:54:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2022-03-15 19:54:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.717948717948717) internal successors, (340), 38 states have internal predecessors, (340), 0 states have call successors, (0), 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:54:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:52,804 INFO L225 Difference]: With dead ends: 39644 [2022-03-15 19:54:52,804 INFO L226 Difference]: Without dead ends: 38516 [2022-03-15 19:54:52,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 465 SyntacticMatches, 105 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26689 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=8418, Invalid=51852, Unknown=0, NotChecked=0, Total=60270 [2022-03-15 19:54:52,807 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2586 mSDsluCounter, 4245 mSDsCounter, 0 mSdLazyCounter, 8100 mSolverCounterSat, 993 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2586 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 993 IncrementalHoareTripleChecker+Valid, 8100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:52,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2586 Valid, 90 Invalid, 9093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [993 Valid, 8100 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 19:54:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38516 states. [2022-03-15 19:54:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38516 to 14578. [2022-03-15 19:54:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14578 states, 14577 states have (on average 4.857789668656102) internal successors, (70812), 14577 states have internal predecessors, (70812), 0 states have call successors, (0), 0 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:54:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14578 states to 14578 states and 70812 transitions. [2022-03-15 19:54:53,617 INFO L78 Accepts]: Start accepts. Automaton has 14578 states and 70812 transitions. Word has length 31 [2022-03-15 19:54:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:53,618 INFO L470 AbstractCegarLoop]: Abstraction has 14578 states and 70812 transitions. [2022-03-15 19:54:53,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.717948717948717) internal successors, (340), 38 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:54:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14578 states and 70812 transitions. [2022-03-15 19:54:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:53,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:53,649 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:54:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:53,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:54:53,850 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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:54:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1081209724, now seen corresponding path program 1 times [2022-03-15 19:54:53,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:53,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918539570] [2022-03-15 19:54:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:54,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:54,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918539570] [2022-03-15 19:54:54,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918539570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:54,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477583215] [2022-03-15 19:54:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:54,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:54,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:54,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:54:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:54,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:54:54,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:57,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:59,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477583215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:59,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:59,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2022-03-15 19:54:59,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913861843] [2022-03-15 19:54:59,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:59,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:59,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 578 states and 1702 transitions. [2022-03-15 19:54:59,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:08,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [364493#(and (or (<= 1 ~n1~0) (< 1 ~n2~0) (not (< 0 ~n2~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (not (< 0 ~n2~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1)))), 364473#(and (or (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296))))), 364492#(and (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1))) (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) (* 2 ~m~0) ~p1~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) (* 2 ~m~0) ~p1~0) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2)) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~m~0 ~p1~0) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (<= ~n1~0 1) (< 2 ~n1~0)) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (< 1 ~n1~0)) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 1) (< 2 ~n1~0) (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~m~0 ~p1~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (< 1 ~n1~0))), 364474#(and (or (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0))), 364491#(and (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< 1 ~n2~0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 0))), 364488#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 2 ~n1~0) (< 0 ~n2~0) (not (< 1 ~n1~0))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (< (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0) (< 1 ~n1~0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 2 ~n1~0) (< 0 ~n2~0) (< (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (not (< 1 ~n1~0))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) (* 2 ~m~0) ~p1~0) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (< 2 ~n1~0) (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~m~0 ~p1~0)) (not (< 1 ~n1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) (* 2 ~m~0) ~p1~0))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n1~0 0) (< 0 ~n2~0) (< 1 ~n1~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (< 1 ~n1~0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~m~0 ~p1~0) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0)) (< 1 ~n1~0))), 364481#(and (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 0 ~n2~0)) (or (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= 1 ~n1~0) (< 0 ~n2~0))), 364479#(and (or (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)))), 364484#(and (or (<= ~n1~0 0) (< 0 ~n2~0) (< 1 ~n1~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0) (< 1 ~n1~0)) (or (< 0 ~n1~0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (< 0 ~n2~0) (< (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2)) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0)) (or (< 2 ~n1~0) (< 0 ~n2~0) (< (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (not (< 1 ~n1~0))) (or (< 0 ~n2~0) (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 2 ~n1~0) (< 0 ~n2~0) (not (< 1 ~n1~0)))), 364487#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n1~0 0) (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (not (< 0 ~n1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= ~n1~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0))), 364476#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1)))), 364490#(and (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n2~0 0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= 1 ~n1~0) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 0 ~n2~0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n2~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= ~n1~0 1))), 364482#(and (or (<= ~n1~0 0) (< 1 ~n1~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2)) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1))) (or (< 2 ~n1~0) (< (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (not (< 1 ~n1~0))) (or (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (< 0 ~n1~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 1 ~n1~0))), 364494#(and (or (< 1 ~n2~0) (not (< 0 ~n2~0)) (<= ~n1~0 1)) (or (<= 1 ~n1~0) (< 1 ~n2~0) (not (< 0 ~n2~0))) (or (< 1 ~n2~0) (<= ~n2~0 0) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (<= ~n2~0 0))), 364489#(and (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= 1 ~n1~0) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0)) (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 0 ~n2~0))), 364483#(and (or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (<= ~n1~0 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 1 ~n1~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n1~0 2) (<= (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296))) (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)))) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0)) (< 1 ~n1~0)) (or (<= (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0) (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 2 ~n1~0) (not (< 1 ~n1~0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< 2 ~n1~0) (< (+ (* 2 ~m~0) ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~m~0) ~p1~0) 4294967296) 4294967296) ~p2~0 1)) (not (< 1 ~n1~0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< (+ ~p1~0 (* 3 ~m~0) (* (div ~p2~0 4294967296) 4294967296)) (+ ~p2~0 (* 4294967296 (div (+ ~p1~0 (* 3 ~m~0)) 4294967296)) 1)) (<= ~n1~0 2))), 364485#(and (or (<= 1 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (+ ~m~0 ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) (* (div (+ (* (div ~p1~0 4294967296) (- 4294967296)) ~m~0 ~p1~0 (* (- 1) ~p2~0)) 4294967296) 4294967296) ~p2~0)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= ~n1~0 1))), 364478#(and (or (< 0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (not (< 0 ~n1~0))) (or (<= ~n1~0 0) (not (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1)))), 364477#(and (or (<= ~n1~0 0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1))) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0))) (or (< 0 ~n1~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296))))), 364486#(and (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (< 0 ~n2~0)) (or (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))) (or (<= ~n1~0 1) (< 0 ~n2~0)) (or (<= 1 ~n1~0) (< 0 ~n2~0))), 364475#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0)) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0) (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0))) (or (< 1 ~n2~0) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (not (< 0 ~n2~0)) (< (+ (* (div (+ ~m~0 ~p2~0) 4294967296) 4294967296) ~p1~0) (+ (* (div ~p1~0 4294967296) 4294967296) ~m~0 ~p2~0 1)))), 364480#(and (or (< 0 ~n1~0) (< 0 ~n2~0) (<= (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0) (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)))) (or (< 0 ~n1~0) (< (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0 1)) (< 0 ~n2~0)) (or (<= (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0) (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296))) (not (< 0 ~n1~0)) (< 0 ~n2~0)) (or (<= ~n1~0 0) (< 0 ~n2~0) (< (+ ~m~0 ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~p1~0) 4294967296) 4294967296) ~p2~0 1))))] [2022-03-15 19:56:08,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:56:08,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:56:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1802, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:56:08,100 INFO L87 Difference]: Start difference. First operand 14578 states and 70812 transitions. Second operand has 31 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:56:14,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:22,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:24,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:26,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:28,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:43,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:56:45,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:57:06,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:57:08,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:57:33,561 WARN L228 SmtUtils]: Spent 23.08s on a formula simplification. DAG size of input: 122 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:57:38,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:57:48,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:57:51,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:11,378 WARN L228 SmtUtils]: Spent 14.66s on a formula simplification. DAG size of input: 128 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:58:13,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:15,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:16,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:18,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:25,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:27,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:36,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:49,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:58:56,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:59:04,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:59:06,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:59:09,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:59:11,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:59:41,031 WARN L228 SmtUtils]: Spent 17.80s on a formula simplification. DAG size of input: 122 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:00:05,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:07,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:09,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:18,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:20,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:22,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:27,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:29,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:33,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:36,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:43,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:45,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:00:55,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:12,910 WARN L228 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 91 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:01:17,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:19,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:21,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:25,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:27,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:29,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:30,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:32,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:35,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:37,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:50,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:52,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:01:54,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 20:02:23,540 WARN L228 SmtUtils]: Spent 15.03s on a formula simplification. DAG size of input: 107 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:02:28,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:02:38,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-03-15 20:02:55,180 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:02:55,180 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:02:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 20:02:55,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 561 SyntacticMatches, 18 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 290.9s TimeCoverageRelationStatistics Valid=1326, Invalid=7204, Unknown=26, NotChecked=0, Total=8556 [2022-03-15 20:02:55,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 629 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 230 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:55,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 0 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1421 Invalid, 50 Unknown, 0 Unchecked, 122.0s Time] [2022-03-15 20:02:55,486 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 20:02:55,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:02:55,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:02:55,687 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. [2022-03-15 20:02:55,688 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 20:02:55,688 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 20:02:55,688 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 20:02:55,688 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 20:02:55,690 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:55,691 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:02:55,691 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:02:55,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:02:55 BasicIcfg [2022-03-15 20:02:55,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:02:55,694 INFO L158 Benchmark]: Toolchain (without parser) took 791774.85ms. Allocated memory was 200.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 145.4MB in the beginning and 508.1MB in the end (delta: -362.7MB). Peak memory consumption was 646.4MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,694 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:02:55,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.77ms. Allocated memory was 200.3MB in the beginning and 278.9MB in the end (delta: 78.6MB). Free memory was 145.3MB in the beginning and 250.6MB in the end (delta: -105.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 278.9MB. Free memory was 250.6MB in the beginning and 248.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,695 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 278.9MB. Free memory was 248.5MB in the beginning and 247.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,695 INFO L158 Benchmark]: RCFGBuilder took 458.29ms. Allocated memory is still 278.9MB. Free memory was 247.4MB in the beginning and 229.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,695 INFO L158 Benchmark]: TraceAbstraction took 790919.33ms. Allocated memory was 278.9MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 229.1MB in the beginning and 508.1MB in the end (delta: -279.0MB). Peak memory consumption was 650.6MB. Max. memory is 8.0GB. [2022-03-15 20:02:55,696 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.11ms. Allocated memory is still 200.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.77ms. Allocated memory was 200.3MB in the beginning and 278.9MB in the end (delta: 78.6MB). Free memory was 145.3MB in the beginning and 250.6MB in the end (delta: -105.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 278.9MB. Free memory was 250.6MB in the beginning and 248.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 278.9MB. Free memory was 248.5MB in the beginning and 247.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 458.29ms. Allocated memory is still 278.9MB. Free memory was 247.4MB in the beginning and 229.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 790919.33ms. Allocated memory was 278.9MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 229.1MB in the beginning and 508.1MB in the end (delta: -279.0MB). Peak memory consumption was 650.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 138 PlacesBefore, 47 PlacesAfterwards, 135 TransitionsBefore, 38 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 110 TotalNumberOfCompositions, 3596 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2698, positive: 2634, positive conditional: 0, positive unconditional: 2634, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 937, positive: 923, positive conditional: 0, positive unconditional: 923, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2698, positive: 1711, positive conditional: 0, positive unconditional: 1711, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 937, unknown conditional: 0, unknown unconditional: 937] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14578states) and FLOYD_HOARE automaton (currently 52 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 790.8s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 570.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 67 mSolverCounterUnknown, 14596 SdHoareTripleChecker+Valid, 230.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14596 mSDsluCounter, 2013 SdHoareTripleChecker+Invalid, 223.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30914 mSDsCounter, 4183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60571 IncrementalHoareTripleChecker+Invalid, 64821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4183 mSolverCounterUnsat, 370 mSDtfsCounter, 60571 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8592 GetRequests, 6249 SyntacticMatches, 783 SemanticMatches, 1559 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101674 ImplicationChecksByTransitivity, 354.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14578occurred in iteration=16, InterpolantAutomatonStates: 1228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 95259 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1018 ConstructedInterpolants, 15 QuantifiedInterpolants, 17312 SizeOfPredicates, 103 NumberOfNonLiveVariables, 2186 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 25/79 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown