/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/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-07 14:52:58,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-07 14:52:58,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-07 14:52:58,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-07 14:52:58,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-07 14:52:58,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-07 14:52:58,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-07 14:52:58,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-07 14:52:58,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-07 14:52:58,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-07 14:52:58,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-07 14:52:58,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-07 14:52:58,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-07 14:52:58,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-07 14:52:58,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-07 14:52:58,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-07 14:52:58,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-07 14:52:58,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-07 14:52:58,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-07 14:52:58,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-07 14:52:58,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-07 14:52:58,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-07 14:52:58,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-07 14:52:58,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-07 14:52:58,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-07 14:52:58,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-07 14:52:58,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-07 14:52:58,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-07 14:52:58,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-07 14:52:58,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-07 14:52:58,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-07 14:52:58,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-07 14:52:58,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-07 14:52:58,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-07 14:52:58,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-07 14:52:58,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-07 14:52:58,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-07 14:52:58,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-07 14:52:58,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-07 14:52:58,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-07 14:52:58,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-07 14:52:58,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-07 14:52:58,161 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-07 14:52:58,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-07 14:52:58,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-07 14:52:58,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-07 14:52:58,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-07 14:52:58,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-07 14:52:58,163 INFO L138 SettingsManager]: * Use SBE=true [2021-10-07 14:52:58,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-07 14:52:58,164 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-07 14:52:58,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-07 14:52:58,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-07 14:52:58,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-07 14:52:58,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-07 14:52:58,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-07 14:52:58,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-07 14:52:58,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-07 14:52:58,166 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-07 14:52:58,166 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-07 14:52:58,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-07 14:52:58,166 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-07 14:52:58,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-07 14:52:58,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-07 14:52:58,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-07 14:52:58,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-07 14:52:58,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 14:52:58,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-07 14:52:58,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-07 14:52:58,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-07 14:52:58,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-07 14:52:58,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-07 14:52:58,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-07 14:52:58,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-07 14:52:58,169 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-07 14:52:58,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-07 14:52:58,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-07 14:52:58,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-07 14:52:58,549 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-07 14:52:58,550 INFO L275 PluginConnector]: CDTParser initialized [2021-10-07 14:52:58,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2021-10-07 14:52:58,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/05afbf919/a3a0bea28856480fba3934da860c285a/FLAGf120cd8b3 [2021-10-07 14:52:59,298 INFO L306 CDTParser]: Found 1 translation units. [2021-10-07 14:52:59,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2021-10-07 14:52:59,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/05afbf919/a3a0bea28856480fba3934da860c285a/FLAGf120cd8b3 [2021-10-07 14:52:59,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/05afbf919/a3a0bea28856480fba3934da860c285a [2021-10-07 14:52:59,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-07 14:52:59,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-07 14:52:59,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-07 14:52:59,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-07 14:52:59,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-07 14:52:59,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:52:59,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c8ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59, skipping insertion in model container [2021-10-07 14:52:59,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:52:59,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-07 14:52:59,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-07 14:52:59,908 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/chl-array-int-symm.wvr.c[2441,2454] [2021-10-07 14:52:59,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 14:52:59,924 INFO L203 MainTranslator]: Completed pre-run [2021-10-07 14:52:59,950 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/chl-array-int-symm.wvr.c[2441,2454] [2021-10-07 14:52:59,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 14:52:59,970 INFO L208 MainTranslator]: Completed translation [2021-10-07 14:52:59,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59 WrapperNode [2021-10-07 14:52:59,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-07 14:52:59,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-07 14:52:59,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-07 14:52:59,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-07 14:52:59,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:52:59,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-07 14:53:00,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-07 14:53:00,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-07 14:53:00,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-07 14:53:00,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-07 14:53:00,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-07 14:53:00,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-07 14:53:00,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-07 14:53:00,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (1/1) ... [2021-10-07 14:53:00,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 14:53:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:00,112 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-07 14:53:00,115 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-07 14:53:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-07 14:53:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-07 14:53:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-07 14:53:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-07 14:53:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-07 14:53:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-07 14:53:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-07 14:53:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-07 14:53:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-07 14:53:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-07 14:53:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-07 14:53:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-07 14:53:00,174 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-07 14:53:00,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-07 14:53:00,872 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-07 14:53:00,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:53:00 BoogieIcfgContainer [2021-10-07 14:53:00,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-07 14:53:00,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-07 14:53:00,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-07 14:53:00,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-07 14:53:00,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:52:59" (1/3) ... [2021-10-07 14:53:00,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8e4455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:53:00, skipping insertion in model container [2021-10-07 14:53:00,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:52:59" (2/3) ... [2021-10-07 14:53:00,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8e4455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:53:00, skipping insertion in model container [2021-10-07 14:53:00,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:53:00" (3/3) ... [2021-10-07 14:53:00,890 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2021-10-07 14:53:00,896 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-07 14:53:00,897 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-07 14:53:00,897 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-10-07 14:53:00,897 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-07 14:53:00,963 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,964 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,964 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,964 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,965 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,965 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,966 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,966 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,966 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,966 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,967 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,967 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,967 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,969 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,969 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,969 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,970 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,970 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,970 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,970 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,970 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,971 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,971 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,971 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,971 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,972 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,972 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,972 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,974 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,974 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,974 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,974 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,974 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,975 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,975 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,975 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,975 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,975 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,976 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,976 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,976 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,976 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,977 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,977 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,977 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,978 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,978 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,978 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,978 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,978 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,979 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,979 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,979 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,980 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,980 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,980 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,981 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,981 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,982 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,982 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,983 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,983 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,984 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,984 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,984 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,984 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,984 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,986 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,987 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,987 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,987 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,988 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,988 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,988 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,988 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,989 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,989 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,989 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,994 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,995 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,995 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,996 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,996 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,996 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,996 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,997 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,997 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,997 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,999 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:00,999 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,000 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,003 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,008 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,010 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,015 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,015 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,016 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,016 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,016 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,017 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,021 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,022 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,023 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,023 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,023 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,024 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,025 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,025 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,025 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,025 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,025 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,029 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,029 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,029 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,029 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,030 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,030 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,030 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,030 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,034 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,035 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,035 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,035 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,035 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,035 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,036 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,037 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:01,045 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-07 14:53:01,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-07 14:53:01,123 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-07 14:53:01,123 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-10-07 14:53:01,160 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-07 14:53:01,175 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 213 transitions, 442 flow [2021-10-07 14:53:01,177 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 213 transitions, 442 flow [2021-10-07 14:53:01,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 213 transitions, 442 flow [2021-10-07 14:53:01,265 INFO L129 PetriNetUnfolder]: 17/211 cut-off events. [2021-10-07 14:53:01,265 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-07 14:53:01,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 211 events. 17/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 294 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2021-10-07 14:53:01,277 INFO L116 LiptonReduction]: Number of co-enabled transitions 3500 [2021-10-07 14:53:08,640 INFO L131 LiptonReduction]: Checked pairs total: 5594 [2021-10-07 14:53:08,640 INFO L133 LiptonReduction]: Total number of compositions: 248 [2021-10-07 14:53:08,650 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 41 transitions, 98 flow [2021-10-07 14:53:08,677 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 262 states, 210 states have (on average 3.0619047619047617) internal successors, (643), 261 states have internal predecessors, (643), 0 states have call successors, (0), 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-07 14:53:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 210 states have (on average 3.0619047619047617) internal successors, (643), 261 states have internal predecessors, (643), 0 states have call successors, (0), 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-07 14:53:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 14:53:08,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:08,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 14:53:08,688 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 27119, now seen corresponding path program 1 times [2021-10-07 14:53:08,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:08,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9743800] [2021-10-07 14:53:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:08,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:08,883 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-07 14:53:08,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:08,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9743800] [2021-10-07 14:53:08,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9743800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:08,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:08,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-07 14:53:08,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030813575] [2021-10-07 14:53:08,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:08,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:08,918 INFO L87 Difference]: Start difference. First operand has 262 states, 210 states have (on average 3.0619047619047617) internal successors, (643), 261 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 14:53:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:08,995 INFO L93 Difference]: Finished difference Result 519 states and 1281 transitions. [2021-10-07 14:53:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-07 14:53:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:09,018 INFO L225 Difference]: With dead ends: 519 [2021-10-07 14:53:09,019 INFO L226 Difference]: Without dead ends: 519 [2021-10-07 14:53:09,020 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-07 14:53:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 264. [2021-10-07 14:53:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 212 states have (on average 3.05188679245283) internal successors, (647), 263 states have internal predecessors, (647), 0 states have call successors, (0), 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-07 14:53:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 647 transitions. [2021-10-07 14:53:09,093 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 647 transitions. Word has length 2 [2021-10-07 14:53:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:09,093 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 647 transitions. [2021-10-07 14:53:09,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 14:53:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 647 transitions. [2021-10-07 14:53:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-07 14:53:09,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:09,098 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-07 14:53:09,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-07 14:53:09,098 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 842264, now seen corresponding path program 1 times [2021-10-07 14:53:09,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:09,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294529291] [2021-10-07 14:53:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:09,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:09,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:09,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294529291] [2021-10-07 14:53:09,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294529291] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:09,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485394168] [2021-10-07 14:53:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:09,213 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:09,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:09,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-07 14:53:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:09,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 14:53:09,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:09,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485394168] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:09,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:09,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-07 14:53:09,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094298634] [2021-10-07 14:53:09,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:09,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:09,331 INFO L87 Difference]: Start difference. First operand 264 states and 647 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:09,394 INFO L93 Difference]: Finished difference Result 776 states and 1921 transitions. [2021-10-07 14:53:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 [2021-10-07 14:53:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:09,404 INFO L225 Difference]: With dead ends: 776 [2021-10-07 14:53:09,404 INFO L226 Difference]: Without dead ends: 776 [2021-10-07 14:53:09,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2021-10-07 14:53:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 266. [2021-10-07 14:53:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 3.0514018691588785) internal successors, (653), 265 states have internal predecessors, (653), 0 states have call successors, (0), 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-07 14:53:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 653 transitions. [2021-10-07 14:53:09,447 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 653 transitions. Word has length 3 [2021-10-07 14:53:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:09,447 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 653 transitions. [2021-10-07 14:53:09,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 653 transitions. [2021-10-07 14:53:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-07 14:53:09,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:09,448 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-07 14:53:09,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:09,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:09,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash 842265, now seen corresponding path program 1 times [2021-10-07 14:53:09,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:09,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429635505] [2021-10-07 14:53:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:09,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:09,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:09,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429635505] [2021-10-07 14:53:09,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429635505] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:09,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602431681] [2021-10-07 14:53:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:09,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:09,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:09,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-07 14:53:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:09,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 14:53:09,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:09,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602431681] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:09,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:09,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-07 14:53:09,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577808035] [2021-10-07 14:53:09,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 14:53:09,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 14:53:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:09,877 INFO L87 Difference]: Start difference. First operand 266 states and 653 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 14:53:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:09,924 INFO L93 Difference]: Finished difference Result 519 states and 1283 transitions. [2021-10-07 14:53:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 14:53:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-07 14:53:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:09,932 INFO L225 Difference]: With dead ends: 519 [2021-10-07 14:53:09,932 INFO L226 Difference]: Without dead ends: 519 [2021-10-07 14:53:09,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-07 14:53:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 264. [2021-10-07 14:53:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 214 states have (on average 3.032710280373832) internal successors, (649), 263 states have internal predecessors, (649), 0 states have call successors, (0), 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-07 14:53:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 649 transitions. [2021-10-07 14:53:09,975 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 649 transitions. Word has length 3 [2021-10-07 14:53:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:09,976 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 649 transitions. [2021-10-07 14:53:09,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 14:53:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 649 transitions. [2021-10-07 14:53:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 14:53:09,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:09,978 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-07 14:53:10,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:10,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:10,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 26111759, now seen corresponding path program 2 times [2021-10-07 14:53:10,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:10,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078228218] [2021-10-07 14:53:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:10,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:10,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:10,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078228218] [2021-10-07 14:53:10,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078228218] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:10,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456320109] [2021-10-07 14:53:10,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 14:53:10,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:10,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:10,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-07 14:53:10,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-07 14:53:10,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-07 14:53:10,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-07 14:53:10,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456320109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:10,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:10,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-07 14:53:10,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962878920] [2021-10-07 14:53:10,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:10,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:10,342 INFO L87 Difference]: Start difference. First operand 264 states and 649 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 14:53:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:10,362 INFO L93 Difference]: Finished difference Result 263 states and 648 transitions. [2021-10-07 14:53:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 4 [2021-10-07 14:53:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:10,366 INFO L225 Difference]: With dead ends: 263 [2021-10-07 14:53:10,366 INFO L226 Difference]: Without dead ends: 263 [2021-10-07 14:53:10,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-07 14:53:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2021-10-07 14:53:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 212 states have (on average 3.0377358490566038) internal successors, (644), 260 states have internal predecessors, (644), 0 states have call successors, (0), 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-07 14:53:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 644 transitions. [2021-10-07 14:53:10,378 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 644 transitions. Word has length 4 [2021-10-07 14:53:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:10,379 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 644 transitions. [2021-10-07 14:53:10,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 14:53:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 644 transitions. [2021-10-07 14:53:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 14:53:10,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:10,380 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2021-10-07 14:53:10,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:10,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:10,595 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash 810122472, now seen corresponding path program 1 times [2021-10-07 14:53:10,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:10,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203313412] [2021-10-07 14:53:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:10,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:10,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:10,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203313412] [2021-10-07 14:53:10,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203313412] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:10,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305249686] [2021-10-07 14:53:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:10,670 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:10,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:10,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-07 14:53:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:10,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-07 14:53:10,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:10,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305249686] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:10,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:10,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-07 14:53:10,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666285543] [2021-10-07 14:53:10,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-07 14:53:10,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-07 14:53:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:10,763 INFO L87 Difference]: Start difference. First operand 261 states and 644 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-07 14:53:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:10,813 INFO L93 Difference]: Finished difference Result 1030 states and 2554 transitions. [2021-10-07 14:53:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 5 [2021-10-07 14:53:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:10,823 INFO L225 Difference]: With dead ends: 1030 [2021-10-07 14:53:10,823 INFO L226 Difference]: Without dead ends: 1030 [2021-10-07 14:53:10,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-10-07 14:53:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 262. [2021-10-07 14:53:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 3.032863849765258) internal successors, (646), 261 states have internal predecessors, (646), 0 states have call successors, (0), 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-07 14:53:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 646 transitions. [2021-10-07 14:53:10,841 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 646 transitions. Word has length 5 [2021-10-07 14:53:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:10,841 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 646 transitions. [2021-10-07 14:53:10,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-07 14:53:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 646 transitions. [2021-10-07 14:53:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 14:53:10,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:10,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-07 14:53:10,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-07 14:53:11,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:11,056 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 810118237, now seen corresponding path program 1 times [2021-10-07 14:53:11,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:11,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538486426] [2021-10-07 14:53:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:11,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:11,114 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-07 14:53:11,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:11,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538486426] [2021-10-07 14:53:11,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538486426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:11,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:11,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-07 14:53:11,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538098672] [2021-10-07 14:53:11,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:11,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:11,117 INFO L87 Difference]: Start difference. First operand 262 states and 646 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:11,219 INFO L93 Difference]: Finished difference Result 473 states and 1166 transitions. [2021-10-07 14:53:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-07 14:53:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:11,224 INFO L225 Difference]: With dead ends: 473 [2021-10-07 14:53:11,225 INFO L226 Difference]: Without dead ends: 473 [2021-10-07 14:53:11,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-10-07 14:53:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 317. [2021-10-07 14:53:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 3.0186567164179103) internal successors, (809), 316 states have internal predecessors, (809), 0 states have call successors, (0), 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-07 14:53:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 809 transitions. [2021-10-07 14:53:11,237 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 809 transitions. Word has length 5 [2021-10-07 14:53:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:11,238 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 809 transitions. [2021-10-07 14:53:11,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 809 transitions. [2021-10-07 14:53:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 14:53:11,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:11,239 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-07 14:53:11,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-07 14:53:11,239 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:11,240 INFO L82 PathProgramCache]: Analyzing trace with hash 810118126, now seen corresponding path program 1 times [2021-10-07 14:53:11,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:11,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779540396] [2021-10-07 14:53:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:11,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:11,289 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-07 14:53:11,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:11,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779540396] [2021-10-07 14:53:11,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779540396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:11,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:11,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-07 14:53:11,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396415861] [2021-10-07 14:53:11,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:11,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:11,292 INFO L87 Difference]: Start difference. First operand 317 states and 809 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:11,395 INFO L93 Difference]: Finished difference Result 585 states and 1467 transitions. [2021-10-07 14:53:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:11,401 INFO L225 Difference]: With dead ends: 585 [2021-10-07 14:53:11,401 INFO L226 Difference]: Without dead ends: 585 [2021-10-07 14:53:11,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-10-07 14:53:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 428. [2021-10-07 14:53:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 381 states have (on average 2.9133858267716537) internal successors, (1110), 427 states have internal predecessors, (1110), 0 states have call successors, (0), 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-07 14:53:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1110 transitions. [2021-10-07 14:53:11,421 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1110 transitions. Word has length 5 [2021-10-07 14:53:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:11,422 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1110 transitions. [2021-10-07 14:53:11,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-07 14:53:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1110 transitions. [2021-10-07 14:53:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-07 14:53:11,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:11,423 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2021-10-07 14:53:11,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-07 14:53:11,423 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash -656004758, now seen corresponding path program 2 times [2021-10-07 14:53:11,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:11,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450446214] [2021-10-07 14:53:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:11,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:11,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:11,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450446214] [2021-10-07 14:53:11,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450446214] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:11,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321662764] [2021-10-07 14:53:11,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 14:53:11,474 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:11,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:11,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-07 14:53:11,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-07 14:53:11,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:11,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-07 14:53:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:11,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321662764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:11,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:11,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-10-07 14:53:11,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187415758] [2021-10-07 14:53:11,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 14:53:11,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 14:53:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-07 14:53:11,584 INFO L87 Difference]: Start difference. First operand 428 states and 1110 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-07 14:53:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:11,618 INFO L93 Difference]: Finished difference Result 395 states and 1023 transitions. [2021-10-07 14:53:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 6 [2021-10-07 14:53:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:11,622 INFO L225 Difference]: With dead ends: 395 [2021-10-07 14:53:11,622 INFO L226 Difference]: Without dead ends: 395 [2021-10-07 14:53:11,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-07 14:53:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-10-07 14:53:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2021-10-07 14:53:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 352 states have (on average 2.883522727272727) internal successors, (1015), 390 states have internal predecessors, (1015), 0 states have call successors, (0), 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-07 14:53:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1015 transitions. [2021-10-07 14:53:11,637 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1015 transitions. Word has length 6 [2021-10-07 14:53:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:11,637 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 1015 transitions. [2021-10-07 14:53:11,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-07 14:53:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1015 transitions. [2021-10-07 14:53:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-07 14:53:11,638 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:11,638 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-07 14:53:11,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:11,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:11,852 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:11,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash -656008993, now seen corresponding path program 1 times [2021-10-07 14:53:11,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:11,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626235447] [2021-10-07 14:53:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:11,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:11,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:11,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626235447] [2021-10-07 14:53:11,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626235447] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:11,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487476089] [2021-10-07 14:53:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:11,937 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:11,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-07 14:53:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:11,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-07 14:53:11,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:12,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487476089] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:12,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:12,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2021-10-07 14:53:12,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255245238] [2021-10-07 14:53:12,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:12,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:12,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-07 14:53:12,066 INFO L87 Difference]: Start difference. First operand 391 states and 1015 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 14:53:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:12,085 INFO L93 Difference]: Finished difference Result 353 states and 884 transitions. [2021-10-07 14:53:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:12,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-07 14:53:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:12,089 INFO L225 Difference]: With dead ends: 353 [2021-10-07 14:53:12,089 INFO L226 Difference]: Without dead ends: 353 [2021-10-07 14:53:12,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-07 14:53:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-07 14:53:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 245. [2021-10-07 14:53:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 216 states have (on average 2.759259259259259) internal successors, (596), 244 states have internal predecessors, (596), 0 states have call successors, (0), 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-07 14:53:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 596 transitions. [2021-10-07 14:53:12,099 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 596 transitions. Word has length 6 [2021-10-07 14:53:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:12,100 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 596 transitions. [2021-10-07 14:53:12,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 14:53:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 596 transitions. [2021-10-07 14:53:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-07 14:53:12,100 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:12,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-07 14:53:12,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:12,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:12,315 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -675700955, now seen corresponding path program 1 times [2021-10-07 14:53:12,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:12,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201986571] [2021-10-07 14:53:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:12,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:12,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:12,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201986571] [2021-10-07 14:53:12,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201986571] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:12,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645366863] [2021-10-07 14:53:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:12,375 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:12,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-07 14:53:12,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-07 14:53:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-07 14:53:12,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:12,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645366863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:12,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:12,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2021-10-07 14:53:12,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246572735] [2021-10-07 14:53:12,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 14:53:12,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:12,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 14:53:12,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-07 14:53:12,488 INFO L87 Difference]: Start difference. First operand 245 states and 596 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 14:53:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:12,508 INFO L93 Difference]: Finished difference Result 207 states and 501 transitions. [2021-10-07 14:53:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 14:53:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-07 14:53:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:12,511 INFO L225 Difference]: With dead ends: 207 [2021-10-07 14:53:12,511 INFO L226 Difference]: Without dead ends: 207 [2021-10-07 14:53:12,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-07 14:53:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-10-07 14:53:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 152. [2021-10-07 14:53:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 2.8045112781954886) internal successors, (373), 151 states have internal predecessors, (373), 0 states have call successors, (0), 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-07 14:53:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 373 transitions. [2021-10-07 14:53:12,518 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 373 transitions. Word has length 6 [2021-10-07 14:53:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:12,518 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 373 transitions. [2021-10-07 14:53:12,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 14:53:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 373 transitions. [2021-10-07 14:53:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-07 14:53:12,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:12,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:12,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:12,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-07 14:53:12,733 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1134580406, now seen corresponding path program 1 times [2021-10-07 14:53:12,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:12,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16697684] [2021-10-07 14:53:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:12,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:12,759 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-07 14:53:12,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:12,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16697684] [2021-10-07 14:53:12,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16697684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:12,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:12,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:12,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446206645] [2021-10-07 14:53:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:12,765 INFO L87 Difference]: Start difference. First operand 152 states and 373 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-07 14:53:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:12,789 INFO L93 Difference]: Finished difference Result 258 states and 638 transitions. [2021-10-07 14:53:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-07 14:53:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:12,792 INFO L225 Difference]: With dead ends: 258 [2021-10-07 14:53:12,792 INFO L226 Difference]: Without dead ends: 258 [2021-10-07 14:53:12,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-07 14:53:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 180. [2021-10-07 14:53:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 2.900621118012422) internal successors, (467), 179 states have internal predecessors, (467), 0 states have call successors, (0), 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-07 14:53:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 467 transitions. [2021-10-07 14:53:12,799 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 467 transitions. Word has length 7 [2021-10-07 14:53:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:12,800 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 467 transitions. [2021-10-07 14:53:12,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-07 14:53:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 467 transitions. [2021-10-07 14:53:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-07 14:53:12,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:12,802 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:12,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-07 14:53:12,802 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 812984533, now seen corresponding path program 1 times [2021-10-07 14:53:12,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:12,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285173339] [2021-10-07 14:53:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:12,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:12,864 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-07 14:53:12,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:12,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285173339] [2021-10-07 14:53:12,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285173339] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:12,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:12,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-07 14:53:12,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543018715] [2021-10-07 14:53:12,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:12,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:12,874 INFO L87 Difference]: Start difference. First operand 180 states and 467 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 14:53:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:12,920 INFO L93 Difference]: Finished difference Result 281 states and 697 transitions. [2021-10-07 14:53:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-10-07 14:53:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:12,923 INFO L225 Difference]: With dead ends: 281 [2021-10-07 14:53:12,923 INFO L226 Difference]: Without dead ends: 271 [2021-10-07 14:53:12,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-07 14:53:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2021-10-07 14:53:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 2.747826086956522) internal successors, (632), 248 states have internal predecessors, (632), 0 states have call successors, (0), 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-07 14:53:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 632 transitions. [2021-10-07 14:53:12,932 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 632 transitions. Word has length 8 [2021-10-07 14:53:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:12,932 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 632 transitions. [2021-10-07 14:53:12,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 14:53:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 632 transitions. [2021-10-07 14:53:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-07 14:53:12,934 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:12,935 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:12,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-07 14:53:12,935 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash -589883949, now seen corresponding path program 1 times [2021-10-07 14:53:12,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:12,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370583863] [2021-10-07 14:53:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:12,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 14:53:12,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:12,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370583863] [2021-10-07 14:53:12,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370583863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:12,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:12,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:12,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057405124] [2021-10-07 14:53:12,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:12,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:12,977 INFO L87 Difference]: Start difference. First operand 249 states and 632 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-07 14:53:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:12,996 INFO L93 Difference]: Finished difference Result 229 states and 584 transitions. [2021-10-07 14:53:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-07 14:53:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:12,998 INFO L225 Difference]: With dead ends: 229 [2021-10-07 14:53:12,999 INFO L226 Difference]: Without dead ends: 229 [2021-10-07 14:53:12,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-07 14:53:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-10-07 14:53:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 214 states have (on average 2.7289719626168223) internal successors, (584), 228 states have internal predecessors, (584), 0 states have call successors, (0), 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-07 14:53:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 584 transitions. [2021-10-07 14:53:13,007 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 584 transitions. Word has length 9 [2021-10-07 14:53:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:13,008 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 584 transitions. [2021-10-07 14:53:13,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-07 14:53:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 584 transitions. [2021-10-07 14:53:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-07 14:53:13,009 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:13,009 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:13,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-07 14:53:13,009 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -589883973, now seen corresponding path program 1 times [2021-10-07 14:53:13,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:13,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032099202] [2021-10-07 14:53:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:13,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:13,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:13,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032099202] [2021-10-07 14:53:13,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032099202] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:13,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:13,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-07 14:53:13,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135728229] [2021-10-07 14:53:13,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:13,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:13,055 INFO L87 Difference]: Start difference. First operand 229 states and 584 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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-07 14:53:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:13,104 INFO L93 Difference]: Finished difference Result 185 states and 464 transitions. [2021-10-07 14:53:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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-07 14:53:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:13,106 INFO L225 Difference]: With dead ends: 185 [2021-10-07 14:53:13,106 INFO L226 Difference]: Without dead ends: 167 [2021-10-07 14:53:13,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-07 14:53:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-10-07 14:53:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 152 states have (on average 2.8552631578947367) internal successors, (434), 166 states have internal predecessors, (434), 0 states have call successors, (0), 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-07 14:53:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 434 transitions. [2021-10-07 14:53:13,112 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 434 transitions. Word has length 9 [2021-10-07 14:53:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:13,113 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 434 transitions. [2021-10-07 14:53:13,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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-07 14:53:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 434 transitions. [2021-10-07 14:53:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-07 14:53:13,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:13,114 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:13,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-07 14:53:13,114 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash 709695038, now seen corresponding path program 1 times [2021-10-07 14:53:13,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:13,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305849829] [2021-10-07 14:53:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:13,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:13,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:13,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305849829] [2021-10-07 14:53:13,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305849829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:13,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:13,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-07 14:53:13,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932167985] [2021-10-07 14:53:13,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:13,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:13,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:13,161 INFO L87 Difference]: Start difference. First operand 167 states and 434 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-07 14:53:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:13,241 INFO L93 Difference]: Finished difference Result 259 states and 645 transitions. [2021-10-07 14:53:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-07 14:53:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:13,244 INFO L225 Difference]: With dead ends: 259 [2021-10-07 14:53:13,244 INFO L226 Difference]: Without dead ends: 249 [2021-10-07 14:53:13,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-07 14:53:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-07 14:53:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2021-10-07 14:53:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 214 states have (on average 2.7242990654205608) internal successors, (583), 228 states have internal predecessors, (583), 0 states have call successors, (0), 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-07 14:53:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 583 transitions. [2021-10-07 14:53:13,255 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 583 transitions. Word has length 9 [2021-10-07 14:53:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:13,255 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 583 transitions. [2021-10-07 14:53:13,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-07 14:53:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 583 transitions. [2021-10-07 14:53:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-07 14:53:13,256 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:13,256 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:13,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-07 14:53:13,257 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2021-10-07 14:53:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 32101578, now seen corresponding path program 1 times [2021-10-07 14:53:13,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:13,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787608363] [2021-10-07 14:53:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:13,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 14:53:13,306 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-07 14:53:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 14:53:13,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-07 14:53:13,358 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-07 14:53:13,359 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-07 14:53:13,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-07 14:53:13,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:13,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-07 14:53:13,374 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-07 14:53:13,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-07 14:53:13,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 02:53:13 BasicIcfg [2021-10-07 14:53:13,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-07 14:53:13,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-07 14:53:13,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-07 14:53:13,415 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-07 14:53:13,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:53:00" (3/4) ... [2021-10-07 14:53:13,418 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-07 14:53:13,471 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl-array-int-symm.wvr.c-witness.graphml [2021-10-07 14:53:13,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-07 14:53:13,473 INFO L168 Benchmark]: Toolchain (without parser) took 13806.48 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 125.8 MB in the beginning and 142.2 MB in the end (delta: -16.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,473 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-07 14:53:13,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.12 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 114.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.27 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 112.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,474 INFO L168 Benchmark]: Boogie Preprocessor took 46.21 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,475 INFO L168 Benchmark]: RCFGBuilder took 811.56 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 126.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,475 INFO L168 Benchmark]: TraceAbstraction took 12534.34 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.1 MB in the beginning and 146.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,475 INFO L168 Benchmark]: Witness Printer took 55.88 ms. Allocated memory is still 181.4 MB. Free memory was 146.4 MB in the beginning and 142.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:13,478 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 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 294.12 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 114.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.27 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 112.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.21 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 811.56 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 126.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12534.34 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.1 MB in the beginning and 146.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * Witness Printer took 55.88 ms. Allocated memory is still 181.4 MB. Free memory was 146.4 MB in the beginning and 142.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7463.1ms, 203 PlacesBefore, 43 PlacesAfterwards, 213 TransitionsBefore, 41 TransitionsAfterwards, 3500 CoEnabledTransitionPairs, 7 FixpointIterations, 118 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 9 ConcurrentYvCompositions, 12 ChoiceCompositions, 248 TotalNumberOfCompositions, 5594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5046, positive: 4927, positive conditional: 0, positive unconditional: 4927, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2579, positive: 2542, positive conditional: 0, positive unconditional: 2542, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2579, positive: 2542, positive conditional: 0, positive unconditional: 2542, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5046, positive: 2385, positive conditional: 0, positive unconditional: 2385, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 2579, unknown conditional: 0, unknown unconditional: 2579] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - 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 - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L41] 0 int *a1, *a2; [L42] 0 int res1, res2, n1, n2; [L75] 0 pthread_t t1, t2; [L77] 0 n1 = __VERIFIER_nondet_int() [L78] 0 n2 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L100] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L101] 0 int i = 0; VAL [a1={0:0}, a2={0:0}, n1=1, n2=1, res1=0, res2=0] [L101] COND TRUE 0 i < size [L102] 0 arr[i] = __VERIFIER_nondet_int() [L101] 0 i++ VAL [a1={0:0}, a2={0:0}, n1=1, n2=1, res1=0, res2=0] [L101] COND FALSE 0 !(i < size) [L104] 0 return arr; [L79] 0 a1 = create_fresh_int_array(n1) [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L100] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L101] 0 int i = 0; VAL [a1={-3:0}, a2={0:0}, n1=1, n2=1, res1=0, res2=0] [L101] COND TRUE 0 i < size [L102] 0 arr[i] = __VERIFIER_nondet_int() [L101] 0 i++ VAL [a1={-3:0}, a2={0:0}, n1=1, n2=1, res1=0, res2=0] [L101] COND FALSE 0 !(i < size) [L104] 0 return arr; [L80] 0 a2 = create_fresh_int_array(n2) [L83] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [a1={-3:0}, a2={3:0}, n1=1, n2=1, res1=0, res2=0] [L84] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [a1={-3:0}, a2={3:0}, n1=1, n2=1, res1=0, res2=0] [L61] 2 int i = 0; [L62] EXPR 2 n2 - n1 [L62] 2 res2 = n2 - n1 VAL [a1={-3:0}, a2={3:0}, i=0, n1=1, n2=1, res1=0, res2=0] [L63] COND TRUE 2 i < n1 && i < n2 [L64] EXPR 2 a1[i] [L64] EXPR 2 a2[i] [L64] COND TRUE 2 a1[i] != a2[i] [L65] EXPR 2 a2[i] [L65] EXPR 2 a1[i] [L65] 2 a2[i] - a1[i] VAL [a1={-3:0}, a1[i]=-6, a2={3:0}, a2[i]=2147483642, i=0, n1=1, n2=1, res1=0, res2=0] - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 265 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 12264.8ms, OverallIterations: 16, TraceHistogramMax: 3, EmptinessCheckTime: 20.6ms, AutomataDifference: 927.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7554.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 413 SDtfs, 710 SDslu, 507 SDs, 0 SdLazy, 440 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 433.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 188.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 266.6ms AutomataMinimizationTime, 15 MinimizatonAttempts, 2390 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 86.3ms SsaConstructionTime, 408.0ms SatisfiabilityAnalysisTime, 847.1ms InterpolantComputationTime, 130 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 8 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 17/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-07 14:53:13,524 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...