/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-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-07 14:53:19,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-07 14:53:19,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-07 14:53:20,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-07 14:53:20,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-07 14:53:20,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-07 14:53:20,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-07 14:53:20,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-07 14:53:20,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-07 14:53:20,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-07 14:53:20,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-07 14:53:20,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-07 14:53:20,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-07 14:53:20,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-07 14:53:20,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-07 14:53:20,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-07 14:53:20,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-07 14:53:20,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-07 14:53:20,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-07 14:53:20,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-07 14:53:20,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-07 14:53:20,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-07 14:53:20,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-07 14:53:20,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-07 14:53:20,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-07 14:53:20,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-07 14:53:20,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-07 14:53:20,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-07 14:53:20,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-07 14:53:20,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-07 14:53:20,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-07 14:53:20,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-07 14:53:20,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-07 14:53:20,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-07 14:53:20,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-07 14:53:20,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-07 14:53:20,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-07 14:53:20,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-07 14:53:20,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-07 14:53:20,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-07 14:53:20,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-07 14:53:20,123 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:53:20,173 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-07 14:53:20,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-07 14:53:20,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-07 14:53:20,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-07 14:53:20,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-07 14:53:20,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-07 14:53:20,179 INFO L138 SettingsManager]: * Use SBE=true [2021-10-07 14:53:20,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-07 14:53:20,179 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-07 14:53:20,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-07 14:53:20,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-07 14:53:20,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-07 14:53:20,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-07 14:53:20,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-07 14:53:20,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-07 14:53:20,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-07 14:53:20,182 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-07 14:53:20,182 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-07 14:53:20,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-07 14:53:20,183 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-07 14:53:20,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-07 14:53:20,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-07 14:53:20,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-07 14:53:20,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-07 14:53:20,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 14:53:20,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-07 14:53:20,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-07 14:53:20,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-07 14:53:20,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-07 14:53:20,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-07 14:53:20,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-07 14:53:20,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-07 14:53:20,186 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:53:20,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-07 14:53:20,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-07 14:53:20,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-07 14:53:20,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-07 14:53:20,688 INFO L275 PluginConnector]: CDTParser initialized [2021-10-07 14:53:20,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2021-10-07 14:53:20,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3030fcd7/06af91a6554c49a7a26017ccc469ed17/FLAG85c37de1d [2021-10-07 14:53:21,483 INFO L306 CDTParser]: Found 1 translation units. [2021-10-07 14:53:21,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2021-10-07 14:53:21,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3030fcd7/06af91a6554c49a7a26017ccc469ed17/FLAG85c37de1d [2021-10-07 14:53:21,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3030fcd7/06af91a6554c49a7a26017ccc469ed17 [2021-10-07 14:53:21,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-07 14:53:21,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-07 14:53:21,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-07 14:53:21,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-07 14:53:21,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-07 14:53:21,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:53:21" (1/1) ... [2021-10-07 14:53:21,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2d457a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:21, skipping insertion in model container [2021-10-07 14:53:21,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:53:21" (1/1) ... [2021-10-07 14:53:21,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-07 14:53:21,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-07 14:53:22,084 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-name-comparator-symm.wvr.c[4220,4233] [2021-10-07 14:53:22,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 14:53:22,108 INFO L203 MainTranslator]: Completed pre-run [2021-10-07 14:53:22,143 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-name-comparator-symm.wvr.c[4220,4233] [2021-10-07 14:53:22,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 14:53:22,166 INFO L208 MainTranslator]: Completed translation [2021-10-07 14:53:22,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22 WrapperNode [2021-10-07 14:53:22,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-07 14:53:22,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-07 14:53:22,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-07 14:53:22,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-07 14:53:22,182 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:53:22" (1/1) ... [2021-10-07 14:53:22,209 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:53:22" (1/1) ... [2021-10-07 14:53:22,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-07 14:53:22,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-07 14:53:22,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-07 14:53:22,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-07 14:53:22,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-07 14:53:22,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-07 14:53:22,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-07 14:53:22,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-07 14:53:22,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (1/1) ... [2021-10-07 14:53:22,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 14:53:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:22,400 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:22,421 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:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-07 14:53:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-07 14:53:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-07 14:53:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-07 14:53:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-07 14:53:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-07 14:53:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-07 14:53:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-07 14:53:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-07 14:53:22,488 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:23,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-07 14:53:23,849 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-10-07 14:53:23,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:53:23 BoogieIcfgContainer [2021-10-07 14:53:23,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-07 14:53:23,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-07 14:53:23,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-07 14:53:23,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-07 14:53:23,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:53:21" (1/3) ... [2021-10-07 14:53:23,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2fb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:53:23, skipping insertion in model container [2021-10-07 14:53:23,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:53:22" (2/3) ... [2021-10-07 14:53:23,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2fb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:53:23, skipping insertion in model container [2021-10-07 14:53:23,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:53:23" (3/3) ... [2021-10-07 14:53:23,862 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2021-10-07 14:53:23,869 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-07 14:53:23,870 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-07 14:53:23,870 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2021-10-07 14:53:23,870 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-07 14:53:23,909 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,909 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,910 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,910 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,910 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,911 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,912 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,912 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,912 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,913 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,913 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,913 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,913 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,913 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,914 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,914 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,914 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,914 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,915 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,915 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,915 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,915 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,916 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,916 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,916 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,916 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,916 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,922 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,923 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,923 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,923 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,924 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,924 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,924 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,924 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,924 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,925 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,925 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,925 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,925 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,926 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,926 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,926 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,926 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,928 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,928 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,928 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,928 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,930 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,930 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,930 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,930 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,931 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,931 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,931 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,931 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,932 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,932 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,932 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,935 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,935 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,937 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,939 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,942 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,942 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,944 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,945 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,948 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,952 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,952 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,952 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,953 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,953 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,953 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,953 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,953 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,955 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,960 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,960 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,960 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,961 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,961 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,961 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,961 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,961 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,962 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,962 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,962 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,962 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,962 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,963 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 14:53:23,967 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-07 14:53:24,020 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-07 14:53:24,028 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:24,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2021-10-07 14:53:24,050 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-07 14:53:24,062 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 181 transitions, 378 flow [2021-10-07 14:53:24,065 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 181 transitions, 378 flow [2021-10-07 14:53:24,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 181 transitions, 378 flow [2021-10-07 14:53:24,180 INFO L129 PetriNetUnfolder]: 13/179 cut-off events. [2021-10-07 14:53:24,180 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-07 14:53:24,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 13/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 161 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2021-10-07 14:53:24,190 INFO L116 LiptonReduction]: Number of co-enabled transitions 812 [2021-10-07 14:53:35,524 INFO L131 LiptonReduction]: Checked pairs total: 991 [2021-10-07 14:53:35,524 INFO L133 LiptonReduction]: Total number of compositions: 188 [2021-10-07 14:53:35,533 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions, 78 flow [2021-10-07 14:53:35,552 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 134 states, 106 states have (on average 2.9245283018867925) internal successors, (310), 133 states have internal predecessors, (310), 0 states have call successors, (0), 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:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 106 states have (on average 2.9245283018867925) internal successors, (310), 133 states have internal predecessors, (310), 0 states have call successors, (0), 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:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 14:53:35,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:35,560 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 14:53:35,561 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash 32177, now seen corresponding path program 1 times [2021-10-07 14:53:35,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:35,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594916818] [2021-10-07 14:53:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:35,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:35,764 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:35,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:35,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594916818] [2021-10-07 14:53:35,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594916818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:35,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:35,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-07 14:53:35,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686835935] [2021-10-07 14:53:35,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:35,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:35,793 INFO L87 Difference]: Start difference. First operand has 134 states, 106 states have (on average 2.9245283018867925) internal successors, (310), 133 states have internal predecessors, (310), 0 states have call successors, (0), 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:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:35,825 INFO L93 Difference]: Finished difference Result 101 states and 234 transitions. [2021-10-07 14:53:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:35,827 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:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:35,840 INFO L225 Difference]: With dead ends: 101 [2021-10-07 14:53:35,841 INFO L226 Difference]: Without dead ends: 96 [2021-10-07 14:53:35,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-07 14:53:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-10-07 14:53:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 2.8) internal successors, (224), 95 states have internal predecessors, (224), 0 states have call successors, (0), 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:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 224 transitions. [2021-10-07 14:53:35,894 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 224 transitions. Word has length 2 [2021-10-07 14:53:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:35,894 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 224 transitions. [2021-10-07 14:53:35,895 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:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 224 transitions. [2021-10-07 14:53:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 14:53:35,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:35,896 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 14:53:35,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-07 14:53:35,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash 32175, now seen corresponding path program 1 times [2021-10-07 14:53:35,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:35,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17032522] [2021-10-07 14:53:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:35,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:35,988 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:35,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:35,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17032522] [2021-10-07 14:53:35,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17032522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:35,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:35,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-07 14:53:35,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915889389] [2021-10-07 14:53:35,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:35,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:35,999 INFO L87 Difference]: Start difference. First operand 96 states and 224 transitions. 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:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:36,029 INFO L93 Difference]: Finished difference Result 190 states and 446 transitions. [2021-10-07 14:53:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:36,030 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:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:36,034 INFO L225 Difference]: With dead ends: 190 [2021-10-07 14:53:36,035 INFO L226 Difference]: Without dead ends: 190 [2021-10-07 14:53:36,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-10-07 14:53:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 97. [2021-10-07 14:53:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 2.7901234567901234) internal successors, (226), 96 states have internal predecessors, (226), 0 states have call successors, (0), 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:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 226 transitions. [2021-10-07 14:53:36,053 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 226 transitions. Word has length 2 [2021-10-07 14:53:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:36,054 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 226 transitions. [2021-10-07 14:53:36,054 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:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 226 transitions. [2021-10-07 14:53:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-07 14:53:36,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:36,055 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-07 14:53:36,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-07 14:53:36,056 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 999220, now seen corresponding path program 1 times [2021-10-07 14:53:36,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:36,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114851364] [2021-10-07 14:53:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:36,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:36,117 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:36,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:36,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114851364] [2021-10-07 14:53:36,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114851364] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:36,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603572839] [2021-10-07 14:53:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:36,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:36,128 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:36,152 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:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:36,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 14:53:36,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:36,305 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:36,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603572839] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:36,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:36,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2021-10-07 14:53:36,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349014185] [2021-10-07 14:53:36,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 14:53:36,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 14:53:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 14:53:36,312 INFO L87 Difference]: Start difference. First operand 97 states and 226 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:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:36,357 INFO L93 Difference]: Finished difference Result 284 states and 668 transitions. [2021-10-07 14:53:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 14:53:36,362 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:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:36,370 INFO L225 Difference]: With dead ends: 284 [2021-10-07 14:53:36,370 INFO L226 Difference]: Without dead ends: 284 [2021-10-07 14:53:36,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 14:53:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-07 14:53:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 98. [2021-10-07 14:53:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 2.7804878048780486) internal successors, (228), 97 states have internal predecessors, (228), 0 states have call successors, (0), 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:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 228 transitions. [2021-10-07 14:53:36,407 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 228 transitions. Word has length 3 [2021-10-07 14:53:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:36,408 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 228 transitions. [2021-10-07 14:53:36,412 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:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 228 transitions. [2021-10-07 14:53:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 14:53:36,413 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:36,413 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-07 14:53:36,486 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:36,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:36,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash 30977615, now seen corresponding path program 2 times [2021-10-07 14:53:36,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:36,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607388383] [2021-10-07 14:53:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:36,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:36,727 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:36,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:36,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607388383] [2021-10-07 14:53:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607388383] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:36,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336087699] [2021-10-07 14:53:36,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 14:53:36,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:36,739 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:36,768 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:36,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-07 14:53:36,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:36,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-07 14:53:36,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:36,866 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:36,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336087699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:36,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:36,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-07 14:53:36,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71764147] [2021-10-07 14:53:36,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:36,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:36,869 INFO L87 Difference]: Start difference. First operand 98 states and 228 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:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:36,876 INFO L93 Difference]: Finished difference Result 97 states and 227 transitions. [2021-10-07 14:53:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:36,876 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:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:36,878 INFO L225 Difference]: With dead ends: 97 [2021-10-07 14:53:36,878 INFO L226 Difference]: Without dead ends: 97 [2021-10-07 14:53:36,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-07 14:53:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2021-10-07 14:53:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 2.7875) internal successors, (223), 94 states have internal predecessors, (223), 0 states have call successors, (0), 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:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 223 transitions. [2021-10-07 14:53:36,891 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 223 transitions. Word has length 4 [2021-10-07 14:53:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:36,891 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 223 transitions. [2021-10-07 14:53:36,891 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:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 223 transitions. [2021-10-07 14:53:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 14:53:36,892 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:36,892 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-07 14:53:36,931 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:37,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:37,107 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash 960257438, now seen corresponding path program 1 times [2021-10-07 14:53:37,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:37,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905902419] [2021-10-07 14:53:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:37,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:37,196 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:37,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:37,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905902419] [2021-10-07 14:53:37,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905902419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:37,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:37,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:37,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727716942] [2021-10-07 14:53:37,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:37,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:37,202 INFO L87 Difference]: Start difference. First operand 95 states and 223 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:37,214 INFO L93 Difference]: Finished difference Result 96 states and 224 transitions. [2021-10-07 14:53:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:37,219 INFO L225 Difference]: With dead ends: 96 [2021-10-07 14:53:37,219 INFO L226 Difference]: Without dead ends: 96 [2021-10-07 14:53:37,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-07 14:53:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-10-07 14:53:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 2.765432098765432) internal successors, (224), 95 states have internal predecessors, (224), 0 states have call successors, (0), 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:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 224 transitions. [2021-10-07 14:53:37,240 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 224 transitions. Word has length 5 [2021-10-07 14:53:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:37,240 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 224 transitions. [2021-10-07 14:53:37,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 224 transitions. [2021-10-07 14:53:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-07 14:53:37,243 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:37,244 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-07 14:53:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-07 14:53:37,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -295276039, now seen corresponding path program 1 times [2021-10-07 14:53:37,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:37,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899807781] [2021-10-07 14:53:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:37,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:37,333 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:37,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:37,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899807781] [2021-10-07 14:53:37,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899807781] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:37,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579855389] [2021-10-07 14:53:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:37,335 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:37,336 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:37,355 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:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:37,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-07 14:53:37,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:37,456 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:37,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579855389] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:37,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:37,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-10-07 14:53:37,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489547550] [2021-10-07 14:53:37,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-07 14:53:37,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:37,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-07 14:53:37,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:37,459 INFO L87 Difference]: Start difference. First operand 96 states and 224 transitions. Second operand has 6 states, 6 states have (on average 1.5) 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:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:37,475 INFO L93 Difference]: Finished difference Result 97 states and 225 transitions. [2021-10-07 14:53:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 14:53:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) 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 6 [2021-10-07 14:53:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:37,477 INFO L225 Difference]: With dead ends: 97 [2021-10-07 14:53:37,477 INFO L226 Difference]: Without dead ends: 97 [2021-10-07 14:53:37,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:37,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-07 14:53:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-10-07 14:53:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 2.7439024390243905) internal successors, (225), 96 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 14:53:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 225 transitions. [2021-10-07 14:53:37,487 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 225 transitions. Word has length 6 [2021-10-07 14:53:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:37,487 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 225 transitions. [2021-10-07 14:53:37,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) 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:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 225 transitions. [2021-10-07 14:53:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-07 14:53:37,488 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:37,488 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-10-07 14:53:37,525 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:37,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:37,704 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -562108162, now seen corresponding path program 2 times [2021-10-07 14:53:37,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:37,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947884588] [2021-10-07 14:53:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:37,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:37,763 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:37,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:37,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947884588] [2021-10-07 14:53:37,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947884588] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:37,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942795200] [2021-10-07 14:53:37,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 14:53:37,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:37,766 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:37,787 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:37,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-07 14:53:37,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:37,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-07 14:53:37,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:37,885 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:37,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942795200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:37,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-07 14:53:37,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2021-10-07 14:53:37,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020441118] [2021-10-07 14:53:37,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:37,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:37,887 INFO L87 Difference]: Start difference. First operand 97 states and 225 transitions. Second operand has 3 states, 2 states have (on average 3.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:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:37,930 INFO L93 Difference]: Finished difference Result 133 states and 322 transitions. [2021-10-07 14:53:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 7 [2021-10-07 14:53:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:37,933 INFO L225 Difference]: With dead ends: 133 [2021-10-07 14:53:37,933 INFO L226 Difference]: Without dead ends: 133 [2021-10-07 14:53:37,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-07 14:53:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2021-10-07 14:53:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 2.96875) internal successors, (285), 110 states have internal predecessors, (285), 0 states have call successors, (0), 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:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2021-10-07 14:53:37,943 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 7 [2021-10-07 14:53:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:37,944 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 285 transitions. [2021-10-07 14:53:37,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 285 transitions. [2021-10-07 14:53:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-07 14:53:37,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:37,945 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-10-07 14:53:37,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-07 14:53:38,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:38,160 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -562108143, now seen corresponding path program 1 times [2021-10-07 14:53:38,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:38,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528945456] [2021-10-07 14:53:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:38,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:38,237 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:38,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:38,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528945456] [2021-10-07 14:53:38,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528945456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:38,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:38,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:38,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015349437] [2021-10-07 14:53:38,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:38,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:38,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:38,242 INFO L87 Difference]: Start difference. First operand 111 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.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:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:38,267 INFO L93 Difference]: Finished difference Result 133 states and 308 transitions. [2021-10-07 14:53:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:38,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 7 [2021-10-07 14:53:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:38,269 INFO L225 Difference]: With dead ends: 133 [2021-10-07 14:53:38,269 INFO L226 Difference]: Without dead ends: 133 [2021-10-07 14:53:38,270 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:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-07 14:53:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2021-10-07 14:53:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 2.8229166666666665) internal successors, (271), 110 states have internal predecessors, (271), 0 states have call successors, (0), 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:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 271 transitions. [2021-10-07 14:53:38,291 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 271 transitions. Word has length 7 [2021-10-07 14:53:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:38,291 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 271 transitions. [2021-10-07 14:53:38,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 271 transitions. [2021-10-07 14:53:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-07 14:53:38,292 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:38,292 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:38,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-07 14:53:38,293 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -245482431, now seen corresponding path program 1 times [2021-10-07 14:53:38,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:38,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510443492] [2021-10-07 14:53:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:38,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:38,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:38,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510443492] [2021-10-07 14:53:38,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510443492] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:38,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695214951] [2021-10-07 14:53:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:38,348 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:38,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:38,349 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:38,355 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:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:38,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-07 14:53:38,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 14:53:38,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695214951] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:38,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:38,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-10-07 14:53:38,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515499661] [2021-10-07 14:53:38,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-07 14:53:38,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-07 14:53:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-10-07 14:53:38,484 INFO L87 Difference]: Start difference. First operand 111 states and 271 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 14:53:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:38,499 INFO L93 Difference]: Finished difference Result 112 states and 272 transitions. [2021-10-07 14:53:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-07 14:53:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:38,501 INFO L225 Difference]: With dead ends: 112 [2021-10-07 14:53:38,501 INFO L226 Difference]: Without dead ends: 112 [2021-10-07 14:53:38,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-10-07 14:53:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-07 14:53:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-10-07 14:53:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 2.804123711340206) internal successors, (272), 111 states have internal predecessors, (272), 0 states have call successors, (0), 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:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 272 transitions. [2021-10-07 14:53:38,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 272 transitions. Word has length 8 [2021-10-07 14:53:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:38,508 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 272 transitions. [2021-10-07 14:53:38,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 14:53:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 272 transitions. [2021-10-07 14:53:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-07 14:53:38,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:38,509 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:38,551 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:38,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:38,723 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1026885126, now seen corresponding path program 2 times [2021-10-07 14:53:38,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:38,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38236705] [2021-10-07 14:53:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:38,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:38,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:38,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38236705] [2021-10-07 14:53:38,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38236705] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:38,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177645103] [2021-10-07 14:53:38,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 14:53:38,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:38,778 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:38,807 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:38,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-07 14:53:38,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-07 14:53:38,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:38,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177645103] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:38,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:38,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-07 14:53:38,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260344111] [2021-10-07 14:53:38,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-07 14:53:38,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-07 14:53:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:38,897 INFO L87 Difference]: Start difference. First operand 112 states and 272 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:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:38,931 INFO L93 Difference]: Finished difference Result 170 states and 406 transitions. [2021-10-07 14:53:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:38,931 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:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:38,933 INFO L225 Difference]: With dead ends: 170 [2021-10-07 14:53:38,933 INFO L226 Difference]: Without dead ends: 170 [2021-10-07 14:53:38,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-07 14:53:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-10-07 14:53:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2021-10-07 14:53:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 2.990990990990991) internal successors, (332), 125 states have internal predecessors, (332), 0 states have call successors, (0), 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:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 332 transitions. [2021-10-07 14:53:38,941 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 332 transitions. Word has length 9 [2021-10-07 14:53:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:38,942 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 332 transitions. [2021-10-07 14:53:38,942 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:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 332 transitions. [2021-10-07 14:53:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-07 14:53:38,943 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:38,943 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:38,976 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:39,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-07 14:53:39,160 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1026885145, now seen corresponding path program 1 times [2021-10-07 14:53:39,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:39,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700573499] [2021-10-07 14:53:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:39,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:39,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:39,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700573499] [2021-10-07 14:53:39,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700573499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:39,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:39,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:39,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901523871] [2021-10-07 14:53:39,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:39,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:39,200 INFO L87 Difference]: Start difference. First operand 126 states and 332 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:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:39,217 INFO L93 Difference]: Finished difference Result 112 states and 284 transitions. [2021-10-07 14:53:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:39,217 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 9 [2021-10-07 14:53:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:39,219 INFO L225 Difference]: With dead ends: 112 [2021-10-07 14:53:39,219 INFO L226 Difference]: Without dead ends: 112 [2021-10-07 14:53:39,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-07 14:53:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-10-07 14:53:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 2.8118811881188117) internal successors, (284), 111 states have internal predecessors, (284), 0 states have call successors, (0), 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:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2021-10-07 14:53:39,228 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 9 [2021-10-07 14:53:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:39,228 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2021-10-07 14:53:39,228 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:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2021-10-07 14:53:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-07 14:53:39,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:39,229 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2021-10-07 14:53:39,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-07 14:53:39,230 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1768669241, now seen corresponding path program 3 times [2021-10-07 14:53:39,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:39,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124749295] [2021-10-07 14:53:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:39,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:39,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:39,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124749295] [2021-10-07 14:53:39,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124749295] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:39,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651976565] [2021-10-07 14:53:39,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-07 14:53:39,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:39,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 14:53:39,343 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:39,415 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:39,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-07 14:53:39,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 14:53:39,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-07 14:53:39,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 14:53:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-07 14:53:39,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651976565] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-07 14:53:39,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 14:53:39,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-07 14:53:39,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064986546] [2021-10-07 14:53:39,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-07 14:53:39,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-07 14:53:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:39,478 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 14:53:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:39,508 INFO L93 Difference]: Finished difference Result 192 states and 441 transitions. [2021-10-07 14:53:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 14:53:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-07 14:53:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:39,511 INFO L225 Difference]: With dead ends: 192 [2021-10-07 14:53:39,511 INFO L226 Difference]: Without dead ends: 192 [2021-10-07 14:53:39,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-07 14:53:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-07 14:53:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2021-10-07 14:53:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 2.869565217391304) internal successors, (330), 125 states have internal predecessors, (330), 0 states have call successors, (0), 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:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2021-10-07 14:53:39,518 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 10 [2021-10-07 14:53:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:39,518 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2021-10-07 14:53:39,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 14:53:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2021-10-07 14:53:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-07 14:53:39,520 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:39,520 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 14:53:39,558 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:39,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-07 14:53:39,735 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1773892215, now seen corresponding path program 1 times [2021-10-07 14:53:39,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:39,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892072955] [2021-10-07 14:53:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:39,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 14:53:39,767 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:39,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-07 14:53:39,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892072955] [2021-10-07 14:53:39,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892072955] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-07 14:53:39,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-07 14:53:39,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-07 14:53:39,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076268669] [2021-10-07 14:53:39,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 14:53:39,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-07 14:53:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 14:53:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 14:53:39,770 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 14:53:39,788 INFO L93 Difference]: Finished difference Result 158 states and 415 transitions. [2021-10-07 14:53:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 14:53:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 10 [2021-10-07 14:53:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 14:53:39,791 INFO L225 Difference]: With dead ends: 158 [2021-10-07 14:53:39,791 INFO L226 Difference]: Without dead ends: 158 [2021-10-07 14:53:39,791 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:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-07 14:53:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2021-10-07 14:53:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 2.962406015037594) internal successors, (394), 143 states have internal predecessors, (394), 0 states have call successors, (0), 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:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 394 transitions. [2021-10-07 14:53:39,797 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 394 transitions. Word has length 10 [2021-10-07 14:53:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 14:53:39,798 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 394 transitions. [2021-10-07 14:53:39,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 394 transitions. [2021-10-07 14:53:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-07 14:53:39,799 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 14:53:39,799 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2021-10-07 14:53:39,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-07 14:53:39,799 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-10-07 14:53:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 14:53:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1005826970, now seen corresponding path program 4 times [2021-10-07 14:53:39,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-07 14:53:39,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143521586] [2021-10-07 14:53:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 14:53:39,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-07 14:53:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 14:53:39,835 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-07 14:53:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 14:53:39,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-07 14:53:39,893 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-07 14:53:39,894 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-07 14:53:39,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-07 14:53:39,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-07 14:53:39,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-07 14:53:39,908 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-07 14:53:39,909 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-07 14:53:39,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 02:53:39 BasicIcfg [2021-10-07 14:53:39,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-07 14:53:39,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-07 14:53:39,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-07 14:53:39,965 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-07 14:53:39,966 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:23" (3/4) ... [2021-10-07 14:53:39,968 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-07 14:53:40,040 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl-name-comparator-symm.wvr.c-witness.graphml [2021-10-07 14:53:40,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-07 14:53:40,042 INFO L168 Benchmark]: Toolchain (without parser) took 18239.38 ms. Allocated memory was 162.5 MB in the beginning and 212.9 MB in the end (delta: 50.3 MB). Free memory was 136.6 MB in the beginning and 140.6 MB in the end (delta: -4.0 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,042 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 162.5 MB. Free memory was 134.4 MB in the beginning and 134.3 MB in the end (delta: 102.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-07 14:53:40,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.23 ms. Allocated memory is still 162.5 MB. Free memory was 136.2 MB in the beginning and 124.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.20 ms. Allocated memory is still 162.5 MB. Free memory was 124.6 MB in the beginning and 122.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,044 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 162.5 MB. Free memory was 122.5 MB in the beginning and 120.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,044 INFO L168 Benchmark]: RCFGBuilder took 1537.59 ms. Allocated memory is still 162.5 MB. Free memory was 120.7 MB in the beginning and 130.2 MB in the end (delta: -9.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,045 INFO L168 Benchmark]: TraceAbstraction took 16109.34 ms. Allocated memory was 162.5 MB in the beginning and 212.9 MB in the end (delta: 50.3 MB). Free memory was 129.7 MB in the beginning and 146.9 MB in the end (delta: -17.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,045 INFO L168 Benchmark]: Witness Printer took 75.50 ms. Allocated memory is still 212.9 MB. Free memory was 146.9 MB in the beginning and 140.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-10-07 14:53:40,048 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.24 ms. Allocated memory is still 162.5 MB. Free memory was 134.4 MB in the beginning and 134.3 MB in the end (delta: 102.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 354.23 ms. Allocated memory is still 162.5 MB. Free memory was 136.2 MB in the beginning and 124.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 102.20 ms. Allocated memory is still 162.5 MB. Free memory was 124.6 MB in the beginning and 122.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 162.5 MB. Free memory was 122.5 MB in the beginning and 120.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1537.59 ms. Allocated memory is still 162.5 MB. Free memory was 120.7 MB in the beginning and 130.2 MB in the end (delta: -9.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16109.34 ms. Allocated memory was 162.5 MB in the beginning and 212.9 MB in the end (delta: 50.3 MB). Free memory was 129.7 MB in the beginning and 146.9 MB in the end (delta: -17.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 8.0 GB. * Witness Printer took 75.50 ms. Allocated memory is still 212.9 MB. Free memory was 146.9 MB in the beginning and 140.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11459.1ms, 175 PlacesBefore, 35 PlacesAfterwards, 181 TransitionsBefore, 31 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 8 FixpointIterations, 136 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 0 ConcurrentYvCompositions, 10 ChoiceCompositions, 188 TotalNumberOfCompositions, 991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 887, positive: 871, positive conditional: 0, positive unconditional: 871, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 391, positive: 388, positive conditional: 0, positive unconditional: 388, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 391, positive: 388, positive conditional: 0, positive unconditional: 388, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 887, positive: 483, positive conditional: 0, positive unconditional: 483, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 391, unknown conditional: 0, unknown unconditional: 391] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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: 67]: integer overflow possible integer overflow possible We found a FailurePath: [L41] 0 int* nondet_0; [L42] 0 int name_1, name_2, result_3, i_4, current_5, break_6, result_7, i_8, current_9, break_10; [L102] 0 pthread_t t1, t2, t3; [L104] 0 int* nondet_0; [L105] 0 int ult_7, i_8, current_9, break_10; [L108] 0 name_1 = __VERIFIER_nondet_int() [L109] 0 name_2 = __VERIFIER_nondet_int() [L110] 0 result_3 = __VERIFIER_nondet_int() [L111] 0 i_4 = __VERIFIER_nondet_int() [L112] 0 current_5 = __VERIFIER_nondet_int() [L113] 0 break_6 = __VERIFIER_nondet_int() [L114] 0 result_7 = __VERIFIER_nondet_int() [L115] 0 i_8 = __VERIFIER_nondet_int() [L116] 0 current_9 = __VERIFIER_nondet_int() [L117] 0 break_10 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L136] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L137] 0 int i = 0; VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L137] COND TRUE 0 i < size [L138] 0 arr[i] = __VERIFIER_nondet_int() [L137] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L137] COND TRUE 0 i < size [L138] 0 arr[i] = __VERIFIER_nondet_int() [L137] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L137] COND TRUE 0 i < size [L138] 0 arr[i] = __VERIFIER_nondet_int() [L137] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L137] COND FALSE 0 !(i < size) [L140] 0 return arr; [L118] 0 nondet_0 = create_fresh_int_array(3) [L121] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L48] 1 i_4 = 0 [L49] 1 break_6 = 0 [L50] EXPR 1 ( name_1 == name_2 ) ? 0 : result_3 [L50] 1 result_3 = ( name_1 == name_2 ) ? 0 : result_3 [L51] EXPR 1 ( name_1 == name_2 ) ? 1 : break_6 [L51] 1 break_6 = ( name_1 == name_2 ) ? 1 : break_6 [L54] COND TRUE 1 __VERIFIER_nondet_bool() [L38] COND FALSE 1 !(!cond) [L57] EXPR 1 nondet_0[i_4] [L57] 1 current_5 = nondet_0[i_4] [L58] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L58] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L59] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L59] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L60] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L60] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L61] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L61] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L62] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-6, current_9=0, i_4=1, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L54] COND TRUE 1 __VERIFIER_nondet_bool() [L38] COND FALSE 1 !(!cond) [L57] EXPR 1 nondet_0[i_4] [L57] 1 current_5 = nondet_0[i_4] [L58] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L58] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L59] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L59] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L60] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L60] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L61] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L61] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L62] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-7, current_9=0, i_4=2, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L54] COND TRUE 1 __VERIFIER_nondet_bool() [L38] COND FALSE 1 !(!cond) [L57] EXPR 1 nondet_0[i_4] [L57] 1 current_5 = nondet_0[i_4] [L58] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L58] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L59] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L59] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L60] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L60] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L61] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L61] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L62] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-8, current_9=0, i_4=3, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L54] COND FALSE 1 !(__VERIFIER_nondet_bool()) [L38] COND FALSE 1 !(!cond) [L67] 1 ( !break_6 ) ? ( name_1 - name_2 ) : result_3 [L67] 1 name_1 - name_2 VAL [break_10=0, break_6=0, current_5=-8, current_9=0, i_4=3, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] - UnprovableResult [Line: 67]: 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: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 122]: 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, 197 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 15886.2ms, OverallIterations: 14, TraceHistogramMax: 3, EmptinessCheckTime: 15.1ms, AutomataDifference: 428.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11523.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 276 SDtfs, 253 SDslu, 344 SDs, 0 SdLazy, 109 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 173.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 125.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=13, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 190.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 449 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 123.5ms SsaConstructionTime, 515.4ms SatisfiabilityAnalysisTime, 817.7ms InterpolantComputationTime, 140 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 7 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 48/72 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:40,099 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...