/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-06 16:18:15,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-06 16:18:15,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-06 16:18:15,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-06 16:18:15,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-06 16:18:15,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-06 16:18:15,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-06 16:18:15,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-06 16:18:15,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-06 16:18:15,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-06 16:18:15,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-06 16:18:15,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-06 16:18:15,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-06 16:18:15,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-06 16:18:15,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-06 16:18:15,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-06 16:18:15,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-06 16:18:15,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-06 16:18:15,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-06 16:18:15,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-06 16:18:15,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-06 16:18:15,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-06 16:18:15,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-06 16:18:15,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-06 16:18:15,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-06 16:18:15,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-06 16:18:15,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-06 16:18:15,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-06 16:18:15,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-06 16:18:15,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-06 16:18:15,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-06 16:18:15,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-06 16:18:15,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-06 16:18:15,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-06 16:18:15,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-06 16:18:15,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-06 16:18:15,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-06 16:18:15,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-06 16:18:15,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-06 16:18:15,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-06 16:18:15,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-06 16:18:15,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-06 16:18:15,190 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-06 16:18:15,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-06 16:18:15,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-06 16:18:15,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-06 16:18:15,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-06 16:18:15,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-06 16:18:15,192 INFO L138 SettingsManager]: * Use SBE=true [2021-10-06 16:18:15,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-06 16:18:15,193 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-06 16:18:15,193 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-06 16:18:15,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-06 16:18:15,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-06 16:18:15,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-06 16:18:15,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-06 16:18:15,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-06 16:18:15,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-06 16:18:15,194 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-06 16:18:15,195 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-06 16:18:15,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-06 16:18:15,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-06 16:18:15,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-06 16:18:15,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-06 16:18:15,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-06 16:18:15,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-06 16:18:15,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:18:15,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-06 16:18:15,197 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-06 16:18:15,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/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 [2021-10-06 16:18:15,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-06 16:18:15,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-06 16:18:15,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-06 16:18:15,633 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-06 16:18:15,636 INFO L275 PluginConnector]: CDTParser initialized [2021-10-06 16:18:15,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c [2021-10-06 16:18:15,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2daedc335/41c2c1782c0b47178ba761fd8656a8e2/FLAGc7af79375 [2021-10-06 16:18:16,300 INFO L306 CDTParser]: Found 1 translation units. [2021-10-06 16:18:16,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c [2021-10-06 16:18:16,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2daedc335/41c2c1782c0b47178ba761fd8656a8e2/FLAGc7af79375 [2021-10-06 16:18:16,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2daedc335/41c2c1782c0b47178ba761fd8656a8e2 [2021-10-06 16:18:16,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-06 16:18:16,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-06 16:18:16,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-06 16:18:16,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-06 16:18:16,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-06 16:18:16,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:18:16" (1/1) ... [2021-10-06 16:18:16,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a870709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:16, skipping insertion in model container [2021-10-06 16:18:16,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:18:16" (1/1) ... [2021-10-06 16:18:16,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-06 16:18:16,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-06 16:18:16,987 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c[2476,2489] [2021-10-06 16:18:16,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:18:17,005 INFO L203 MainTranslator]: Completed pre-run [2021-10-06 16:18:17,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c[2476,2489] [2021-10-06 16:18:17,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:18:17,076 INFO L208 MainTranslator]: Completed translation [2021-10-06 16:18:17,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17 WrapperNode [2021-10-06 16:18:17,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-06 16:18:17,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-06 16:18:17,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-06 16:18:17,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-06 16:18:17,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-06 16:18:17,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-06 16:18:17,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-06 16:18:17,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-06 16:18:17,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-06 16:18:17,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-06 16:18:17,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-06 16:18:17,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-06 16:18:17,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (1/1) ... [2021-10-06 16:18:17,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:18:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:18:17,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-06 16:18:17,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-06 16:18:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-06 16:18:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-06 16:18:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-06 16:18:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-06 16:18:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-06 16:18:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-06 16:18:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-06 16:18:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-06 16:18:17,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-06 16:18:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-06 16:18:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-06 16:18:17,257 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-06 16:18:17,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-06 16:18:17,725 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-06 16:18:17,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:18:17 BoogieIcfgContainer [2021-10-06 16:18:17,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-06 16:18:17,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-06 16:18:17,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-06 16:18:17,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-06 16:18:17,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 04:18:16" (1/3) ... [2021-10-06 16:18:17,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a37a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:18:17, skipping insertion in model container [2021-10-06 16:18:17,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:18:17" (2/3) ... [2021-10-06 16:18:17,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a37a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:18:17, skipping insertion in model container [2021-10-06 16:18:17,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:18:17" (3/3) ... [2021-10-06 16:18:17,740 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-2.wvr.c [2021-10-06 16:18:17,751 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-06 16:18:17,752 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-06 16:18:17,768 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-10-06 16:18:17,772 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-06 16:18:17,836 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,837 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,837 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,837 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,837 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,838 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,838 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,838 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,838 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,840 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,840 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,840 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,840 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,841 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,841 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,841 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,844 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,844 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,845 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,846 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,846 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,846 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,847 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,847 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,849 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,849 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,849 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,849 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,850 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,850 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,850 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,855 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,855 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,855 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,856 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,856 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,856 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,858 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,859 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,859 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,859 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,859 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,859 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,860 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,860 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,860 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,860 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,860 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,861 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,861 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,861 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,862 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,862 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,862 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,863 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,864 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,864 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,864 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,865 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,865 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,865 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,866 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,866 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,866 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,868 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,868 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,884 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,892 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:18:17,904 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-06 16:18:17,972 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-06 16:18:17,984 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-06 16:18:17,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-10-06 16:18:18,009 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-06 16:18:18,022 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 146 transitions, 308 flow [2021-10-06 16:18:18,026 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 146 transitions, 308 flow [2021-10-06 16:18:18,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 146 transitions, 308 flow [2021-10-06 16:18:18,111 INFO L129 PetriNetUnfolder]: 8/144 cut-off events. [2021-10-06 16:18:18,111 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-06 16:18:18,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 8/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2021-10-06 16:18:18,123 INFO L116 LiptonReduction]: Number of co-enabled transitions 3672 [2021-10-06 16:18:22,703 INFO L131 LiptonReduction]: Checked pairs total: 10115 [2021-10-06 16:18:22,703 INFO L133 LiptonReduction]: Total number of compositions: 133 [2021-10-06 16:18:22,712 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 45 transitions, 106 flow [2021-10-06 16:18:22,759 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 566 states, 542 states have (on average 2.6752767527675276) internal successors, (1450), 565 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 542 states have (on average 2.6752767527675276) internal successors, (1450), 565 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 16:18:22,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:22,771 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 16:18:22,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 532035484, now seen corresponding path program 1 times [2021-10-06 16:18:22,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:22,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171137070] [2021-10-06 16:18:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:22,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:22,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:22,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171137070] [2021-10-06 16:18:22,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171137070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:22,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:22,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:18:23,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11709319] [2021-10-06 16:18:23,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:23,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:23,024 INFO L87 Difference]: Start difference. First operand has 566 states, 542 states have (on average 2.6752767527675276) internal successors, (1450), 565 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:23,122 INFO L93 Difference]: Finished difference Result 636 states and 1591 transitions. [2021-10-06 16:18:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:18:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-06 16:18:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:23,145 INFO L225 Difference]: With dead ends: 636 [2021-10-06 16:18:23,145 INFO L226 Difference]: Without dead ends: 636 [2021-10-06 16:18:23,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-10-06 16:18:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2021-10-06 16:18:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 612 states have (on average 2.599673202614379) internal successors, (1591), 635 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1591 transitions. [2021-10-06 16:18:23,243 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1591 transitions. Word has length 5 [2021-10-06 16:18:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:23,244 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 1591 transitions. [2021-10-06 16:18:23,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1591 transitions. [2021-10-06 16:18:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 16:18:23,245 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:23,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 16:18:23,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-06 16:18:23,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 532035381, now seen corresponding path program 1 times [2021-10-06 16:18:23,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:23,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745466818] [2021-10-06 16:18:23,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:23,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:23,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:23,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745466818] [2021-10-06 16:18:23,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745466818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:23,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:23,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:18:23,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719110137] [2021-10-06 16:18:23,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:23,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:23,324 INFO L87 Difference]: Start difference. First operand 636 states and 1591 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:23,391 INFO L93 Difference]: Finished difference Result 660 states and 1613 transitions. [2021-10-06 16:18:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:18:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-06 16:18:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:23,400 INFO L225 Difference]: With dead ends: 660 [2021-10-06 16:18:23,400 INFO L226 Difference]: Without dead ends: 660 [2021-10-06 16:18:23,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-10-06 16:18:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 636. [2021-10-06 16:18:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 612 states have (on average 2.5408496732026142) internal successors, (1555), 635 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1555 transitions. [2021-10-06 16:18:23,449 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1555 transitions. Word has length 5 [2021-10-06 16:18:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:23,449 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 1555 transitions. [2021-10-06 16:18:23,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1555 transitions. [2021-10-06 16:18:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 16:18:23,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:23,450 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:23,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-06 16:18:23,451 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 179302097, now seen corresponding path program 1 times [2021-10-06 16:18:23,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:23,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604848319] [2021-10-06 16:18:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:23,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:23,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:23,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604848319] [2021-10-06 16:18:23,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604848319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:23,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:23,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:18:23,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668181069] [2021-10-06 16:18:23,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:18:23,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:18:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:23,524 INFO L87 Difference]: Start difference. First operand 636 states and 1555 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:23,615 INFO L93 Difference]: Finished difference Result 696 states and 1722 transitions. [2021-10-06 16:18:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-06 16:18:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-06 16:18:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:23,621 INFO L225 Difference]: With dead ends: 696 [2021-10-06 16:18:23,621 INFO L226 Difference]: Without dead ends: 696 [2021-10-06 16:18:23,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-06 16:18:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-10-06 16:18:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 672. [2021-10-06 16:18:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 648 states have (on average 2.567901234567901) internal successors, (1664), 671 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1664 transitions. [2021-10-06 16:18:23,647 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1664 transitions. Word has length 7 [2021-10-06 16:18:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:23,647 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1664 transitions. [2021-10-06 16:18:23,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1664 transitions. [2021-10-06 16:18:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 16:18:23,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:23,649 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:23,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-06 16:18:23,649 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 179301994, now seen corresponding path program 1 times [2021-10-06 16:18:23,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:23,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494857531] [2021-10-06 16:18:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:23,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:23,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:23,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494857531] [2021-10-06 16:18:23,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494857531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:23,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:23,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:18:23,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347791824] [2021-10-06 16:18:23,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:18:23,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:18:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:23,700 INFO L87 Difference]: Start difference. First operand 672 states and 1664 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:23,775 INFO L93 Difference]: Finished difference Result 660 states and 1609 transitions. [2021-10-06 16:18:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-06 16:18:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-06 16:18:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:23,781 INFO L225 Difference]: With dead ends: 660 [2021-10-06 16:18:23,781 INFO L226 Difference]: Without dead ends: 660 [2021-10-06 16:18:23,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-06 16:18:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-10-06 16:18:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 624. [2021-10-06 16:18:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 600 states have (on average 2.533333333333333) internal successors, (1520), 623 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1520 transitions. [2021-10-06 16:18:23,810 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1520 transitions. Word has length 7 [2021-10-06 16:18:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:23,810 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 1520 transitions. [2021-10-06 16:18:23,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1520 transitions. [2021-10-06 16:18:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-06 16:18:23,814 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:23,814 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:23,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-06 16:18:23,815 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1861010723, now seen corresponding path program 1 times [2021-10-06 16:18:23,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:23,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134331472] [2021-10-06 16:18:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:23,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:23,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:23,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134331472] [2021-10-06 16:18:23,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134331472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:23,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:23,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-06 16:18:23,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062641570] [2021-10-06 16:18:23,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:18:23,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:18:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:18:23,901 INFO L87 Difference]: Start difference. First operand 624 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,001 INFO L93 Difference]: Finished difference Result 686 states and 1688 transitions. [2021-10-06 16:18:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-06 16:18:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-10-06 16:18:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,007 INFO L225 Difference]: With dead ends: 686 [2021-10-06 16:18:24,007 INFO L226 Difference]: Without dead ends: 686 [2021-10-06 16:18:24,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-06 16:18:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-06 16:18:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 654. [2021-10-06 16:18:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 2.545886075949367) internal successors, (1609), 653 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1609 transitions. [2021-10-06 16:18:24,031 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1609 transitions. Word has length 9 [2021-10-06 16:18:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,032 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 1609 transitions. [2021-10-06 16:18:24,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1609 transitions. [2021-10-06 16:18:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-06 16:18:24,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,033 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-06 16:18:24,034 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1861010662, now seen corresponding path program 1 times [2021-10-06 16:18:24,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907522861] [2021-10-06 16:18:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907522861] [2021-10-06 16:18:24,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907522861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:18:24,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647615263] [2021-10-06 16:18:24,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:18:24,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:18:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:24,081 INFO L87 Difference]: Start difference. First operand 654 states and 1609 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,165 INFO L93 Difference]: Finished difference Result 884 states and 2146 transitions. [2021-10-06 16:18:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-06 16:18:24,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-10-06 16:18:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,172 INFO L225 Difference]: With dead ends: 884 [2021-10-06 16:18:24,172 INFO L226 Difference]: Without dead ends: 884 [2021-10-06 16:18:24,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-06 16:18:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-06 16:18:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 666. [2021-10-06 16:18:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 646 states have (on average 2.5309597523219813) internal successors, (1635), 665 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1635 transitions. [2021-10-06 16:18:24,209 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1635 transitions. Word has length 9 [2021-10-06 16:18:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,210 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 1635 transitions. [2021-10-06 16:18:24,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1635 transitions. [2021-10-06 16:18:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-06 16:18:24,214 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-06 16:18:24,215 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2030820707, now seen corresponding path program 1 times [2021-10-06 16:18:24,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520585638] [2021-10-06 16:18:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520585638] [2021-10-06 16:18:24,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520585638] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:18:24,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498430444] [2021-10-06 16:18:24,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:24,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:24,285 INFO L87 Difference]: Start difference. First operand 666 states and 1635 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,312 INFO L93 Difference]: Finished difference Result 594 states and 1443 transitions. [2021-10-06 16:18:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:18:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-06 16:18:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,317 INFO L225 Difference]: With dead ends: 594 [2021-10-06 16:18:24,317 INFO L226 Difference]: Without dead ends: 590 [2021-10-06 16:18:24,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2021-10-06 16:18:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2021-10-06 16:18:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 578 states have (on average 2.486159169550173) internal successors, (1437), 589 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1437 transitions. [2021-10-06 16:18:24,338 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1437 transitions. Word has length 10 [2021-10-06 16:18:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,339 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 1437 transitions. [2021-10-06 16:18:24,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1437 transitions. [2021-10-06 16:18:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-06 16:18:24,340 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,340 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-06 16:18:24,341 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1927520758, now seen corresponding path program 1 times [2021-10-06 16:18:24,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294584328] [2021-10-06 16:18:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294584328] [2021-10-06 16:18:24,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294584328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-06 16:18:24,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056340336] [2021-10-06 16:18:24,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:18:24,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:18:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:24,439 INFO L87 Difference]: Start difference. First operand 590 states and 1437 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,519 INFO L93 Difference]: Finished difference Result 666 states and 1636 transitions. [2021-10-06 16:18:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-06 16:18:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-06 16:18:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,525 INFO L225 Difference]: With dead ends: 666 [2021-10-06 16:18:24,525 INFO L226 Difference]: Without dead ends: 666 [2021-10-06 16:18:24,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-06 16:18:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-06 16:18:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 626. [2021-10-06 16:18:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 614 states have (on average 2.509771986970684) internal successors, (1541), 625 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1541 transitions. [2021-10-06 16:18:24,547 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1541 transitions. Word has length 12 [2021-10-06 16:18:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,548 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 1541 transitions. [2021-10-06 16:18:24,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1541 transitions. [2021-10-06 16:18:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-06 16:18:24,550 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-06 16:18:24,550 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1927520655, now seen corresponding path program 1 times [2021-10-06 16:18:24,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993143601] [2021-10-06 16:18:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993143601] [2021-10-06 16:18:24,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993143601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-06 16:18:24,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986280] [2021-10-06 16:18:24,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-06 16:18:24,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-06 16:18:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-06 16:18:24,604 INFO L87 Difference]: Start difference. First operand 626 states and 1541 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,720 INFO L93 Difference]: Finished difference Result 928 states and 2272 transitions. [2021-10-06 16:18:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-06 16:18:24,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-06 16:18:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,733 INFO L225 Difference]: With dead ends: 928 [2021-10-06 16:18:24,734 INFO L226 Difference]: Without dead ends: 928 [2021-10-06 16:18:24,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-10-06 16:18:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-10-06 16:18:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 674. [2021-10-06 16:18:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 662 states have (on average 2.5332326283987916) internal successors, (1677), 673 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1677 transitions. [2021-10-06 16:18:24,760 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1677 transitions. Word has length 12 [2021-10-06 16:18:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,761 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 1677 transitions. [2021-10-06 16:18:24,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1677 transitions. [2021-10-06 16:18:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-06 16:18:24,763 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,763 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-06 16:18:24,763 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash -72173707, now seen corresponding path program 1 times [2021-10-06 16:18:24,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863062097] [2021-10-06 16:18:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863062097] [2021-10-06 16:18:24,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863062097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:18:24,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578511338] [2021-10-06 16:18:24,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:18:24,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:18:24,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:18:24,851 INFO L87 Difference]: Start difference. First operand 674 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:24,875 INFO L93 Difference]: Finished difference Result 386 states and 903 transitions. [2021-10-06 16:18:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:18:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-06 16:18:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:24,879 INFO L225 Difference]: With dead ends: 386 [2021-10-06 16:18:24,879 INFO L226 Difference]: Without dead ends: 386 [2021-10-06 16:18:24,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:18:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-10-06 16:18:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-10-06 16:18:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 2.37007874015748) internal successors, (903), 385 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 903 transitions. [2021-10-06 16:18:24,892 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 903 transitions. Word has length 12 [2021-10-06 16:18:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:24,893 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 903 transitions. [2021-10-06 16:18:24,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 903 transitions. [2021-10-06 16:18:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-06 16:18:24,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:24,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:24,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-06 16:18:24,894 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash -49531373, now seen corresponding path program 2 times [2021-10-06 16:18:24,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:24,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859939040] [2021-10-06 16:18:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:24,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:24,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:24,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859939040] [2021-10-06 16:18:24,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859939040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:24,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:24,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-06 16:18:24,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755805892] [2021-10-06 16:18:24,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-06 16:18:24,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-06 16:18:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-06 16:18:24,945 INFO L87 Difference]: Start difference. First operand 386 states and 903 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,054 INFO L93 Difference]: Finished difference Result 642 states and 1491 transitions. [2021-10-06 16:18:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-06 16:18:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-06 16:18:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,059 INFO L225 Difference]: With dead ends: 642 [2021-10-06 16:18:25,059 INFO L226 Difference]: Without dead ends: 642 [2021-10-06 16:18:25,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-06 16:18:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-06 16:18:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 350. [2021-10-06 16:18:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 2.3757225433526012) internal successors, (822), 349 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 822 transitions. [2021-10-06 16:18:25,074 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 822 transitions. Word has length 12 [2021-10-06 16:18:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,078 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 822 transitions. [2021-10-06 16:18:25,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 822 transitions. [2021-10-06 16:18:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-06 16:18:25,079 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,079 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-06 16:18:25,080 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1386746718, now seen corresponding path program 1 times [2021-10-06 16:18:25,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031117411] [2021-10-06 16:18:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031117411] [2021-10-06 16:18:25,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031117411] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:18:25,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252225519] [2021-10-06 16:18:25,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:25,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:25,143 INFO L87 Difference]: Start difference. First operand 350 states and 822 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,165 INFO L93 Difference]: Finished difference Result 316 states and 724 transitions. [2021-10-06 16:18:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:18:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-06 16:18:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,167 INFO L225 Difference]: With dead ends: 316 [2021-10-06 16:18:25,168 INFO L226 Difference]: Without dead ends: 308 [2021-10-06 16:18:25,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-06 16:18:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-10-06 16:18:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 304 states have (on average 2.338815789473684) internal successors, (711), 307 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 711 transitions. [2021-10-06 16:18:25,181 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 711 transitions. Word has length 12 [2021-10-06 16:18:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,181 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 711 transitions. [2021-10-06 16:18:25,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 711 transitions. [2021-10-06 16:18:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:18:25,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,183 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-06 16:18:25,183 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash -303943640, now seen corresponding path program 1 times [2021-10-06 16:18:25,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54720354] [2021-10-06 16:18:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54720354] [2021-10-06 16:18:25,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54720354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-06 16:18:25,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631723815] [2021-10-06 16:18:25,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:25,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:25,238 INFO L87 Difference]: Start difference. First operand 308 states and 711 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,273 INFO L93 Difference]: Finished difference Result 444 states and 999 transitions. [2021-10-06 16:18:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:18:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-06 16:18:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,276 INFO L225 Difference]: With dead ends: 444 [2021-10-06 16:18:25,277 INFO L226 Difference]: Without dead ends: 444 [2021-10-06 16:18:25,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-06 16:18:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 308. [2021-10-06 16:18:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 304 states have (on average 2.299342105263158) internal successors, (699), 307 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 699 transitions. [2021-10-06 16:18:25,288 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 699 transitions. Word has length 20 [2021-10-06 16:18:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,288 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 699 transitions. [2021-10-06 16:18:25,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 699 transitions. [2021-10-06 16:18:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:18:25,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-06 16:18:25,290 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 607350988, now seen corresponding path program 2 times [2021-10-06 16:18:25,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008404540] [2021-10-06 16:18:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008404540] [2021-10-06 16:18:25,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008404540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-06 16:18:25,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763864208] [2021-10-06 16:18:25,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:18:25,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:18:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:18:25,340 INFO L87 Difference]: Start difference. First operand 308 states and 699 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,377 INFO L93 Difference]: Finished difference Result 304 states and 691 transitions. [2021-10-06 16:18:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-06 16:18:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-06 16:18:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,380 INFO L225 Difference]: With dead ends: 304 [2021-10-06 16:18:25,380 INFO L226 Difference]: Without dead ends: 304 [2021-10-06 16:18:25,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 24.7ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-06 16:18:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-10-06 16:18:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2021-10-06 16:18:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 301 states have (on average 2.2956810631229234) internal successors, (691), 303 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 691 transitions. [2021-10-06 16:18:25,403 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 691 transitions. Word has length 20 [2021-10-06 16:18:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,404 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 691 transitions. [2021-10-06 16:18:25,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 691 transitions. [2021-10-06 16:18:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:18:25,406 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,406 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-06 16:18:25,406 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 607351053, now seen corresponding path program 1 times [2021-10-06 16:18:25,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467860946] [2021-10-06 16:18:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467860946] [2021-10-06 16:18:25,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467860946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:18:25,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567624368] [2021-10-06 16:18:25,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:25,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:25,443 INFO L87 Difference]: Start difference. First operand 304 states and 691 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,459 INFO L93 Difference]: Finished difference Result 300 states and 683 transitions. [2021-10-06 16:18:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:18:25,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-06 16:18:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,462 INFO L225 Difference]: With dead ends: 300 [2021-10-06 16:18:25,462 INFO L226 Difference]: Without dead ends: 242 [2021-10-06 16:18:25,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-06 16:18:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-06 16:18:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 2.2666666666666666) internal successors, (544), 241 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 544 transitions. [2021-10-06 16:18:25,472 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 544 transitions. Word has length 20 [2021-10-06 16:18:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,473 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 544 transitions. [2021-10-06 16:18:25,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 544 transitions. [2021-10-06 16:18:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:18:25,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,474 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-06 16:18:25,475 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1498726119, now seen corresponding path program 1 times [2021-10-06 16:18:25,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001586327] [2021-10-06 16:18:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001586327] [2021-10-06 16:18:25,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001586327] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-06 16:18:25,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529147259] [2021-10-06 16:18:25,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:18:25,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:18:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:18:25,528 INFO L87 Difference]: Start difference. First operand 242 states and 544 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,557 INFO L93 Difference]: Finished difference Result 236 states and 532 transitions. [2021-10-06 16:18:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-06 16:18:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-06 16:18:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,560 INFO L225 Difference]: With dead ends: 236 [2021-10-06 16:18:25,560 INFO L226 Difference]: Without dead ends: 236 [2021-10-06 16:18:25,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-10-06 16:18:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-06 16:18:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-06 16:18:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.2638297872340427) internal successors, (532), 235 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 532 transitions. [2021-10-06 16:18:25,569 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 532 transitions. Word has length 20 [2021-10-06 16:18:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,570 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 532 transitions. [2021-10-06 16:18:25,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 532 transitions. [2021-10-06 16:18:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:18:25,571 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:18:25,572 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:18:25,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-06 16:18:25,572 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-10-06 16:18:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:18:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1498726077, now seen corresponding path program 1 times [2021-10-06 16:18:25,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:18:25,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787136424] [2021-10-06 16:18:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:18:25,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:18:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:18:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:18:25,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:18:25,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787136424] [2021-10-06 16:18:25,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787136424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:18:25,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:18:25,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:18:25,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88282842] [2021-10-06 16:18:25,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:18:25,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:18:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:18:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-06 16:18:25,608 INFO L87 Difference]: Start difference. First operand 236 states and 532 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:18:25,620 INFO L93 Difference]: Finished difference Result 230 states and 520 transitions. [2021-10-06 16:18:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:18:25,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-06 16:18:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:18:25,621 INFO L225 Difference]: With dead ends: 230 [2021-10-06 16:18:25,622 INFO L226 Difference]: Without dead ends: 0 [2021-10-06 16:18:25,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:18:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-06 16:18:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-06 16:18:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-06 16:18:25,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2021-10-06 16:18:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:18:25,623 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-06 16:18:25,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:18:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-06 16:18:25,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-06 16:18:25,627 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,628 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,629 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,629 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,629 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-06 16:18:25,629 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-06 16:18:25,630 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,630 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,630 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,630 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,631 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,631 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,631 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,631 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:18:25,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-06 16:18:25,638 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-06 16:18:25,639 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-06 16:18:25,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 04:18:25 BasicIcfg [2021-10-06 16:18:25,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-06 16:18:25,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-06 16:18:25,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-06 16:18:25,642 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-06 16:18:25,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:18:17" (3/4) ... [2021-10-06 16:18:25,645 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-06 16:18:25,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-06 16:18:25,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-06 16:18:25,657 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-10-06 16:18:25,657 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-06 16:18:25,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-06 16:18:25,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-06 16:18:25,696 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/parallel/bakery-2.wvr.c-witness.graphml [2021-10-06 16:18:25,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-06 16:18:25,699 INFO L168 Benchmark]: Toolchain (without parser) took 9029.57 ms. Allocated memory was 158.3 MB in the beginning and 229.6 MB in the end (delta: 71.3 MB). Free memory was 132.8 MB in the beginning and 171.2 MB in the end (delta: -38.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,699 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 158.3 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-06 16:18:25,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.88 ms. Allocated memory is still 158.3 MB. Free memory was 132.6 MB in the beginning and 122.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 158.3 MB. Free memory was 122.1 MB in the beginning and 120.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,700 INFO L168 Benchmark]: Boogie Preprocessor took 25.52 ms. Allocated memory is still 158.3 MB. Free memory was 120.3 MB in the beginning and 119.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,701 INFO L168 Benchmark]: RCFGBuilder took 577.86 ms. Allocated memory is still 158.3 MB. Free memory was 119.1 MB in the beginning and 105.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,701 INFO L168 Benchmark]: TraceAbstraction took 7908.45 ms. Allocated memory was 158.3 MB in the beginning and 229.6 MB in the end (delta: 71.3 MB). Free memory was 105.1 MB in the beginning and 173.8 MB in the end (delta: -68.8 MB). Peak memory consumption was 2.9 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,702 INFO L168 Benchmark]: Witness Printer took 55.45 ms. Allocated memory is still 229.6 MB. Free memory was 173.8 MB in the beginning and 171.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:18:25,704 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.22 ms. Allocated memory is still 158.3 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 404.88 ms. Allocated memory is still 158.3 MB. Free memory was 132.6 MB in the beginning and 122.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 158.3 MB. Free memory was 122.1 MB in the beginning and 120.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.52 ms. Allocated memory is still 158.3 MB. Free memory was 120.3 MB in the beginning and 119.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 577.86 ms. Allocated memory is still 158.3 MB. Free memory was 119.1 MB in the beginning and 105.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7908.45 ms. Allocated memory was 158.3 MB in the beginning and 229.6 MB in the end (delta: 71.3 MB). Free memory was 105.1 MB in the beginning and 173.8 MB in the end (delta: -68.8 MB). Peak memory consumption was 2.9 MB. Max. memory is 8.0 GB. * Witness Printer took 55.45 ms. Allocated memory is still 229.6 MB. Free memory was 173.8 MB in the beginning and 171.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4676.7ms, 145 PlacesBefore, 48 PlacesAfterwards, 146 TransitionsBefore, 45 TransitionsAfterwards, 3672 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 133 TotalNumberOfCompositions, 10115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5735, positive: 5444, positive conditional: 0, positive unconditional: 5444, negative: 291, negative conditional: 0, negative unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2794, positive: 2715, positive conditional: 0, positive unconditional: 2715, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2794, positive: 2677, positive conditional: 0, positive unconditional: 2677, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5735, positive: 2729, positive conditional: 0, positive unconditional: 2729, negative: 212, negative conditional: 0, negative unconditional: 212, unknown: 2794, unknown conditional: 0, unknown unconditional: 2794] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 375, Positive conditional cache size: 0, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 209 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 7665.4ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 32.3ms, AutomataDifference: 1177.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4774.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 816 SDtfs, 1244 SDslu, 1307 SDs, 0 SdLazy, 650 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 490.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 303.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=9, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 399.7ms AutomataMinimizationTime, 17 MinimizatonAttempts, 1056 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.3ms SsaConstructionTime, 324.7ms SatisfiabilityAnalysisTime, 639.0ms InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-06 16:18:25,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...