/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/popl20-prod-cons-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-08 16:13:34,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-08 16:13:34,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-08 16:13:34,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-08 16:13:34,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-08 16:13:34,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-08 16:13:34,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-08 16:13:34,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-08 16:13:34,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-08 16:13:34,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-08 16:13:34,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-08 16:13:34,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-08 16:13:34,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-08 16:13:34,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-08 16:13:34,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-08 16:13:35,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-08 16:13:35,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-08 16:13:35,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-08 16:13:35,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-08 16:13:35,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-08 16:13:35,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-08 16:13:35,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-08 16:13:35,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-08 16:13:35,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-08 16:13:35,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-08 16:13:35,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-08 16:13:35,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-08 16:13:35,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-08 16:13:35,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-08 16:13:35,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-08 16:13:35,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-08 16:13:35,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-08 16:13:35,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-08 16:13:35,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-08 16:13:35,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-08 16:13:35,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-08 16:13:35,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-08 16:13:35,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-08 16:13:35,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-08 16:13:35,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-08 16:13:35,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-08 16:13:35,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-08 16:13:35,119 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-08 16:13:35,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-08 16:13:35,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-08 16:13:35,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-08 16:13:35,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-08 16:13:35,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-08 16:13:35,124 INFO L138 SettingsManager]: * Use SBE=true [2021-10-08 16:13:35,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-08 16:13:35,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-08 16:13:35,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-08 16:13:35,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-08 16:13:35,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-08 16:13:35,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-08 16:13:35,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-08 16:13:35,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-08 16:13:35,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-08 16:13:35,127 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-08 16:13:35,128 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-08 16:13:35,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-08 16:13:35,128 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-08 16:13:35,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-08 16:13:35,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-08 16:13:35,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-08 16:13:35,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-08 16:13:35,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 16:13:35,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-08 16:13:35,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-08 16:13:35,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-08 16:13:35,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-08 16:13:35,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-08 16:13:35,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-08 16:13:35,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-08 16:13:35,131 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-08 16:13:35,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-08 16:13:35,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-08 16:13:35,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-08 16:13:35,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-08 16:13:35,527 INFO L275 PluginConnector]: CDTParser initialized [2021-10-08 16:13:35,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2021-10-08 16:13:35,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abd540217/133b392c98ec4f6388262410af177c89/FLAG068f998f9 [2021-10-08 16:13:36,279 INFO L306 CDTParser]: Found 1 translation units. [2021-10-08 16:13:36,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2021-10-08 16:13:36,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abd540217/133b392c98ec4f6388262410af177c89/FLAG068f998f9 [2021-10-08 16:13:36,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abd540217/133b392c98ec4f6388262410af177c89 [2021-10-08 16:13:36,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-08 16:13:36,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-08 16:13:36,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-08 16:13:36,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-08 16:13:36,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-08 16:13:36,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 04:13:36" (1/1) ... [2021-10-08 16:13:36,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a8cbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:36, skipping insertion in model container [2021-10-08 16:13:36,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 04:13:36" (1/1) ... [2021-10-08 16:13:36,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-08 16:13:36,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-08 16:13:36,934 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/popl20-prod-cons-eq.wvr.c[4140,4153] [2021-10-08 16:13:36,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 16:13:36,957 INFO L203 MainTranslator]: Completed pre-run [2021-10-08 16:13:36,997 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/popl20-prod-cons-eq.wvr.c[4140,4153] [2021-10-08 16:13:37,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 16:13:37,031 INFO L208 MainTranslator]: Completed translation [2021-10-08 16:13:37,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37 WrapperNode [2021-10-08 16:13:37,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-08 16:13:37,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-08 16:13:37,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-08 16:13:37,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-08 16:13:37,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-08 16:13:37,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-08 16:13:37,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-08 16:13:37,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-08 16:13:37,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-08 16:13:37,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-08 16:13:37,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-08 16:13:37,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-08 16:13:37,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (1/1) ... [2021-10-08 16:13:37,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 16:13:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:13:37,243 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-08 16:13:37,271 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-08 16:13:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-08 16:13:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-08 16:13:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-08 16:13:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-08 16:13:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-08 16:13:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-08 16:13:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-08 16:13:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-08 16:13:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-08 16:13:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-08 16:13:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-08 16:13:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-08 16:13:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-08 16:13:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-08 16:13:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-08 16:13:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-08 16:13:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-08 16:13:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-08 16:13:37,357 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-08 16:13:38,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-08 16:13:38,763 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-10-08 16:13:38,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 04:13:38 BoogieIcfgContainer [2021-10-08 16:13:38,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-08 16:13:38,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-08 16:13:38,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-08 16:13:38,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-08 16:13:38,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.10 04:13:36" (1/3) ... [2021-10-08 16:13:38,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 04:13:38, skipping insertion in model container [2021-10-08 16:13:38,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 04:13:37" (2/3) ... [2021-10-08 16:13:38,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 04:13:38, skipping insertion in model container [2021-10-08 16:13:38,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 04:13:38" (3/3) ... [2021-10-08 16:13:38,776 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2021-10-08 16:13:38,782 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-08 16:13:38,783 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-08 16:13:38,783 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2021-10-08 16:13:38,783 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-08 16:13:38,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,844 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,845 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,846 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,846 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,850 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,850 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,851 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,852 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,852 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,852 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,853 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,853 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,853 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,855 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,855 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,855 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,856 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,856 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,856 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,856 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,856 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,857 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,858 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,858 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,858 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,858 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,858 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,859 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,859 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,859 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,859 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,860 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,860 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,862 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,862 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,862 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,862 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,863 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,863 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,863 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,863 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,864 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,864 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,867 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,867 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,867 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,867 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,868 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,868 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,870 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,870 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,870 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,870 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,871 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,871 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,871 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,872 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,872 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,872 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,872 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,872 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,874 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,874 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,874 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,874 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,874 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,875 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,875 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,875 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,875 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,875 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,876 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,877 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,877 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,877 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,879 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,880 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,884 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,887 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,890 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,892 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,892 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,892 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,892 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,893 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,893 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,893 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,893 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,893 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,894 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,894 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,894 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,894 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,894 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,895 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,895 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,895 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,895 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,895 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,896 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,896 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,896 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,896 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,898 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,899 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,899 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,899 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,899 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,901 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,901 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,901 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,901 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,901 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,902 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,902 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,902 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,902 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,903 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,903 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,903 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,903 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,903 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,904 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,904 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,904 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,904 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,905 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,905 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,905 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,905 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,905 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,906 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,906 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,906 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,906 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,908 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,908 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,908 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,908 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,908 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,909 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,909 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,909 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,910 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,910 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,910 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,910 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,910 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,911 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,911 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,911 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,911 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,911 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,912 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,912 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,912 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,912 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,913 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,913 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,913 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,913 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,913 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,914 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,914 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,914 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,914 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,914 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,916 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,916 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,916 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,922 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,922 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,922 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,922 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,927 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,929 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,930 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,930 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,930 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,930 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 16:13:38,939 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-08 16:13:39,004 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-08 16:13:39,019 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-08 16:13:39,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-10-08 16:13:39,048 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-08 16:13:39,061 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 399 transitions, 822 flow [2021-10-08 16:13:39,065 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 399 transitions, 822 flow [2021-10-08 16:13:39,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 372 places, 399 transitions, 822 flow [2021-10-08 16:13:39,303 INFO L129 PetriNetUnfolder]: 37/396 cut-off events. [2021-10-08 16:13:39,303 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-08 16:13:39,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 396 events. 37/396 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 562 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 321. Up to 2 conditions per place. [2021-10-08 16:13:39,319 INFO L116 LiptonReduction]: Number of co-enabled transitions 6130 [2021-10-08 16:13:58,705 INFO L131 LiptonReduction]: Checked pairs total: 10557 [2021-10-08 16:13:58,706 INFO L133 LiptonReduction]: Total number of compositions: 458 [2021-10-08 16:13:58,716 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 150 flow [2021-10-08 16:13:58,769 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 612 states, 555 states have (on average 3.601801801801802) internal successors, (1999), 611 states have internal predecessors, (1999), 0 states have call successors, (0), 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-08 16:13:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 612 states, 555 states have (on average 3.601801801801802) internal successors, (1999), 611 states have internal predecessors, (1999), 0 states have call successors, (0), 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-08 16:13:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 16:13:58,779 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:13:58,780 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 16:13:58,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:13:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:13:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 56568, now seen corresponding path program 1 times [2021-10-08 16:13:58,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:13:58,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744332570] [2021-10-08 16:13:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:13:58,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:13:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:13:59,069 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-08 16:13:59,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:13:59,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744332570] [2021-10-08 16:13:59,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744332570] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:13:59,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:13:59,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 16:13:59,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194228924] [2021-10-08 16:13:59,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:13:59,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:13:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:13:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:13:59,101 INFO L87 Difference]: Start difference. First operand has 612 states, 555 states have (on average 3.601801801801802) internal successors, (1999), 611 states have internal predecessors, (1999), 0 states have call successors, (0), 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-08 16:13:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:13:59,282 INFO L93 Difference]: Finished difference Result 631 states and 1981 transitions. [2021-10-08 16:13:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:13:59,284 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-08 16:13:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:13:59,310 INFO L225 Difference]: With dead ends: 631 [2021-10-08 16:13:59,310 INFO L226 Difference]: Without dead ends: 627 [2021-10-08 16:13:59,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:13:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-10-08 16:13:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 322. [2021-10-08 16:13:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 296 states have (on average 3.3783783783783785) internal successors, (1000), 321 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08 16:13:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1000 transitions. [2021-10-08 16:13:59,403 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1000 transitions. Word has length 2 [2021-10-08 16:13:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:13:59,404 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 1000 transitions. [2021-10-08 16:13:59,404 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-08 16:13:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1000 transitions. [2021-10-08 16:13:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 16:13:59,405 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:13:59,405 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 16:13:59,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-08 16:13:59,406 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:13:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:13:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1755337, now seen corresponding path program 1 times [2021-10-08 16:13:59,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:13:59,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651157995] [2021-10-08 16:13:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:13:59,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:13:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:13:59,520 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-08 16:13:59,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:13:59,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651157995] [2021-10-08 16:13:59,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651157995] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:13:59,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293170439] [2021-10-08 16:13:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:13:59,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:13:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:13:59,530 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-08 16:13:59,555 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-08 16:13:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:13:59,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:13:59,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:13:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:13:59,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293170439] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:13:59,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:13:59,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-08 16:13:59,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713446045] [2021-10-08 16:13:59,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:13:59,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:13:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:13:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:13:59,681 INFO L87 Difference]: Start difference. First operand 322 states and 1000 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-08 16:13:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:13:59,801 INFO L93 Difference]: Finished difference Result 623 states and 1967 transitions. [2021-10-08 16:13:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:13:59,806 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-08 16:13:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:13:59,822 INFO L225 Difference]: With dead ends: 623 [2021-10-08 16:13:59,822 INFO L226 Difference]: Without dead ends: 623 [2021-10-08 16:13:59,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:13:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-10-08 16:13:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 318. [2021-10-08 16:13:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 296 states have (on average 3.364864864864865) internal successors, (996), 317 states have internal predecessors, (996), 0 states have call successors, (0), 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-08 16:13:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 996 transitions. [2021-10-08 16:13:59,870 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 996 transitions. Word has length 3 [2021-10-08 16:13:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:13:59,871 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 996 transitions. [2021-10-08 16:13:59,871 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-08 16:13:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 996 transitions. [2021-10-08 16:13:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 16:13:59,872 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:13:59,872 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 16:13:59,918 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-08 16:14:00,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:00,086 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1755338, now seen corresponding path program 1 times [2021-10-08 16:14:00,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:00,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297417555] [2021-10-08 16:14:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:00,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:00,170 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-08 16:14:00,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:00,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297417555] [2021-10-08 16:14:00,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297417555] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:00,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539509432] [2021-10-08 16:14:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:00,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:00,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:00,176 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-08 16:14:00,195 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-08 16:14:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:00,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:00,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:00,295 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-08 16:14:00,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539509432] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:00,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:00,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-08 16:14:00,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184859262] [2021-10-08 16:14:00,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 16:14:00,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 16:14:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:00,301 INFO L87 Difference]: Start difference. First operand 318 states and 996 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:00,442 INFO L93 Difference]: Finished difference Result 932 states and 2948 transitions. [2021-10-08 16:14:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:14:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-08 16:14:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:00,453 INFO L225 Difference]: With dead ends: 932 [2021-10-08 16:14:00,454 INFO L226 Difference]: Without dead ends: 932 [2021-10-08 16:14:00,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-10-08 16:14:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 322. [2021-10-08 16:14:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 300 states have (on average 3.3533333333333335) internal successors, (1006), 321 states have internal predecessors, (1006), 0 states have call successors, (0), 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-08 16:14:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1006 transitions. [2021-10-08 16:14:00,485 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1006 transitions. Word has length 3 [2021-10-08 16:14:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:00,486 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 1006 transitions. [2021-10-08 16:14:00,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1006 transitions. [2021-10-08 16:14:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 16:14:00,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:00,487 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-08 16:14:00,526 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-08 16:14:00,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:00,701 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 54417177, now seen corresponding path program 2 times [2021-10-08 16:14:00,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:00,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618020049] [2021-10-08 16:14:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:00,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:00,791 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-08 16:14:00,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:00,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618020049] [2021-10-08 16:14:00,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618020049] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:00,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135144901] [2021-10-08 16:14:00,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:00,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:00,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:00,799 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-08 16:14:00,802 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-08 16:14:00,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:00,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:00,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:00,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:00,899 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-08 16:14:00,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135144901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:00,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:00,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-08 16:14:00,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504621885] [2021-10-08 16:14:00,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:00,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:00,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:00,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 16:14:00,902 INFO L87 Difference]: Start difference. First operand 322 states and 1006 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-08 16:14:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:00,934 INFO L93 Difference]: Finished difference Result 321 states and 1005 transitions. [2021-10-08 16:14:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:00,934 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-08 16:14:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:00,938 INFO L225 Difference]: With dead ends: 321 [2021-10-08 16:14:00,938 INFO L226 Difference]: Without dead ends: 321 [2021-10-08 16:14:00,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 16:14:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-08 16:14:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2021-10-08 16:14:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 298 states have (on average 3.359060402684564) internal successors, (1001), 318 states have internal predecessors, (1001), 0 states have call successors, (0), 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-08 16:14:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1001 transitions. [2021-10-08 16:14:00,953 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 1001 transitions. Word has length 4 [2021-10-08 16:14:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:00,954 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 1001 transitions. [2021-10-08 16:14:00,954 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-08 16:14:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 1001 transitions. [2021-10-08 16:14:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-08 16:14:00,955 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:00,955 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2021-10-08 16:14:00,993 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-08 16:14:01,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:01,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1688654091, now seen corresponding path program 1 times [2021-10-08 16:14:01,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:01,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601989373] [2021-10-08 16:14:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:01,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:01,230 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-08 16:14:01,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:01,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601989373] [2021-10-08 16:14:01,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601989373] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:01,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833919570] [2021-10-08 16:14:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:01,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:01,233 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-08 16:14:01,251 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-08 16:14:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:01,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-08 16:14:01,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:01,337 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-08 16:14:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833919570] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:01,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:01,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-08 16:14:01,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122890813] [2021-10-08 16:14:01,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-08 16:14:01,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-08 16:14:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-08 16:14:01,340 INFO L87 Difference]: Start difference. First operand 319 states and 1001 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:01,466 INFO L93 Difference]: Finished difference Result 1240 states and 3928 transitions. [2021-10-08 16:14:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-08 16:14:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:01,484 INFO L225 Difference]: With dead ends: 1240 [2021-10-08 16:14:01,485 INFO L226 Difference]: Without dead ends: 1240 [2021-10-08 16:14:01,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-08 16:14:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2021-10-08 16:14:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 322. [2021-10-08 16:14:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 301 states have (on average 3.352159468438538) internal successors, (1009), 321 states have internal predecessors, (1009), 0 states have call successors, (0), 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-08 16:14:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1009 transitions. [2021-10-08 16:14:01,511 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1009 transitions. Word has length 5 [2021-10-08 16:14:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:01,511 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 1009 transitions. [2021-10-08 16:14:01,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1009 transitions. [2021-10-08 16:14:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-08 16:14:01,512 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:01,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-08 16:14:01,546 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-08 16:14:01,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:01,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:01,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1688670699, now seen corresponding path program 1 times [2021-10-08 16:14:01,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:01,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465513531] [2021-10-08 16:14:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:01,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:01,770 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-08 16:14:01,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:01,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465513531] [2021-10-08 16:14:01,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465513531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:01,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:01,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 16:14:01,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104217044] [2021-10-08 16:14:01,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:01,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:01,773 INFO L87 Difference]: Start difference. First operand 322 states and 1009 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:01,791 INFO L93 Difference]: Finished difference Result 630 states and 1995 transitions. [2021-10-08 16:14:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-08 16:14:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:01,798 INFO L225 Difference]: With dead ends: 630 [2021-10-08 16:14:01,798 INFO L226 Difference]: Without dead ends: 630 [2021-10-08 16:14:01,799 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-08 16:14:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-10-08 16:14:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 323. [2021-10-08 16:14:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 302 states have (on average 3.347682119205298) internal successors, (1011), 322 states have internal predecessors, (1011), 0 states have call successors, (0), 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-08 16:14:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1011 transitions. [2021-10-08 16:14:01,815 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 1011 transitions. Word has length 5 [2021-10-08 16:14:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:01,816 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 1011 transitions. [2021-10-08 16:14:01,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 1011 transitions. [2021-10-08 16:14:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-08 16:14:01,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:01,817 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2021-10-08 16:14:01,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-08 16:14:01,817 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 808671830, now seen corresponding path program 2 times [2021-10-08 16:14:01,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:01,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931146682] [2021-10-08 16:14:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:01,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:01,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:01,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931146682] [2021-10-08 16:14:01,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931146682] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:01,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857358457] [2021-10-08 16:14:01,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:01,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:01,876 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-08 16:14:01,884 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-08 16:14:01,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:01,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:01,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:01,992 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-08 16:14:01,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857358457] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:01,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:01,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2021-10-08 16:14:01,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289844068] [2021-10-08 16:14:01,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:01,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:01,994 INFO L87 Difference]: Start difference. First operand 323 states and 1011 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:02,039 INFO L93 Difference]: Finished difference Result 322 states and 1010 transitions. [2021-10-08 16:14:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:14:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-08 16:14:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:02,043 INFO L225 Difference]: With dead ends: 322 [2021-10-08 16:14:02,043 INFO L226 Difference]: Without dead ends: 322 [2021-10-08 16:14:02,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-08 16:14:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-08 16:14:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2021-10-08 16:14:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 299 states have (on average 3.3578595317725752) internal successors, (1004), 318 states have internal predecessors, (1004), 0 states have call successors, (0), 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-08 16:14:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1004 transitions. [2021-10-08 16:14:02,057 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 1004 transitions. Word has length 6 [2021-10-08 16:14:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:02,058 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 1004 transitions. [2021-10-08 16:14:02,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 1004 transitions. [2021-10-08 16:14:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-08 16:14:02,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:02,059 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-08 16:14:02,094 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-08 16:14:02,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:02,273 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 809186918, now seen corresponding path program 1 times [2021-10-08 16:14:02,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:02,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305894779] [2021-10-08 16:14:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:02,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:02,317 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-08 16:14:02,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:02,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305894779] [2021-10-08 16:14:02,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305894779] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:02,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824919635] [2021-10-08 16:14:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:02,319 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:02,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:02,320 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-08 16:14:02,356 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-08 16:14:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:02,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-08 16:14:02,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:02,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824919635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:02,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:02,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2021-10-08 16:14:02,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820124180] [2021-10-08 16:14:02,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 16:14:02,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 16:14:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-08 16:14:02,495 INFO L87 Difference]: Start difference. First operand 319 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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-08 16:14:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:02,651 INFO L93 Difference]: Finished difference Result 936 states and 2776 transitions. [2021-10-08 16:14:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 16:14:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-08 16:14:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:02,660 INFO L225 Difference]: With dead ends: 936 [2021-10-08 16:14:02,660 INFO L226 Difference]: Without dead ends: 936 [2021-10-08 16:14:02,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-08 16:14:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-08 16:14:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 533. [2021-10-08 16:14:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 513 states have (on average 3.2514619883040936) internal successors, (1668), 532 states have internal predecessors, (1668), 0 states have call successors, (0), 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-08 16:14:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1668 transitions. [2021-10-08 16:14:02,689 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1668 transitions. Word has length 6 [2021-10-08 16:14:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:02,689 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1668 transitions. [2021-10-08 16:14:02,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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-08 16:14:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1668 transitions. [2021-10-08 16:14:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 16:14:02,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:02,690 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:02,726 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-08 16:14:02,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:02,905 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -700459397, now seen corresponding path program 1 times [2021-10-08 16:14:02,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:02,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122094720] [2021-10-08 16:14:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:02,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:02,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:02,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122094720] [2021-10-08 16:14:02,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122094720] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:02,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853206006] [2021-10-08 16:14:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:02,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:02,951 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-08 16:14:02,969 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-08 16:14:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:03,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:03,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:03,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853206006] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:03,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:03,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-08 16:14:03,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982208122] [2021-10-08 16:14:03,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 16:14:03,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 16:14:03,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:03,100 INFO L87 Difference]: Start difference. First operand 533 states and 1668 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-08 16:14:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:03,133 INFO L93 Difference]: Finished difference Result 1148 states and 3639 transitions. [2021-10-08 16:14:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:03,134 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 7 [2021-10-08 16:14:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:03,144 INFO L225 Difference]: With dead ends: 1148 [2021-10-08 16:14:03,145 INFO L226 Difference]: Without dead ends: 1148 [2021-10-08 16:14:03,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-10-08 16:14:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 534. [2021-10-08 16:14:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 514 states have (on average 3.2509727626459144) internal successors, (1671), 533 states have internal predecessors, (1671), 0 states have call successors, (0), 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-08 16:14:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1671 transitions. [2021-10-08 16:14:03,177 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1671 transitions. Word has length 7 [2021-10-08 16:14:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:03,177 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1671 transitions. [2021-10-08 16:14:03,178 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-08 16:14:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1671 transitions. [2021-10-08 16:14:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 16:14:03,178 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:03,178 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:03,214 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-08 16:14:03,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:03,395 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash -700459360, now seen corresponding path program 1 times [2021-10-08 16:14:03,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:03,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808181836] [2021-10-08 16:14:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:03,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:03,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:03,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808181836] [2021-10-08 16:14:03,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808181836] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:03,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755947436] [2021-10-08 16:14:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:03,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:03,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:03,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:03,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-08 16:14:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:03,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-08 16:14:03,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:03,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755947436] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:03,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:03,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 8 [2021-10-08 16:14:03,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477399898] [2021-10-08 16:14:03,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 16:14:03,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 16:14:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-08 16:14:03,623 INFO L87 Difference]: Start difference. First operand 534 states and 1671 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:03,875 INFO L93 Difference]: Finished difference Result 2064 states and 6379 transitions. [2021-10-08 16:14:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 16:14:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:03,895 INFO L225 Difference]: With dead ends: 2064 [2021-10-08 16:14:03,895 INFO L226 Difference]: Without dead ends: 2064 [2021-10-08 16:14:03,896 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 108.8ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-10-08 16:14:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2021-10-08 16:14:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 540. [2021-10-08 16:14:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 521 states have (on average 3.230326295585413) internal successors, (1683), 539 states have internal predecessors, (1683), 0 states have call successors, (0), 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-08 16:14:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1683 transitions. [2021-10-08 16:14:03,936 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1683 transitions. Word has length 7 [2021-10-08 16:14:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:03,937 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 1683 transitions. [2021-10-08 16:14:03,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1683 transitions. [2021-10-08 16:14:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 16:14:03,938 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:03,938 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:03,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:04,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-08 16:14:04,154 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -684938755, now seen corresponding path program 1 times [2021-10-08 16:14:04,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:04,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412822623] [2021-10-08 16:14:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:04,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:04,219 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-08 16:14:04,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:04,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412822623] [2021-10-08 16:14:04,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412822623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:04,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:04,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 16:14:04,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086845336] [2021-10-08 16:14:04,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:04,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:04,222 INFO L87 Difference]: Start difference. First operand 540 states and 1683 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-08 16:14:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:04,258 INFO L93 Difference]: Finished difference Result 1053 states and 3303 transitions. [2021-10-08 16:14:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-08 16:14:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:04,269 INFO L225 Difference]: With dead ends: 1053 [2021-10-08 16:14:04,269 INFO L226 Difference]: Without dead ends: 1053 [2021-10-08 16:14:04,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-10-08 16:14:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 550. [2021-10-08 16:14:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 531 states have (on average 3.2109227871939736) internal successors, (1705), 549 states have internal predecessors, (1705), 0 states have call successors, (0), 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-08 16:14:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1705 transitions. [2021-10-08 16:14:04,304 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1705 transitions. Word has length 7 [2021-10-08 16:14:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:04,305 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1705 transitions. [2021-10-08 16:14:04,305 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-08 16:14:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1705 transitions. [2021-10-08 16:14:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 16:14:04,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:04,307 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2021-10-08 16:14:04,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-08 16:14:04,307 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash -686352090, now seen corresponding path program 1 times [2021-10-08 16:14:04,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:04,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130885446] [2021-10-08 16:14:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:04,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:04,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:04,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130885446] [2021-10-08 16:14:04,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130885446] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:04,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041138778] [2021-10-08 16:14:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:04,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:04,381 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:04,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-08 16:14:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:04,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:04,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:04,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041138778] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:04,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:04,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-08 16:14:04,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936261145] [2021-10-08 16:14:04,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-08 16:14:04,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-08 16:14:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-08 16:14:04,509 INFO L87 Difference]: Start difference. First operand 550 states and 1705 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-08 16:14:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:04,674 INFO L93 Difference]: Finished difference Result 2623 states and 8203 transitions. [2021-10-08 16:14:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-08 16:14:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 7 [2021-10-08 16:14:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:04,700 INFO L225 Difference]: With dead ends: 2623 [2021-10-08 16:14:04,700 INFO L226 Difference]: Without dead ends: 2623 [2021-10-08 16:14:04,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-08 16:14:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-10-08 16:14:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 557. [2021-10-08 16:14:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 538 states have (on average 3.2026022304832713) internal successors, (1723), 556 states have internal predecessors, (1723), 0 states have call successors, (0), 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-08 16:14:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1723 transitions. [2021-10-08 16:14:04,751 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1723 transitions. Word has length 7 [2021-10-08 16:14:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:04,751 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1723 transitions. [2021-10-08 16:14:04,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-08 16:14:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1723 transitions. [2021-10-08 16:14:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 16:14:04,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:04,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:04,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:04,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:04,969 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 241567426, now seen corresponding path program 1 times [2021-10-08 16:14:04,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:04,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140322032] [2021-10-08 16:14:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:04,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:05,005 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-08 16:14:05,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:05,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140322032] [2021-10-08 16:14:05,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140322032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:05,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:05,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 16:14:05,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202961917] [2021-10-08 16:14:05,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:05,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,008 INFO L87 Difference]: Start difference. First operand 557 states and 1723 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:05,077 INFO L93 Difference]: Finished difference Result 695 states and 2108 transitions. [2021-10-08 16:14:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-08 16:14:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:05,083 INFO L225 Difference]: With dead ends: 695 [2021-10-08 16:14:05,084 INFO L226 Difference]: Without dead ends: 659 [2021-10-08 16:14:05,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-10-08 16:14:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 639. [2021-10-08 16:14:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 618 states have (on average 3.2168284789644015) internal successors, (1988), 638 states have internal predecessors, (1988), 0 states have call successors, (0), 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-08 16:14:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1988 transitions. [2021-10-08 16:14:05,110 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1988 transitions. Word has length 8 [2021-10-08 16:14:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:05,111 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 1988 transitions. [2021-10-08 16:14:05,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1988 transitions. [2021-10-08 16:14:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 16:14:05,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:05,112 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:05,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-08 16:14:05,113 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 241567428, now seen corresponding path program 1 times [2021-10-08 16:14:05,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:05,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402295273] [2021-10-08 16:14:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:05,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:05,148 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-08 16:14:05,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:05,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402295273] [2021-10-08 16:14:05,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402295273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:05,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:05,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 16:14:05,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233512754] [2021-10-08 16:14:05,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:05,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,151 INFO L87 Difference]: Start difference. First operand 639 states and 1988 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:05,180 INFO L93 Difference]: Finished difference Result 625 states and 1917 transitions. [2021-10-08 16:14:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-08 16:14:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:05,185 INFO L225 Difference]: With dead ends: 625 [2021-10-08 16:14:05,186 INFO L226 Difference]: Without dead ends: 625 [2021-10-08 16:14:05,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-10-08 16:14:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 615. [2021-10-08 16:14:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 595 states have (on average 3.2) internal successors, (1904), 614 states have internal predecessors, (1904), 0 states have call successors, (0), 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-08 16:14:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1904 transitions. [2021-10-08 16:14:05,211 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1904 transitions. Word has length 8 [2021-10-08 16:14:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:05,212 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 1904 transitions. [2021-10-08 16:14:05,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1904 transitions. [2021-10-08 16:14:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 16:14:05,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:05,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:05,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-08 16:14:05,214 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 241567424, now seen corresponding path program 1 times [2021-10-08 16:14:05,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:05,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093859191] [2021-10-08 16:14:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:05,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:05,250 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-08 16:14:05,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:05,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093859191] [2021-10-08 16:14:05,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093859191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:05,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:05,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 16:14:05,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250066315] [2021-10-08 16:14:05,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:05,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:05,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:05,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,252 INFO L87 Difference]: Start difference. First operand 615 states and 1904 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:05,279 INFO L93 Difference]: Finished difference Result 591 states and 1820 transitions. [2021-10-08 16:14:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-08 16:14:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:05,284 INFO L225 Difference]: With dead ends: 591 [2021-10-08 16:14:05,284 INFO L226 Difference]: Without dead ends: 591 [2021-10-08 16:14:05,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-10-08 16:14:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2021-10-08 16:14:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 572 states have (on average 3.1818181818181817) internal successors, (1820), 590 states have internal predecessors, (1820), 0 states have call successors, (0), 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-08 16:14:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1820 transitions. [2021-10-08 16:14:05,307 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1820 transitions. Word has length 8 [2021-10-08 16:14:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:05,307 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 1820 transitions. [2021-10-08 16:14:05,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 16:14:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1820 transitions. [2021-10-08 16:14:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 16:14:05,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:05,308 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2021-10-08 16:14:05,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-08 16:14:05,309 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash 197924876, now seen corresponding path program 2 times [2021-10-08 16:14:05,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:05,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090861252] [2021-10-08 16:14:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:05,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:05,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:05,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090861252] [2021-10-08 16:14:05,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090861252] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:05,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840515663] [2021-10-08 16:14:05,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:05,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:05,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-08 16:14:05,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:05,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:05,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:05,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-08 16:14:05,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840515663] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:05,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:05,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2021-10-08 16:14:05,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618303962] [2021-10-08 16:14:05,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:05,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-08 16:14:05,491 INFO L87 Difference]: Start difference. First operand 591 states and 1820 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:05,556 INFO L93 Difference]: Finished difference Result 934 states and 2882 transitions. [2021-10-08 16:14:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:14:05,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-08 16:14:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:05,574 INFO L225 Difference]: With dead ends: 934 [2021-10-08 16:14:05,574 INFO L226 Difference]: Without dead ends: 934 [2021-10-08 16:14:05,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-10-08 16:14:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-10-08 16:14:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 482. [2021-10-08 16:14:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 469 states have (on average 3.1513859275053306) internal successors, (1478), 481 states have internal predecessors, (1478), 0 states have call successors, (0), 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-08 16:14:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1478 transitions. [2021-10-08 16:14:05,600 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1478 transitions. Word has length 8 [2021-10-08 16:14:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:05,600 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 1478 transitions. [2021-10-08 16:14:05,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1478 transitions. [2021-10-08 16:14:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 16:14:05,601 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:05,601 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-08 16:14:05,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:05,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-08 16:14:05,816 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash 689435307, now seen corresponding path program 2 times [2021-10-08 16:14:05,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:05,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269359606] [2021-10-08 16:14:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:05,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 16:14:05,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:05,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269359606] [2021-10-08 16:14:05,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269359606] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:05,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632663231] [2021-10-08 16:14:05,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:05,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:05,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:05,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-08 16:14:05,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:05,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:05,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:05,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:06,011 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-08 16:14:06,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632663231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:06,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:06,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2021-10-08 16:14:06,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039796734] [2021-10-08 16:14:06,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:06,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-08 16:14:06,013 INFO L87 Difference]: Start difference. First operand 482 states and 1478 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-08 16:14:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:06,034 INFO L93 Difference]: Finished difference Result 481 states and 1477 transitions. [2021-10-08 16:14:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:14:06,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-08 16:14:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:06,038 INFO L225 Difference]: With dead ends: 481 [2021-10-08 16:14:06,038 INFO L226 Difference]: Without dead ends: 481 [2021-10-08 16:14:06,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-08 16:14:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2021-10-08 16:14:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 467 states have (on average 3.154175588865096) internal successors, (1473), 478 states have internal predecessors, (1473), 0 states have call successors, (0), 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-08 16:14:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1473 transitions. [2021-10-08 16:14:06,056 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1473 transitions. Word has length 9 [2021-10-08 16:14:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:06,056 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 1473 transitions. [2021-10-08 16:14:06,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-08 16:14:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1473 transitions. [2021-10-08 16:14:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 16:14:06,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:06,057 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:06,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:06,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:06,271 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1096090778, now seen corresponding path program 1 times [2021-10-08 16:14:06,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:06,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421440161] [2021-10-08 16:14:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:06,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:06,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:06,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421440161] [2021-10-08 16:14:06,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421440161] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:06,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140999144] [2021-10-08 16:14:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:06,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:06,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:06,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-08 16:14:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:06,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:06,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:06,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140999144] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:06,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:06,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-08 16:14:06,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860140663] [2021-10-08 16:14:06,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 16:14:06,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 16:14:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:06,485 INFO L87 Difference]: Start difference. First operand 479 states and 1473 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:06,526 INFO L93 Difference]: Finished difference Result 1373 states and 4269 transitions. [2021-10-08 16:14:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-08 16:14:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:06,533 INFO L225 Difference]: With dead ends: 1373 [2021-10-08 16:14:06,533 INFO L226 Difference]: Without dead ends: 1373 [2021-10-08 16:14:06,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-10-08 16:14:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 491. [2021-10-08 16:14:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 479 states have (on average 3.150313152400835) internal successors, (1509), 490 states have internal predecessors, (1509), 0 states have call successors, (0), 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-08 16:14:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1509 transitions. [2021-10-08 16:14:06,562 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1509 transitions. Word has length 9 [2021-10-08 16:14:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:06,562 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 1509 transitions. [2021-10-08 16:14:06,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1509 transitions. [2021-10-08 16:14:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 16:14:06,563 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:06,563 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:06,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:06,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-08 16:14:06,777 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1096090776, now seen corresponding path program 1 times [2021-10-08 16:14:06,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:06,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692706266] [2021-10-08 16:14:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:06,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:06,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:06,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692706266] [2021-10-08 16:14:06,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692706266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:06,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:06,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 16:14:06,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583538720] [2021-10-08 16:14:06,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:06,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:06,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:06,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:06,817 INFO L87 Difference]: Start difference. First operand 491 states and 1509 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:06,836 INFO L93 Difference]: Finished difference Result 490 states and 1489 transitions. [2021-10-08 16:14:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-08 16:14:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:06,840 INFO L225 Difference]: With dead ends: 490 [2021-10-08 16:14:06,840 INFO L226 Difference]: Without dead ends: 490 [2021-10-08 16:14:06,840 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-08 16:14:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-08 16:14:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2021-10-08 16:14:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 479 states have (on average 3.1085594989561587) internal successors, (1489), 489 states have internal predecessors, (1489), 0 states have call successors, (0), 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-08 16:14:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1489 transitions. [2021-10-08 16:14:06,858 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1489 transitions. Word has length 9 [2021-10-08 16:14:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:06,858 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1489 transitions. [2021-10-08 16:14:06,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1489 transitions. [2021-10-08 16:14:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-08 16:14:06,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:06,860 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:06,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-08 16:14:06,860 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1076193649, now seen corresponding path program 2 times [2021-10-08 16:14:06,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:06,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762848940] [2021-10-08 16:14:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:06,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:06,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:06,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762848940] [2021-10-08 16:14:06,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762848940] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:06,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124685894] [2021-10-08 16:14:06,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:06,909 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:06,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:06,910 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:06,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-08 16:14:07,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:07,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:07,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:07,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 16:14:07,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124685894] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:07,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:07,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2021-10-08 16:14:07,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050074222] [2021-10-08 16:14:07,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-08 16:14:07,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-08 16:14:07,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-08 16:14:07,089 INFO L87 Difference]: Start difference. First operand 490 states and 1489 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:07,206 INFO L93 Difference]: Finished difference Result 2266 states and 7029 transitions. [2021-10-08 16:14:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 16:14:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-08 16:14:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:07,218 INFO L225 Difference]: With dead ends: 2266 [2021-10-08 16:14:07,218 INFO L226 Difference]: Without dead ends: 2266 [2021-10-08 16:14:07,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-10-08 16:14:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2021-10-08 16:14:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 465. [2021-10-08 16:14:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 3.1362637362637362) internal successors, (1427), 464 states have internal predecessors, (1427), 0 states have call successors, (0), 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-08 16:14:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1427 transitions. [2021-10-08 16:14:07,257 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1427 transitions. Word has length 11 [2021-10-08 16:14:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:07,257 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 1427 transitions. [2021-10-08 16:14:07,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1427 transitions. [2021-10-08 16:14:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-08 16:14:07,258 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:07,258 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:07,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:07,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-10-08 16:14:07,472 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1069245161, now seen corresponding path program 1 times [2021-10-08 16:14:07,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:07,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448616599] [2021-10-08 16:14:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:07,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:07,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:07,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448616599] [2021-10-08 16:14:07,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448616599] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:07,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295462105] [2021-10-08 16:14:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:07,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:07,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:07,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:07,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-08 16:14:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:07,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-08 16:14:07,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:07,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295462105] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:07,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:07,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-10-08 16:14:07,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839358841] [2021-10-08 16:14:07,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 16:14:07,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:07,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 16:14:07,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:07,692 INFO L87 Difference]: Start difference. First operand 465 states and 1427 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:07,840 INFO L93 Difference]: Finished difference Result 2720 states and 8427 transitions. [2021-10-08 16:14:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 16:14:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 11 [2021-10-08 16:14:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:07,853 INFO L225 Difference]: With dead ends: 2720 [2021-10-08 16:14:07,854 INFO L226 Difference]: Without dead ends: 2720 [2021-10-08 16:14:07,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2021-10-08 16:14:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 467. [2021-10-08 16:14:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 457 states have (on average 3.1312910284463893) internal successors, (1431), 466 states have internal predecessors, (1431), 0 states have call successors, (0), 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-08 16:14:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1431 transitions. [2021-10-08 16:14:07,899 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1431 transitions. Word has length 11 [2021-10-08 16:14:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:07,899 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 1431 transitions. [2021-10-08 16:14:07,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1431 transitions. [2021-10-08 16:14:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-08 16:14:07,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:07,900 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:07,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:08,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:08,115 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash -710056034, now seen corresponding path program 1 times [2021-10-08 16:14:08,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:08,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701103210] [2021-10-08 16:14:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:08,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:08,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:08,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701103210] [2021-10-08 16:14:08,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701103210] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:08,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:08,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 16:14:08,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266471072] [2021-10-08 16:14:08,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:08,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-08 16:14:08,165 INFO L87 Difference]: Start difference. First operand 467 states and 1431 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:08,228 INFO L93 Difference]: Finished difference Result 574 states and 1615 transitions. [2021-10-08 16:14:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-08 16:14:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:08,231 INFO L225 Difference]: With dead ends: 574 [2021-10-08 16:14:08,231 INFO L226 Difference]: Without dead ends: 502 [2021-10-08 16:14:08,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-10-08 16:14:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 484. [2021-10-08 16:14:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 474 states have (on average 3.088607594936709) internal successors, (1464), 483 states have internal predecessors, (1464), 0 states have call successors, (0), 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-08 16:14:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1464 transitions. [2021-10-08 16:14:08,248 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1464 transitions. Word has length 12 [2021-10-08 16:14:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:08,249 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 1464 transitions. [2021-10-08 16:14:08,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1464 transitions. [2021-10-08 16:14:08,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-08 16:14:08,250 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:08,250 INFO L512 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:08,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-08 16:14:08,250 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1213141508, now seen corresponding path program 2 times [2021-10-08 16:14:08,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:08,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962889000] [2021-10-08 16:14:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:08,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 16:14:08,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:08,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962889000] [2021-10-08 16:14:08,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962889000] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:08,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612783341] [2021-10-08 16:14:08,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:08,316 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:08,317 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:08,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-08 16:14:08,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 16:14:08,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:08,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:08,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-08 16:14:08,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612783341] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:08,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 16:14:08,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 9 [2021-10-08 16:14:08,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824542284] [2021-10-08 16:14:08,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:08,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-08 16:14:08,475 INFO L87 Difference]: Start difference. First operand 484 states and 1464 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-08 16:14:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:08,529 INFO L93 Difference]: Finished difference Result 926 states and 2846 transitions. [2021-10-08 16:14:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 16:14:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 12 [2021-10-08 16:14:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:08,533 INFO L225 Difference]: With dead ends: 926 [2021-10-08 16:14:08,534 INFO L226 Difference]: Without dead ends: 909 [2021-10-08 16:14:08,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-08 16:14:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-10-08 16:14:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 457. [2021-10-08 16:14:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 448 states have (on average 3.1473214285714284) internal successors, (1410), 456 states have internal predecessors, (1410), 0 states have call successors, (0), 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-08 16:14:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1410 transitions. [2021-10-08 16:14:08,556 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1410 transitions. Word has length 12 [2021-10-08 16:14:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:08,556 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 1410 transitions. [2021-10-08 16:14:08,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-08 16:14:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1410 transitions. [2021-10-08 16:14:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-08 16:14:08,557 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:08,557 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:08,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:08,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:08,771 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -917274065, now seen corresponding path program 1 times [2021-10-08 16:14:08,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:08,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157214578] [2021-10-08 16:14:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:08,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:08,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:08,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157214578] [2021-10-08 16:14:08,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157214578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:08,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:08,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-08 16:14:08,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544403829] [2021-10-08 16:14:08,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 16:14:08,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 16:14:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-08 16:14:08,820 INFO L87 Difference]: Start difference. First operand 457 states and 1410 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:08,876 INFO L93 Difference]: Finished difference Result 544 states and 1568 transitions. [2021-10-08 16:14:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-08 16:14:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:08,878 INFO L225 Difference]: With dead ends: 544 [2021-10-08 16:14:08,878 INFO L226 Difference]: Without dead ends: 460 [2021-10-08 16:14:08,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-10-08 16:14:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2021-10-08 16:14:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 451 states have (on average 3.1330376940133036) internal successors, (1413), 459 states have internal predecessors, (1413), 0 states have call successors, (0), 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-08 16:14:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1413 transitions. [2021-10-08 16:14:08,894 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1413 transitions. Word has length 13 [2021-10-08 16:14:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:08,895 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1413 transitions. [2021-10-08 16:14:08,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 16:14:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1413 transitions. [2021-10-08 16:14:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-08 16:14:08,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:08,896 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:08,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-08 16:14:08,896 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -369164281, now seen corresponding path program 1 times [2021-10-08 16:14:08,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:08,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000482291] [2021-10-08 16:14:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:08,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-08 16:14:08,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:08,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000482291] [2021-10-08 16:14:08,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000482291] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:08,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221627667] [2021-10-08 16:14:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:08,940 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:08,941 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:08,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-08 16:14:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:09,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-08 16:14:09,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:09,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221627667] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:09,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:09,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5] total 7 [2021-10-08 16:14:09,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776495306] [2021-10-08 16:14:09,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 16:14:09,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 16:14:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:09,199 INFO L87 Difference]: Start difference. First operand 460 states and 1413 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-08 16:14:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:09,422 INFO L93 Difference]: Finished difference Result 1691 states and 5228 transitions. [2021-10-08 16:14:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 16:14:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 14 [2021-10-08 16:14:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:09,431 INFO L225 Difference]: With dead ends: 1691 [2021-10-08 16:14:09,431 INFO L226 Difference]: Without dead ends: 1691 [2021-10-08 16:14:09,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-10-08 16:14:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2021-10-08 16:14:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 869. [2021-10-08 16:14:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 860 states have (on average 3.2848837209302326) internal successors, (2825), 868 states have internal predecessors, (2825), 0 states have call successors, (0), 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-08 16:14:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2825 transitions. [2021-10-08 16:14:09,470 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2825 transitions. Word has length 14 [2021-10-08 16:14:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:09,470 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2825 transitions. [2021-10-08 16:14:09,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-08 16:14:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2825 transitions. [2021-10-08 16:14:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-08 16:14:09,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:09,472 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:09,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:09,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-10-08 16:14:09,687 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash -369164279, now seen corresponding path program 1 times [2021-10-08 16:14:09,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:09,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773746492] [2021-10-08 16:14:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:09,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 16:14:09,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:09,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773746492] [2021-10-08 16:14:09,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773746492] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:09,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760931238] [2021-10-08 16:14:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:09,758 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:09,759 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:09,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-08 16:14:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-08 16:14:09,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760931238] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:09,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:09,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 7 [2021-10-08 16:14:09,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470702505] [2021-10-08 16:14:09,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 16:14:09,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:09,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 16:14:09,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:09,942 INFO L87 Difference]: Start difference. First operand 869 states and 2825 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-08 16:14:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:10,102 INFO L93 Difference]: Finished difference Result 725 states and 2220 transitions. [2021-10-08 16:14:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-08 16:14:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 14 [2021-10-08 16:14:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:10,104 INFO L225 Difference]: With dead ends: 725 [2021-10-08 16:14:10,105 INFO L226 Difference]: Without dead ends: 433 [2021-10-08 16:14:10,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-08 16:14:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-10-08 16:14:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-10-08 16:14:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 430 states have (on average 3.1116279069767443) internal successors, (1338), 432 states have internal predecessors, (1338), 0 states have call successors, (0), 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-08 16:14:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1338 transitions. [2021-10-08 16:14:10,119 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1338 transitions. Word has length 14 [2021-10-08 16:14:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:10,120 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 1338 transitions. [2021-10-08 16:14:10,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-08 16:14:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1338 transitions. [2021-10-08 16:14:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-08 16:14:10,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:10,121 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:10,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:10,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-08 16:14:10,334 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash -557630164, now seen corresponding path program 1 times [2021-10-08 16:14:10,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:10,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917189531] [2021-10-08 16:14:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:10,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 16:14:10,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:10,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917189531] [2021-10-08 16:14:10,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917189531] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:10,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795016983] [2021-10-08 16:14:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:10,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:10,381 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:10,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-08 16:14:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:10,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 16:14:10,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 16:14:10,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795016983] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:10,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:10,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-08 16:14:10,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766676251] [2021-10-08 16:14:10,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 16:14:10,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 16:14:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:10,542 INFO L87 Difference]: Start difference. First operand 433 states and 1338 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-08 16:14:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:10,597 INFO L93 Difference]: Finished difference Result 943 states and 2885 transitions. [2021-10-08 16:14:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 16:14:10,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 15 [2021-10-08 16:14:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:10,602 INFO L225 Difference]: With dead ends: 943 [2021-10-08 16:14:10,602 INFO L226 Difference]: Without dead ends: 943 [2021-10-08 16:14:10,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 16:14:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-10-08 16:14:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 903. [2021-10-08 16:14:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 898 states have (on average 3.1547884187082404) internal successors, (2833), 902 states have internal predecessors, (2833), 0 states have call successors, (0), 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-08 16:14:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2833 transitions. [2021-10-08 16:14:10,633 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2833 transitions. Word has length 15 [2021-10-08 16:14:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:10,634 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 2833 transitions. [2021-10-08 16:14:10,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-08 16:14:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2833 transitions. [2021-10-08 16:14:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-08 16:14:10,636 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:10,637 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:10,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:10,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-08 16:14:10,852 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash -557630163, now seen corresponding path program 1 times [2021-10-08 16:14:10,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:10,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054982949] [2021-10-08 16:14:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:10,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 16:14:10,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:10,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054982949] [2021-10-08 16:14:10,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054982949] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:10,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:10,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 16:14:10,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848805714] [2021-10-08 16:14:10,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:10,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:10,930 INFO L87 Difference]: Start difference. First operand 903 states and 2833 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-08 16:14:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:10,955 INFO L93 Difference]: Finished difference Result 805 states and 2440 transitions. [2021-10-08 16:14:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 [2021-10-08 16:14:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:10,966 INFO L225 Difference]: With dead ends: 805 [2021-10-08 16:14:10,967 INFO L226 Difference]: Without dead ends: 805 [2021-10-08 16:14:10,967 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-08 16:14:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-08 16:14:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2021-10-08 16:14:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 802 states have (on average 3.0423940149625937) internal successors, (2440), 804 states have internal predecessors, (2440), 0 states have call successors, (0), 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-08 16:14:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2440 transitions. [2021-10-08 16:14:10,994 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 2440 transitions. Word has length 15 [2021-10-08 16:14:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:10,995 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 2440 transitions. [2021-10-08 16:14:10,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-08 16:14:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 2440 transitions. [2021-10-08 16:14:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-08 16:14:10,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:10,997 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:10,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-08 16:14:10,998 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash 780115848, now seen corresponding path program 2 times [2021-10-08 16:14:10,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:10,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882161284] [2021-10-08 16:14:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:10,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 16:14:11,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:11,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882161284] [2021-10-08 16:14:11,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882161284] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:11,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703794389] [2021-10-08 16:14:11,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 16:14:11,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:11,096 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:11,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-10-08 16:14:11,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-08 16:14:11,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:11,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-08 16:14:11,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-08 16:14:11,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703794389] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:11,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:11,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 9 [2021-10-08 16:14:11,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007048221] [2021-10-08 16:14:11,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-08 16:14:11,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-08 16:14:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-08 16:14:11,452 INFO L87 Difference]: Start difference. First operand 805 states and 2440 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 16:14:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:11,733 INFO L93 Difference]: Finished difference Result 2258 states and 6994 transitions. [2021-10-08 16:14:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-08 16:14:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 19 [2021-10-08 16:14:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:11,744 INFO L225 Difference]: With dead ends: 2258 [2021-10-08 16:14:11,744 INFO L226 Difference]: Without dead ends: 2158 [2021-10-08 16:14:11,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 128.2ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-10-08 16:14:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-10-08 16:14:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1610. [2021-10-08 16:14:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1607 states have (on average 3.135034225264468) internal successors, (5038), 1609 states have internal predecessors, (5038), 0 states have call successors, (0), 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-08 16:14:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5038 transitions. [2021-10-08 16:14:11,806 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5038 transitions. Word has length 19 [2021-10-08 16:14:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:11,806 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 5038 transitions. [2021-10-08 16:14:11,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 16:14:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5038 transitions. [2021-10-08 16:14:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-08 16:14:11,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:11,810 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:11,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-10-08 16:14:12,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-10-08 16:14:12,025 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1409532937, now seen corresponding path program 1 times [2021-10-08 16:14:12,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:12,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067882635] [2021-10-08 16:14:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:12,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-08 16:14:12,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:12,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067882635] [2021-10-08 16:14:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067882635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 16:14:12,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 16:14:12,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 16:14:12,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148994588] [2021-10-08 16:14:12,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 16:14:12,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 16:14:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 16:14:12,077 INFO L87 Difference]: Start difference. First operand 1610 states and 5038 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-08 16:14:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:12,100 INFO L93 Difference]: Finished difference Result 1580 states and 4829 transitions. [2021-10-08 16:14:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 16:14:12,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 23 [2021-10-08 16:14:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:12,105 INFO L225 Difference]: With dead ends: 1580 [2021-10-08 16:14:12,106 INFO L226 Difference]: Without dead ends: 1034 [2021-10-08 16:14:12,106 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-08 16:14:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2021-10-08 16:14:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 734. [2021-10-08 16:14:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 3.0941336971350615) internal successors, (2268), 733 states have internal predecessors, (2268), 0 states have call successors, (0), 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-08 16:14:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2268 transitions. [2021-10-08 16:14:12,133 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2268 transitions. Word has length 23 [2021-10-08 16:14:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:12,133 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 2268 transitions. [2021-10-08 16:14:12,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-08 16:14:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2268 transitions. [2021-10-08 16:14:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-08 16:14:12,135 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 16:14:12,135 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 16:14:12,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-08 16:14:12,136 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 16:14:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 16:14:12,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2104853436, now seen corresponding path program 3 times [2021-10-08 16:14:12,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 16:14:12,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154622433] [2021-10-08 16:14:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 16:14:12,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 16:14:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 16:14:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-08 16:14:12,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 16:14:12,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154622433] [2021-10-08 16:14:12,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154622433] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:12,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004443711] [2021-10-08 16:14:12,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-08 16:14:12,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 16:14:12,204 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 16:14:12,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-10-08 16:14:12,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-08 16:14:12,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 16:14:12,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 16:14:12,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 16:14:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-08 16:14:12,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004443711] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 16:14:12,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 16:14:12,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2021-10-08 16:14:12,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087219972] [2021-10-08 16:14:12,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 16:14:12,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 16:14:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 16:14:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-08 16:14:12,539 INFO L87 Difference]: Start difference. First operand 734 states and 2268 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-08 16:14:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 16:14:12,648 INFO L93 Difference]: Finished difference Result 1166 states and 3698 transitions. [2021-10-08 16:14:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-08 16:14:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 24 [2021-10-08 16:14:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 16:14:12,650 INFO L225 Difference]: With dead ends: 1166 [2021-10-08 16:14:12,650 INFO L226 Difference]: Without dead ends: 0 [2021-10-08 16:14:12,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-10-08 16:14:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-08 16:14:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-08 16:14:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 16:14:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-08 16:14:12,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2021-10-08 16:14:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 16:14:12,651 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-08 16:14:12,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-08 16:14:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-08 16:14:12,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-08 16:14:12,655 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,655 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-08 16:14:12,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-08 16:14:12,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 16:14:12,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-10-08 16:14:12,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 16:14:12,887 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-08 16:14:12,887 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-08 16:14:12,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.10 04:14:12 BasicIcfg [2021-10-08 16:14:12,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-08 16:14:12,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-08 16:14:12,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-08 16:14:12,891 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-08 16:14:12,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 04:13:38" (3/4) ... [2021-10-08 16:14:12,895 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-08 16:14:12,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-08 16:14:12,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-08 16:14:12,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-08 16:14:12,910 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2021-10-08 16:14:12,911 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-08 16:14:12,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 16:14:12,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 16:14:12,978 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/popl20-prod-cons-eq.wvr.c-witness.graphml [2021-10-08 16:14:12,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-08 16:14:12,981 INFO L168 Benchmark]: Toolchain (without parser) took 36325.66 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 140.4 MB in the beginning and 175.5 MB in the end (delta: -35.2 MB). Peak memory consumption was 136.1 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,981 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 165.7 MB. Free memory is still 137.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-08 16:14:12,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.28 ms. Allocated memory is still 165.7 MB. Free memory was 139.9 MB in the beginning and 127.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 165.7 MB. Free memory was 127.6 MB in the beginning and 124.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,982 INFO L168 Benchmark]: Boogie Preprocessor took 78.26 ms. Allocated memory is still 165.7 MB. Free memory was 124.4 MB in the beginning and 122.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,983 INFO L168 Benchmark]: RCFGBuilder took 1584.64 ms. Allocated memory is still 165.7 MB. Free memory was 121.9 MB in the beginning and 97.2 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,983 INFO L168 Benchmark]: TraceAbstraction took 34121.79 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 96.6 MB in the beginning and 181.8 MB in the end (delta: -85.2 MB). Peak memory consumption was 86.2 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,984 INFO L168 Benchmark]: Witness Printer took 87.80 ms. Allocated memory is still 336.6 MB. Free memory was 181.8 MB in the beginning and 175.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-10-08 16:14:12,986 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.20 ms. Allocated memory is still 165.7 MB. Free memory is still 137.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 361.28 ms. Allocated memory is still 165.7 MB. Free memory was 139.9 MB in the beginning and 127.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 165.7 MB. Free memory was 127.6 MB in the beginning and 124.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 78.26 ms. Allocated memory is still 165.7 MB. Free memory was 124.4 MB in the beginning and 122.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1584.64 ms. Allocated memory is still 165.7 MB. Free memory was 121.9 MB in the beginning and 97.2 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34121.79 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 96.6 MB in the beginning and 181.8 MB in the end (delta: -85.2 MB). Peak memory consumption was 86.2 MB. Max. memory is 8.0 GB. * Witness Printer took 87.80 ms. Allocated memory is still 336.6 MB. Free memory was 181.8 MB in the beginning and 175.5 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: 19641.0ms, 372 PlacesBefore, 63 PlacesAfterwards, 399 TransitionsBefore, 63 TransitionsAfterwards, 6130 CoEnabledTransitionPairs, 7 FixpointIterations, 264 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 458 TotalNumberOfCompositions, 10557 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7521, positive: 7397, positive conditional: 0, positive unconditional: 7397, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4449, positive: 4416, positive conditional: 0, positive unconditional: 4416, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4449, positive: 4399, positive conditional: 0, positive unconditional: 4399, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 220, negative conditional: 0, negative unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7521, positive: 2981, positive conditional: 0, positive unconditional: 2981, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 4449, unknown conditional: 0, unknown unconditional: 4449] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 444 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 33884.0ms, OverallIterations: 31, TraceHistogramMax: 5, EmptinessCheckTime: 35.9ms, AutomataDifference: 3262.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19747.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1135 SDtfs, 3356 SDslu, 2046 SDs, 0 SdLazy, 989 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1655.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 754.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1610occurred in iteration=29, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 900.2ms AutomataMinimizationTime, 31 MinimizatonAttempts, 15160 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 355.5ms SsaConstructionTime, 1178.0ms SatisfiabilityAnalysisTime, 2103.6ms InterpolantComputationTime, 498 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1434 SizeOfPredicates, 24 NumberOfNonLiveVariables, 4212 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 51 InterpolantComputations, 18 PerfectInterpolantSequences, 123/254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-08 16:14:13,036 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...