/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/weaver/chl/name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-06 16:17:24,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-06 16:17:24,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-06 16:17:24,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-06 16:17:24,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-06 16:17:24,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-06 16:17:24,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-06 16:17:24,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-06 16:17:24,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-06 16:17:24,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-06 16:17:24,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-06 16:17:24,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-06 16:17:24,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-06 16:17:24,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-06 16:17:24,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-06 16:17:24,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-06 16:17:24,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-06 16:17:24,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-06 16:17:24,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-06 16:17:24,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-06 16:17:24,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-06 16:17:24,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-06 16:17:24,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-06 16:17:24,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-06 16:17:24,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-06 16:17:24,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-06 16:17:24,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-06 16:17:24,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-06 16:17:24,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-06 16:17:24,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-06 16:17:24,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-06 16:17:24,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-06 16:17:24,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-06 16:17:24,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-06 16:17:24,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-06 16:17:24,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-06 16:17:24,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-06 16:17:24,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-06 16:17:24,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-06 16:17:24,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-06 16:17:24,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-06 16:17:24,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-06 16:17:24,908 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-06 16:17:24,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-06 16:17:24,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-06 16:17:24,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-06 16:17:24,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-06 16:17:24,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-06 16:17:24,914 INFO L138 SettingsManager]: * Use SBE=true [2021-10-06 16:17:24,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-06 16:17:24,914 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-06 16:17:24,915 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-06 16:17:24,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-06 16:17:24,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-06 16:17:24,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-06 16:17:24,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-06 16:17:24,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-06 16:17:24,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-06 16:17:24,917 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-06 16:17:24,917 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-06 16:17:24,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-06 16:17:24,917 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-06 16:17:24,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-06 16:17:24,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-06 16:17:24,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-06 16:17:24,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-06 16:17:24,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:17:24,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-06 16:17:24,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-06 16:17:24,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-06 16:17:24,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-06 16:17:24,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-06 16:17:24,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-06 16:17:24,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-06 16:17:24,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-10-06 16:17:25,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-06 16:17:25,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-06 16:17:25,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-06 16:17:25,301 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-06 16:17:25,302 INFO L275 PluginConnector]: CDTParser initialized [2021-10-06 16:17:25,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/name-comparator-symm.wvr.c [2021-10-06 16:17:25,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9ea1643/0b07269b459b4073b8b0b3e35e9e7371/FLAG2b62fa4ce [2021-10-06 16:17:26,029 INFO L306 CDTParser]: Found 1 translation units. [2021-10-06 16:17:26,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/name-comparator-symm.wvr.c [2021-10-06 16:17:26,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9ea1643/0b07269b459b4073b8b0b3e35e9e7371/FLAG2b62fa4ce [2021-10-06 16:17:26,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9ea1643/0b07269b459b4073b8b0b3e35e9e7371 [2021-10-06 16:17:26,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-06 16:17:26,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-06 16:17:26,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-06 16:17:26,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-06 16:17:26,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-06 16:17:26,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dadb76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26, skipping insertion in model container [2021-10-06 16:17:26,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-06 16:17:26,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-06 16:17:26,648 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/name-comparator-symm.wvr.c[4063,4076] [2021-10-06 16:17:26,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:17:26,663 INFO L203 MainTranslator]: Completed pre-run [2021-10-06 16:17:26,698 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/name-comparator-symm.wvr.c[4063,4076] [2021-10-06 16:17:26,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:17:26,718 INFO L208 MainTranslator]: Completed translation [2021-10-06 16:17:26,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26 WrapperNode [2021-10-06 16:17:26,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-06 16:17:26,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-06 16:17:26,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-06 16:17:26,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-06 16:17:26,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-06 16:17:26,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-06 16:17:26,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-06 16:17:26,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-06 16:17:26,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-06 16:17:26,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-06 16:17:26,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-06 16:17:26,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-06 16:17:26,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (1/1) ... [2021-10-06 16:17:26,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:17:26,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:26,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-06 16:17:26,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-06 16:17:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-06 16:17:26,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-06 16:17:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-06 16:17:26,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-06 16:17:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-06 16:17:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-06 16:17:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-06 16:17:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-06 16:17:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-06 16:17:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-06 16:17:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-06 16:17:26,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-06 16:17:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-06 16:17:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-06 16:17:26,984 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-06 16:17:28,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-06 16:17:28,255 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-10-06 16:17:28,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:28 BoogieIcfgContainer [2021-10-06 16:17:28,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-06 16:17:28,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-06 16:17:28,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-06 16:17:28,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-06 16:17:28,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 04:17:26" (1/3) ... [2021-10-06 16:17:28,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598cf80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:17:28, skipping insertion in model container [2021-10-06 16:17:28,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:26" (2/3) ... [2021-10-06 16:17:28,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598cf80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:17:28, skipping insertion in model container [2021-10-06 16:17:28,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:28" (3/3) ... [2021-10-06 16:17:28,267 INFO L111 eAbstractionObserver]: Analyzing ICFG name-comparator-symm.wvr.c [2021-10-06 16:17:28,273 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-06 16:17:28,273 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-06 16:17:28,273 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-06 16:17:28,273 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-06 16:17:28,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,312 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,312 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,313 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,313 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,313 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,313 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,314 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,314 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,314 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,314 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,314 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,315 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,315 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,315 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,315 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,316 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,316 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,316 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,316 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,316 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,317 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,317 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,317 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,317 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,317 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,318 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,319 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,320 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,321 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,321 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,321 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,322 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,322 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,322 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,322 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,322 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,323 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,323 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,323 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,323 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,324 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,324 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,324 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,324 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,324 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,325 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,325 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,326 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,328 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,328 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,328 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,329 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,329 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,329 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,329 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,329 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,330 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,330 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,330 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,330 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,331 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,331 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,331 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,331 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,331 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,332 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,332 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,332 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,332 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,332 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,333 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,333 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,333 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,333 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,334 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,337 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,338 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,338 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,338 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,338 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,339 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,340 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,340 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,340 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,341 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,342 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,342 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,342 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,342 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,343 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,347 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,347 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,347 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,350 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,354 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,354 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,354 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:28,359 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-06 16:17:28,408 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-06 16:17:28,416 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-06 16:17:28,417 INFO L340 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2021-10-06 16:17:28,435 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-06 16:17:28,447 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 176 transitions, 368 flow [2021-10-06 16:17:28,450 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 176 transitions, 368 flow [2021-10-06 16:17:28,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 176 transitions, 368 flow [2021-10-06 16:17:28,550 INFO L129 PetriNetUnfolder]: 12/174 cut-off events. [2021-10-06 16:17:28,551 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-06 16:17:28,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 12/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2021-10-06 16:17:28,561 INFO L116 LiptonReduction]: Number of co-enabled transitions 812 [2021-10-06 16:17:39,269 INFO L131 LiptonReduction]: Checked pairs total: 1052 [2021-10-06 16:17:39,270 INFO L133 LiptonReduction]: Total number of compositions: 185 [2021-10-06 16:17:39,279 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 33 transitions, 82 flow [2021-10-06 16:17:39,322 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 136 states, 106 states have (on average 2.943396226415094) internal successors, (312), 135 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 106 states have (on average 2.943396226415094) internal successors, (312), 135 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-06 16:17:39,329 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:39,330 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-06 16:17:39,330 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 987, now seen corresponding path program 1 times [2021-10-06 16:17:39,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:39,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147757246] [2021-10-06 16:17:39,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:39,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:17:39,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:39,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147757246] [2021-10-06 16:17:39,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147757246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:39,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:39,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-06 16:17:39,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375613175] [2021-10-06 16:17:39,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-06 16:17:39,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:39,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-06 16:17:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 16:17:39,475 INFO L87 Difference]: Start difference. First operand has 136 states, 106 states have (on average 2.943396226415094) internal successors, (312), 135 states have internal predecessors, (312), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:39,494 INFO L93 Difference]: Finished difference Result 102 states and 235 transitions. [2021-10-06 16:17:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-06 16:17:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-10-06 16:17:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:39,508 INFO L225 Difference]: With dead ends: 102 [2021-10-06 16:17:39,508 INFO L226 Difference]: Without dead ends: 97 [2021-10-06 16:17:39,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 16:17:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-06 16:17:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-10-06 16:17:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 2.8125) internal successors, (225), 96 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 225 transitions. [2021-10-06 16:17:39,557 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 225 transitions. Word has length 1 [2021-10-06 16:17:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:39,558 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 225 transitions. [2021-10-06 16:17:39,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 225 transitions. [2021-10-06 16:17:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-06 16:17:39,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:39,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-06 16:17:39,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-06 16:17:39,560 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash 31571, now seen corresponding path program 1 times [2021-10-06 16:17:39,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:39,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164758370] [2021-10-06 16:17:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:39,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:17:39,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:39,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164758370] [2021-10-06 16:17:39,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164758370] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:39,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:39,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-06 16:17:39,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432159950] [2021-10-06 16:17:39,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:39,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:39,664 INFO L87 Difference]: Start difference. First operand 97 states and 225 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:39,687 INFO L93 Difference]: Finished difference Result 191 states and 447 transitions. [2021-10-06 16:17:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:39,687 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-06 16:17:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:39,691 INFO L225 Difference]: With dead ends: 191 [2021-10-06 16:17:39,691 INFO L226 Difference]: Without dead ends: 191 [2021-10-06 16:17:39,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-06 16:17:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 98. [2021-10-06 16:17:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 2.802469135802469) internal successors, (227), 97 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 227 transitions. [2021-10-06 16:17:39,707 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 227 transitions. Word has length 2 [2021-10-06 16:17:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:39,708 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 227 transitions. [2021-10-06 16:17:39,708 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-06 16:17:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 227 transitions. [2021-10-06 16:17:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 16:17:39,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:39,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 16:17:39,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-06 16:17:39,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash 980202, now seen corresponding path program 1 times [2021-10-06 16:17:39,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:39,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968942142] [2021-10-06 16:17:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:39,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:39,772 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-06 16:17:39,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:39,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968942142] [2021-10-06 16:17:39,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968942142] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:39,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045676808] [2021-10-06 16:17:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:39,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:39,776 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-06 16:17:39,790 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-06 16:17:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:39,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 16:17:39,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:39,907 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-06 16:17:39,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045676808] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:39,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:39,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-06 16:17:39,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837643891] [2021-10-06 16:17:39,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:17:39,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:17:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:39,910 INFO L87 Difference]: Start difference. First operand 98 states and 227 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-06 16:17:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:39,935 INFO L93 Difference]: Finished difference Result 190 states and 446 transitions. [2021-10-06 16:17:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:39,936 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-06 16:17:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:39,939 INFO L225 Difference]: With dead ends: 190 [2021-10-06 16:17:39,939 INFO L226 Difference]: Without dead ends: 190 [2021-10-06 16:17:39,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-10-06 16:17:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 97. [2021-10-06 16:17:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 2.7901234567901234) internal successors, (226), 96 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 226 transitions. [2021-10-06 16:17:39,955 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 226 transitions. Word has length 3 [2021-10-06 16:17:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:39,955 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 226 transitions. [2021-10-06 16:17:39,955 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-06 16:17:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 226 transitions. [2021-10-06 16:17:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 16:17:39,956 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:39,956 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 16:17:40,003 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-06 16:17:40,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:40,170 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 980200, now seen corresponding path program 1 times [2021-10-06 16:17:40,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:40,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991043215] [2021-10-06 16:17:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:40,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:40,261 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-06 16:17:40,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:40,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991043215] [2021-10-06 16:17:40,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991043215] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:40,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796614128] [2021-10-06 16:17:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:40,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:40,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:40,272 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-06 16:17:40,301 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-06 16:17:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:40,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 16:17:40,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:40,361 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-06 16:17:40,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796614128] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:40,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:40,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-06 16:17:40,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929901126] [2021-10-06 16:17:40,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:17:40,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:17:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:40,364 INFO L87 Difference]: Start difference. First operand 97 states and 226 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-06 16:17:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:40,390 INFO L93 Difference]: Finished difference Result 284 states and 668 transitions. [2021-10-06 16:17:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:40,391 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-06 16:17:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:40,395 INFO L225 Difference]: With dead ends: 284 [2021-10-06 16:17:40,395 INFO L226 Difference]: Without dead ends: 284 [2021-10-06 16:17:40,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-06 16:17:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 98. [2021-10-06 16:17:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 2.7804878048780486) internal successors, (228), 97 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 228 transitions. [2021-10-06 16:17:40,409 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 228 transitions. Word has length 3 [2021-10-06 16:17:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:40,409 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 228 transitions. [2021-10-06 16:17:40,409 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-06 16:17:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 228 transitions. [2021-10-06 16:17:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-06 16:17:40,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:40,410 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-06 16:17:40,447 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-06 16:17:40,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:40,625 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash 30387761, now seen corresponding path program 2 times [2021-10-06 16:17:40,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:40,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308531448] [2021-10-06 16:17:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:40,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:40,697 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-06 16:17:40,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:40,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308531448] [2021-10-06 16:17:40,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308531448] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:40,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170354607] [2021-10-06 16:17:40,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-06 16:17:40,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:40,703 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-06 16:17:40,724 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-06 16:17:40,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-06 16:17:40,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-06 16:17:40,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:40,792 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-06 16:17:40,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170354607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:40,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:40,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-06 16:17:40,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533451598] [2021-10-06 16:17:40,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:40,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:40,795 INFO L87 Difference]: Start difference. First operand 98 states and 228 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:40,805 INFO L93 Difference]: Finished difference Result 97 states and 227 transitions. [2021-10-06 16:17:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:40,805 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-06 16:17:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:40,807 INFO L225 Difference]: With dead ends: 97 [2021-10-06 16:17:40,808 INFO L226 Difference]: Without dead ends: 97 [2021-10-06 16:17:40,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-06 16:17:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2021-10-06 16:17:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 2.7875) internal successors, (223), 94 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 223 transitions. [2021-10-06 16:17:40,829 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 223 transitions. Word has length 4 [2021-10-06 16:17:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:40,829 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 223 transitions. [2021-10-06 16:17:40,830 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-06 16:17:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 223 transitions. [2021-10-06 16:17:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 16:17:40,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:40,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 16:17:40,866 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-06 16:17:41,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:41,045 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:41,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash 941711552, now seen corresponding path program 1 times [2021-10-06 16:17:41,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:41,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622705330] [2021-10-06 16:17:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:41,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 16:17:41,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:41,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622705330] [2021-10-06 16:17:41,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622705330] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:41,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:41,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:17:41,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450240751] [2021-10-06 16:17:41,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:41,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:41,126 INFO L87 Difference]: Start difference. First operand 95 states and 223 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:41,131 INFO L93 Difference]: Finished difference Result 96 states and 224 transitions. [2021-10-06 16:17:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-06 16:17:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:41,133 INFO L225 Difference]: With dead ends: 96 [2021-10-06 16:17:41,133 INFO L226 Difference]: Without dead ends: 96 [2021-10-06 16:17:41,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-06 16:17:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-10-06 16:17:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 2.765432098765432) internal successors, (224), 95 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 224 transitions. [2021-10-06 16:17:41,140 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 224 transitions. Word has length 5 [2021-10-06 16:17:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:41,140 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 224 transitions. [2021-10-06 16:17:41,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 224 transitions. [2021-10-06 16:17:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-06 16:17:41,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:41,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-06 16:17:41,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-06 16:17:41,142 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -862393399, now seen corresponding path program 1 times [2021-10-06 16:17:41,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:41,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417108039] [2021-10-06 16:17:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:41,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:41,185 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-06 16:17:41,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:41,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417108039] [2021-10-06 16:17:41,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417108039] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:41,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406046218] [2021-10-06 16:17:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:41,190 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:41,196 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-06 16:17:41,208 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-06 16:17:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:41,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-06 16:17:41,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:41,308 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-06 16:17:41,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406046218] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:41,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:41,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-10-06 16:17:41,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541716954] [2021-10-06 16:17:41,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:17:41,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:17:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:41,311 INFO L87 Difference]: Start difference. First operand 96 states and 224 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:41,321 INFO L93 Difference]: Finished difference Result 97 states and 225 transitions. [2021-10-06 16:17:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-06 16:17:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:41,323 INFO L225 Difference]: With dead ends: 97 [2021-10-06 16:17:41,323 INFO L226 Difference]: Without dead ends: 97 [2021-10-06 16:17:41,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-06 16:17:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-10-06 16:17:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 2.7439024390243905) internal successors, (225), 96 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 225 transitions. [2021-10-06 16:17:41,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 225 transitions. Word has length 6 [2021-10-06 16:17:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:41,330 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 225 transitions. [2021-10-06 16:17:41,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 225 transitions. [2021-10-06 16:17:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 16:17:41,331 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:41,331 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-10-06 16:17:41,363 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-06 16:17:41,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:41,545 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash -955072032, now seen corresponding path program 2 times [2021-10-06 16:17:41,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:41,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376318179] [2021-10-06 16:17:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:41,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:41,595 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-06 16:17:41,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:41,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376318179] [2021-10-06 16:17:41,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376318179] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:41,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254419341] [2021-10-06 16:17:41,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-06 16:17:41,596 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:41,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:41,597 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-06 16:17:41,613 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-06 16:17:41,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-06 16:17:41,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:41,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-06 16:17:41,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:41,756 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-06 16:17:41,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254419341] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:41,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:41,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2021-10-06 16:17:41,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337295198] [2021-10-06 16:17:41,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:41,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:41,759 INFO L87 Difference]: Start difference. First operand 97 states and 225 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:41,820 INFO L93 Difference]: Finished difference Result 133 states and 322 transitions. [2021-10-06 16:17:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:41,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-06 16:17:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:41,822 INFO L225 Difference]: With dead ends: 133 [2021-10-06 16:17:41,822 INFO L226 Difference]: Without dead ends: 133 [2021-10-06 16:17:41,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-06 16:17:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2021-10-06 16:17:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 2.96875) internal successors, (285), 110 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2021-10-06 16:17:41,832 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 7 [2021-10-06 16:17:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:41,834 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 285 transitions. [2021-10-06 16:17:41,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 285 transitions. [2021-10-06 16:17:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 16:17:41,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:41,835 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-10-06 16:17:41,877 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-06 16:17:42,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:42,037 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:42,039 INFO L82 PathProgramCache]: Analyzing trace with hash -955072040, now seen corresponding path program 1 times [2021-10-06 16:17:42,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:42,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521623216] [2021-10-06 16:17:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:42,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:42,079 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-06 16:17:42,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:42,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521623216] [2021-10-06 16:17:42,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521623216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:42,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:42,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:17:42,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690153995] [2021-10-06 16:17:42,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:42,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:42,096 INFO L87 Difference]: Start difference. First operand 111 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:42,114 INFO L93 Difference]: Finished difference Result 133 states and 308 transitions. [2021-10-06 16:17:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:42,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-06 16:17:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:42,116 INFO L225 Difference]: With dead ends: 133 [2021-10-06 16:17:42,117 INFO L226 Difference]: Without dead ends: 133 [2021-10-06 16:17:42,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 16:17:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-06 16:17:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2021-10-06 16:17:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 2.8229166666666665) internal successors, (271), 110 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 271 transitions. [2021-10-06 16:17:42,123 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 271 transitions. Word has length 7 [2021-10-06 16:17:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:42,123 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 271 transitions. [2021-10-06 16:17:42,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 271 transitions. [2021-10-06 16:17:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-06 16:17:42,124 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:42,124 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:42,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-06 16:17:42,125 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash 457538731, now seen corresponding path program 1 times [2021-10-06 16:17:42,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:42,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915894694] [2021-10-06 16:17:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:42,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-06 16:17:42,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:42,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915894694] [2021-10-06 16:17:42,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915894694] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:42,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114547218] [2021-10-06 16:17:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:42,186 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:42,187 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-06 16:17:42,209 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-06 16:17:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:42,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-06 16:17:42,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-06 16:17:42,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114547218] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:42,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:42,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-10-06 16:17:42,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596793569] [2021-10-06 16:17:42,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-06 16:17:42,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-06 16:17:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-10-06 16:17:42,332 INFO L87 Difference]: Start difference. First operand 111 states and 271 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:42,349 INFO L93 Difference]: Finished difference Result 112 states and 272 transitions. [2021-10-06 16:17:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:17:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-06 16:17:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:42,351 INFO L225 Difference]: With dead ends: 112 [2021-10-06 16:17:42,352 INFO L226 Difference]: Without dead ends: 112 [2021-10-06 16:17:42,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 29.8ms TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-10-06 16:17:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-06 16:17:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-10-06 16:17:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 2.804123711340206) internal successors, (272), 111 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 272 transitions. [2021-10-06 16:17:42,357 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 272 transitions. Word has length 8 [2021-10-06 16:17:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:42,358 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 272 transitions. [2021-10-06 16:17:42,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 272 transitions. [2021-10-06 16:17:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-06 16:17:42,358 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:42,359 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:42,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-06 16:17:42,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-06 16:17:42,574 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1587685634, now seen corresponding path program 2 times [2021-10-06 16:17:42,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:42,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39547912] [2021-10-06 16:17:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:42,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:42,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:42,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39547912] [2021-10-06 16:17:42,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39547912] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:42,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264684304] [2021-10-06 16:17:42,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-06 16:17:42,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:42,675 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-06 16:17:42,680 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-06 16:17:42,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-06 16:17:42,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:42,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-06 16:17:42,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:42,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264684304] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:42,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:42,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-06 16:17:42,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930496584] [2021-10-06 16:17:42,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:17:42,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:17:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:42,773 INFO L87 Difference]: Start difference. First operand 112 states and 272 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:42,806 INFO L93 Difference]: Finished difference Result 170 states and 406 transitions. [2021-10-06 16:17:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:17:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-06 16:17:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:42,808 INFO L225 Difference]: With dead ends: 170 [2021-10-06 16:17:42,809 INFO L226 Difference]: Without dead ends: 170 [2021-10-06 16:17:42,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-10-06 16:17:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2021-10-06 16:17:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 2.990990990990991) internal successors, (332), 125 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 332 transitions. [2021-10-06 16:17:42,815 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 332 transitions. Word has length 9 [2021-10-06 16:17:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:42,816 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 332 transitions. [2021-10-06 16:17:42,816 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-06 16:17:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 332 transitions. [2021-10-06 16:17:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-06 16:17:42,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:42,817 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:42,852 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-06 16:17:43,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:43,031 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1587685626, now seen corresponding path program 1 times [2021-10-06 16:17:43,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:43,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623467289] [2021-10-06 16:17:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:43,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:43,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:43,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623467289] [2021-10-06 16:17:43,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623467289] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:43,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528942544] [2021-10-06 16:17:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:43,073 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:43,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:43,074 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-06 16:17:43,103 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-06 16:17:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:43,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 16:17:43,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:43,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528942544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:43,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:43,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-06 16:17:43,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421437268] [2021-10-06 16:17:43,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:17:43,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:17:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:43,205 INFO L87 Difference]: Start difference. First operand 126 states and 332 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:43,230 INFO L93 Difference]: Finished difference Result 134 states and 321 transitions. [2021-10-06 16:17:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-06 16:17:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:43,233 INFO L225 Difference]: With dead ends: 134 [2021-10-06 16:17:43,233 INFO L226 Difference]: Without dead ends: 134 [2021-10-06 16:17:43,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-10-06 16:17:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2021-10-06 16:17:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 2.8118811881188117) internal successors, (284), 111 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2021-10-06 16:17:43,239 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 9 [2021-10-06 16:17:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:43,239 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2021-10-06 16:17:43,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2021-10-06 16:17:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-06 16:17:43,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:43,240 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2021-10-06 16:17:43,282 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-06 16:17:43,454 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,SelfDestructingSolverStorable11 [2021-10-06 16:17:43,455 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1973615049, now seen corresponding path program 3 times [2021-10-06 16:17:43,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:43,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357488360] [2021-10-06 16:17:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:43,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:43,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:43,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357488360] [2021-10-06 16:17:43,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357488360] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:43,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541207885] [2021-10-06 16:17:43,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-06 16:17:43,518 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:43,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:43,519 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-06 16:17:43,537 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-06 16:17:43,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-06 16:17:43,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:43,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-06 16:17:43,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541207885] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:43,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:43,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-06 16:17:43,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884634039] [2021-10-06 16:17:43,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:17:43,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:17:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:43,645 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:43,675 INFO L93 Difference]: Finished difference Result 192 states and 441 transitions. [2021-10-06 16:17:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:17:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-06 16:17:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:43,678 INFO L225 Difference]: With dead ends: 192 [2021-10-06 16:17:43,678 INFO L226 Difference]: Without dead ends: 192 [2021-10-06 16:17:43,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-06 16:17:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2021-10-06 16:17:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 2.869565217391304) internal successors, (330), 125 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2021-10-06 16:17:43,684 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 10 [2021-10-06 16:17:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:43,684 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2021-10-06 16:17:43,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2021-10-06 16:17:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-06 16:17:43,685 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:43,685 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:43,714 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-06 16:17:43,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:43,901 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1978977017, now seen corresponding path program 1 times [2021-10-06 16:17:43,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:43,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882276369] [2021-10-06 16:17:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:43,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:43,930 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-06 16:17:43,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:43,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882276369] [2021-10-06 16:17:43,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882276369] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:43,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:43,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:17:43,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808878992] [2021-10-06 16:17:43,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:43,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:43,933 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:43,951 INFO L93 Difference]: Finished difference Result 158 states and 415 transitions. [2021-10-06 16:17:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-06 16:17:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:43,953 INFO L225 Difference]: With dead ends: 158 [2021-10-06 16:17:43,953 INFO L226 Difference]: Without dead ends: 158 [2021-10-06 16:17:43,954 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-06 16:17:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-06 16:17:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2021-10-06 16:17:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 2.962406015037594) internal successors, (394), 143 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 394 transitions. [2021-10-06 16:17:43,959 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 394 transitions. Word has length 10 [2021-10-06 16:17:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:43,960 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 394 transitions. [2021-10-06 16:17:43,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 16:17:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 394 transitions. [2021-10-06 16:17:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-06 16:17:43,961 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:43,961 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2021-10-06 16:17:43,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-06 16:17:43,962 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-10-06 16:17:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1052525026, now seen corresponding path program 4 times [2021-10-06 16:17:43,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:43,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863389804] [2021-10-06 16:17:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:43,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 16:17:43,989 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-06 16:17:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 16:17:44,041 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-06 16:17:44,041 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-06 16:17:44,042 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-06 16:17:44,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-06 16:17:44,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:44,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-06 16:17:44,056 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-06 16:17:44,056 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-06 16:17:44,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 04:17:44 BasicIcfg [2021-10-06 16:17:44,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-06 16:17:44,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-06 16:17:44,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-06 16:17:44,109 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-06 16:17:44,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:28" (3/4) ... [2021-10-06 16:17:44,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-06 16:17:44,196 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl/name-comparator-symm.wvr.c-witness.graphml [2021-10-06 16:17:44,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-06 16:17:44,198 INFO L168 Benchmark]: Toolchain (without parser) took 17850.73 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 135.6 MB in the beginning and 174.3 MB in the end (delta: -38.7 MB). Peak memory consumption was 114.9 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,198 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 161.5 MB. Free memory is still 131.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-06 16:17:44,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.90 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 123.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 161.5 MB. Free memory was 123.8 MB in the beginning and 121.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,199 INFO L168 Benchmark]: Boogie Preprocessor took 77.41 ms. Allocated memory is still 161.5 MB. Free memory was 121.5 MB in the beginning and 119.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,200 INFO L168 Benchmark]: RCFGBuilder took 1396.23 ms. Allocated memory is still 161.5 MB. Free memory was 119.9 MB in the beginning and 109.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,200 INFO L168 Benchmark]: TraceAbstraction took 15848.32 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 108.6 MB in the beginning and 65.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,201 INFO L168 Benchmark]: Witness Printer took 87.83 ms. Allocated memory is still 201.3 MB. Free memory was 65.3 MB in the beginning and 174.3 MB in the end (delta: -109.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:44,203 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.21 ms. Allocated memory is still 161.5 MB. Free memory is still 131.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 361.90 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 123.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 161.5 MB. Free memory was 123.8 MB in the beginning and 121.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 77.41 ms. Allocated memory is still 161.5 MB. Free memory was 121.5 MB in the beginning and 119.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1396.23 ms. Allocated memory is still 161.5 MB. Free memory was 119.9 MB in the beginning and 109.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15848.32 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 108.6 MB in the beginning and 65.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 8.0 GB. * Witness Printer took 87.83 ms. Allocated memory is still 201.3 MB. Free memory was 65.3 MB in the beginning and 174.3 MB in the end (delta: -109.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10819.9ms, 171 PlacesBefore, 37 PlacesAfterwards, 176 TransitionsBefore, 33 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 7 FixpointIterations, 138 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 0 ConcurrentYvCompositions, 9 ChoiceCompositions, 185 TotalNumberOfCompositions, 1052 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1028, positive: 1012, positive conditional: 0, positive unconditional: 1012, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 428, positive: 424, positive conditional: 0, positive unconditional: 424, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 428, positive: 424, positive conditional: 0, positive unconditional: 424, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1028, positive: 588, positive conditional: 0, positive unconditional: 588, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 428, unknown conditional: 0, unknown unconditional: 428] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 64]: integer overflow possible integer overflow possible We found a FailurePath: [L38] 0 int* nondet_0; [L39] 0 int name_1, name_2, result_3, i_4, current_5, break_6, result_7, i_8, current_9, break_10; [L99] 0 pthread_t t1, t2, t3; [L101] 0 int* nondet_0; [L102] 0 int ult_7, i_8, current_9, break_10; [L105] 0 name_1 = __VERIFIER_nondet_int() [L106] 0 name_2 = __VERIFIER_nondet_int() [L107] 0 result_3 = __VERIFIER_nondet_int() [L108] 0 i_4 = __VERIFIER_nondet_int() [L109] 0 current_5 = __VERIFIER_nondet_int() [L110] 0 break_6 = __VERIFIER_nondet_int() [L111] 0 result_7 = __VERIFIER_nondet_int() [L112] 0 i_8 = __VERIFIER_nondet_int() [L113] 0 current_9 = __VERIFIER_nondet_int() [L114] 0 break_10 = __VERIFIER_nondet_int() [L35] COND FALSE 0 !(!cond) [L130] EXPR 0 sizeof(int) * size [L130] 0 int* arr = (int*)malloc(sizeof(int) * size); [L131] 0 int i = 0; VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L131] COND TRUE 0 i < size [L132] 0 arr[i] = __VERIFIER_nondet_int() [L131] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L131] COND TRUE 0 i < size [L132] 0 arr[i] = __VERIFIER_nondet_int() [L131] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L131] COND TRUE 0 i < size [L132] 0 arr[i] = __VERIFIER_nondet_int() [L131] 0 i++ VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L131] COND FALSE 0 !(i < size) [L134] 0 return arr; [L115] 0 nondet_0 = create_fresh_int_array(3) [L118] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [break_10=0, break_6=0, current_5=0, current_9=0, i_4=0, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L45] 1 i_4 = 0 [L46] 1 break_6 = 0 [L47] EXPR 1 ( name_1 == name_2 ) ? 0 : result_3 [L47] 1 result_3 = ( name_1 == name_2 ) ? 0 : result_3 [L48] EXPR 1 ( name_1 == name_2 ) ? 1 : break_6 [L48] 1 break_6 = ( name_1 == name_2 ) ? 1 : break_6 [L51] COND TRUE 1 __VERIFIER_nondet_bool() [L35] COND FALSE 1 !(!cond) [L54] EXPR 1 nondet_0[i_4] [L54] 1 current_5 = nondet_0[i_4] [L55] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L55] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L56] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L56] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L57] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L57] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L58] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L58] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L59] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-6, current_9=0, i_4=1, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L51] COND TRUE 1 __VERIFIER_nondet_bool() [L35] COND FALSE 1 !(!cond) [L54] EXPR 1 nondet_0[i_4] [L54] 1 current_5 = nondet_0[i_4] [L55] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L55] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L56] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L56] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L57] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L57] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L58] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L58] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L59] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-7, current_9=0, i_4=2, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L51] COND TRUE 1 __VERIFIER_nondet_bool() [L35] COND FALSE 1 !(!cond) [L54] EXPR 1 nondet_0[i_4] [L54] 1 current_5 = nondet_0[i_4] [L55] EXPR 1 ( current_5 == name_1 ) ? 1 : result_3 [L55] 1 result_3 = ( current_5 == name_1 ) ? 1 : result_3 [L56] EXPR 1 ( current_5 == name_1 ) ? 1 : break_6 [L56] 1 break_6 = ( current_5 == name_1 ) ? 1 : break_6 [L57] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L57] 1 result_3 = ( !break_6 && ( current_5 == name_2 ) ) ? ( 0 - 1 ) : result_3 [L58] EXPR 1 ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L58] 1 break_6 = ( !break_6 && ( current_5 == name_2 ) ) ? 1 : break_6 [L59] 1 i_4++ VAL [break_10=0, break_6=0, current_5=-8, current_9=0, i_4=3, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] [L51] COND FALSE 1 !(__VERIFIER_nondet_bool()) [L35] COND FALSE 1 !(!cond) [L64] 1 ( !break_6 ) ? ( name_1 - name_2 ) : result_3 [L64] 1 name_1 - name_2 VAL [break_10=0, break_6=0, current_5=-8, current_9=0, i_4=3, i_8=0, name_1=1, name_2=-2147483648, nondet_0={0:0}, result_3=1, result_7=0] - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 131]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 131]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 193 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 15646.5ms, OverallIterations: 15, TraceHistogramMax: 3, EmptinessCheckTime: 14.6ms, AutomataDifference: 422.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10905.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 338 SDtfs, 304 SDslu, 320 SDs, 0 SdLazy, 113 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 196.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 128.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=14, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 149.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 564 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 118.0ms SsaConstructionTime, 488.1ms SatisfiabilityAnalysisTime, 807.9ms InterpolantComputationTime, 154 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1108 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 55/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-06 16:17:44,244 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...