/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 22:37:11,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 22:37:11,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 22:37:11,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 22:37:11,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 22:37:11,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 22:37:11,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 22:37:11,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 22:37:11,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 22:37:11,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 22:37:11,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 22:37:11,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 22:37:11,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 22:37:11,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 22:37:11,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 22:37:11,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 22:37:11,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 22:37:11,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 22:37:11,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 22:37:11,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 22:37:11,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 22:37:11,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 22:37:11,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 22:37:11,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 22:37:11,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 22:37:11,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 22:37:11,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 22:37:11,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 22:37:11,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 22:37:11,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 22:37:11,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 22:37:11,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 22:37:11,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 22:37:11,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 22:37:11,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 22:37:11,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 22:37:11,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 22:37:11,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 22:37:11,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 22:37:11,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 22:37:11,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 22:37:11,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-17 22:37:11,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 22:37:11,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 22:37:11,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 22:37:11,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 22:37:11,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 22:37:11,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 22:37:11,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 22:37:11,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 22:37:11,141 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 22:37:11,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 22:37:11,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 22:37:11,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 22:37:11,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 22:37:11,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 22:37:11,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 22:37:11,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 22:37:11,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 22:37:11,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 22:37:11,144 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/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 [2022-01-17 22:37:11,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 22:37:11,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 22:37:11,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 22:37:11,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 22:37:11,342 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 22:37:11,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-01-17 22:37:11,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7860726/854b8270af024c648fd43644659d0937/FLAG7d27b472a [2022-01-17 22:37:11,783 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 22:37:11,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-01-17 22:37:11,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7860726/854b8270af024c648fd43644659d0937/FLAG7d27b472a [2022-01-17 22:37:11,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7860726/854b8270af024c648fd43644659d0937 [2022-01-17 22:37:11,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 22:37:11,816 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 22:37:11,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 22:37:11,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 22:37:11,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 22:37:11,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 10:37:11" (1/1) ... [2022-01-17 22:37:11,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5517f119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:11, skipping insertion in model container [2022-01-17 22:37:11,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 10:37:11" (1/1) ... [2022-01-17 22:37:11,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 22:37:11,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 22:37:12,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2022-01-17 22:37:12,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 22:37:12,179 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 22:37:12,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2022-01-17 22:37:12,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 22:37:12,253 INFO L208 MainTranslator]: Completed translation [2022-01-17 22:37:12,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12 WrapperNode [2022-01-17 22:37:12,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 22:37:12,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 22:37:12,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 22:37:12,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 22:37:12,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,303 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-01-17 22:37:12,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 22:37:12,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 22:37:12,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 22:37:12,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 22:37:12,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 22:37:12,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 22:37:12,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 22:37:12,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 22:37:12,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (1/1) ... [2022-01-17 22:37:12,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 22:37:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:12,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-17 22:37:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-17 22:37:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-17 22:37:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-17 22:37:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-17 22:37:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-17 22:37:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-17 22:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 22:37:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 22:37:12,402 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-17 22:37:12,504 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 22:37:12,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 22:37:12,668 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 22:37:12,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 22:37:12,672 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-17 22:37:12,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 10:37:12 BoogieIcfgContainer [2022-01-17 22:37:12,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 22:37:12,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 22:37:12,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 22:37:12,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 22:37:12,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 10:37:11" (1/3) ... [2022-01-17 22:37:12,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c76c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 10:37:12, skipping insertion in model container [2022-01-17 22:37:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 10:37:12" (2/3) ... [2022-01-17 22:37:12,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c76c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 10:37:12, skipping insertion in model container [2022-01-17 22:37:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 10:37:12" (3/3) ... [2022-01-17 22:37:12,679 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2022-01-17 22:37:12,682 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 22:37:12,682 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 22:37:12,682 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-17 22:37:12,682 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 22:37:12,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,711 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,711 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,711 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,712 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,712 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,712 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,714 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,715 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,715 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,715 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,716 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,716 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,717 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,718 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,718 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,718 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,718 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,719 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,719 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,720 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,720 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,720 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,721 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,721 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,722 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,722 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,722 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,723 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,726 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,727 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,729 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,730 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,730 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,730 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,730 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,734 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,735 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,736 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,736 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,736 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 22:37:12,736 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-17 22:37:12,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 22:37:12,770 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, mAutomataTypeConcurrency=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 [2022-01-17 22:37:12,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-17 22:37:12,776 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 70 transitions, 150 flow [2022-01-17 22:37:12,832 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 783 states, 782 states have (on average 2.9271099744245523) internal successors, (2289), 782 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 783 states, 782 states have (on average 2.9271099744245523) internal successors, (2289), 782 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-17 22:37:12,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:12,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:12,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2022-01-17 22:37:12,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:12,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022042919] [2022-01-17 22:37:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:12,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:13,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:13,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022042919] [2022-01-17 22:37:13,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022042919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:37:13,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:37:13,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 22:37:13,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945533586] [2022-01-17 22:37:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:37:13,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 22:37:13,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 22:37:13,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-17 22:37:13,221 INFO L87 Difference]: Start difference. First operand has 783 states, 782 states have (on average 2.9271099744245523) internal successors, (2289), 782 states have internal predecessors, (2289), 0 states have call successors, (0), 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 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:13,365 INFO L93 Difference]: Finished difference Result 1542 states and 4129 transitions. [2022-01-17 22:37:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-17 22:37:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-01-17 22:37:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:13,386 INFO L225 Difference]: With dead ends: 1542 [2022-01-17 22:37:13,386 INFO L226 Difference]: Without dead ends: 1245 [2022-01-17 22:37:13,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-17 22:37:13,389 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:13,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 303 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:37:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-01-17 22:37:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 945. [2022-01-17 22:37:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.702330508474576) internal successors, (2551), 944 states have internal predecessors, (2551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2551 transitions. [2022-01-17 22:37:13,469 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2551 transitions. Word has length 35 [2022-01-17 22:37:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:13,469 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2551 transitions. [2022-01-17 22:37:13,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2551 transitions. [2022-01-17 22:37:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-17 22:37:13,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:13,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:13,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 22:37:13,477 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1832706688, now seen corresponding path program 1 times [2022-01-17 22:37:13,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:13,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069258153] [2022-01-17 22:37:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:13,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:13,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069258153] [2022-01-17 22:37:13,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069258153] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:37:13,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:37:13,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 22:37:13,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610200747] [2022-01-17 22:37:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:37:13,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 22:37:13,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 22:37:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-17 22:37:13,564 INFO L87 Difference]: Start difference. First operand 945 states and 2551 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:13,629 INFO L93 Difference]: Finished difference Result 1197 states and 3183 transitions. [2022-01-17 22:37:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-17 22:37:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-17 22:37:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:13,637 INFO L225 Difference]: With dead ends: 1197 [2022-01-17 22:37:13,637 INFO L226 Difference]: Without dead ends: 945 [2022-01-17 22:37:13,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-17 22:37:13,641 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:13,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 357 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:37:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-01-17 22:37:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 803. [2022-01-17 22:37:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 2.7219451371571073) internal successors, (2183), 802 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2183 transitions. [2022-01-17 22:37:13,672 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 2183 transitions. Word has length 39 [2022-01-17 22:37:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:13,673 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 2183 transitions. [2022-01-17 22:37:13,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 2183 transitions. [2022-01-17 22:37:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-17 22:37:13,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:13,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:13,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 22:37:13,675 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1559123106, now seen corresponding path program 1 times [2022-01-17 22:37:13,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:13,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631453054] [2022-01-17 22:37:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:13,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:13,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:13,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631453054] [2022-01-17 22:37:13,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631453054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:37:13,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:37:13,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 22:37:13,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228324691] [2022-01-17 22:37:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:37:13,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 22:37:13,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 22:37:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 22:37:13,783 INFO L87 Difference]: Start difference. First operand 803 states and 2183 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:13,874 INFO L93 Difference]: Finished difference Result 1945 states and 5271 transitions. [2022-01-17 22:37:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-17 22:37:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-17 22:37:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:13,880 INFO L225 Difference]: With dead ends: 1945 [2022-01-17 22:37:13,880 INFO L226 Difference]: Without dead ends: 1521 [2022-01-17 22:37:13,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-17 22:37:13,881 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:13,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 383 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:37:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2022-01-17 22:37:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1021. [2022-01-17 22:37:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 2.7) internal successors, (2754), 1020 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2754 transitions. [2022-01-17 22:37:13,904 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2754 transitions. Word has length 39 [2022-01-17 22:37:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:13,904 INFO L470 AbstractCegarLoop]: Abstraction has 1021 states and 2754 transitions. [2022-01-17 22:37:13,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2754 transitions. [2022-01-17 22:37:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-17 22:37:13,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:13,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:13,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 22:37:13,906 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1227227950, now seen corresponding path program 2 times [2022-01-17 22:37:13,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:13,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502688839] [2022-01-17 22:37:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:13,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:13,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:13,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502688839] [2022-01-17 22:37:13,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502688839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:37:13,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:37:13,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 22:37:13,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818206984] [2022-01-17 22:37:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:37:13,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 22:37:13,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 22:37:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-17 22:37:13,995 INFO L87 Difference]: Start difference. First operand 1021 states and 2754 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:14,040 INFO L93 Difference]: Finished difference Result 1341 states and 3466 transitions. [2022-01-17 22:37:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 22:37:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-17 22:37:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:14,045 INFO L225 Difference]: With dead ends: 1341 [2022-01-17 22:37:14,045 INFO L226 Difference]: Without dead ends: 1031 [2022-01-17 22:37:14,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-17 22:37:14,051 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:14,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 331 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:37:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-01-17 22:37:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 879. [2022-01-17 22:37:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 2.7004555808656034) internal successors, (2371), 878 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 2371 transitions. [2022-01-17 22:37:14,071 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 2371 transitions. Word has length 39 [2022-01-17 22:37:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:14,071 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 2371 transitions. [2022-01-17 22:37:14,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 2371 transitions. [2022-01-17 22:37:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-17 22:37:14,073 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:14,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:14,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 22:37:14,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2144864227, now seen corresponding path program 1 times [2022-01-17 22:37:14,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107254145] [2022-01-17 22:37:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:14,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:14,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107254145] [2022-01-17 22:37:14,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107254145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 22:37:14,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 22:37:14,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 22:37:14,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049558533] [2022-01-17 22:37:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 22:37:14,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 22:37:14,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:14,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 22:37:14,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 22:37:14,168 INFO L87 Difference]: Start difference. First operand 879 states and 2371 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:14,270 INFO L93 Difference]: Finished difference Result 1679 states and 4555 transitions. [2022-01-17 22:37:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-17 22:37:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-01-17 22:37:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:14,274 INFO L225 Difference]: With dead ends: 1679 [2022-01-17 22:37:14,274 INFO L226 Difference]: Without dead ends: 1169 [2022-01-17 22:37:14,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-01-17 22:37:14,275 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 218 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:14,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 359 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 22:37:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-01-17 22:37:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 925. [2022-01-17 22:37:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 2.727272727272727) internal successors, (2520), 924 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 2520 transitions. [2022-01-17 22:37:14,295 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 2520 transitions. Word has length 43 [2022-01-17 22:37:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:14,295 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 2520 transitions. [2022-01-17 22:37:14,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 2520 transitions. [2022-01-17 22:37:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-17 22:37:14,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:14,297 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:14,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 22:37:14,297 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1916960660, now seen corresponding path program 1 times [2022-01-17 22:37:14,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:14,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924609378] [2022-01-17 22:37:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:14,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:14,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:14,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924609378] [2022-01-17 22:37:14,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924609378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:37:14,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048144978] [2022-01-17 22:37:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:14,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:14,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:14,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:37:14,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-17 22:37:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:14,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-17 22:37:14,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:37:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:14,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:37:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:14,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048144978] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:37:14,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:37:14,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-01-17 22:37:14,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402857507] [2022-01-17 22:37:14,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:37:14,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-17 22:37:14,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-17 22:37:14,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-17 22:37:14,831 INFO L87 Difference]: Start difference. First operand 925 states and 2520 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:15,185 INFO L93 Difference]: Finished difference Result 2809 states and 7614 transitions. [2022-01-17 22:37:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-17 22:37:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 48 [2022-01-17 22:37:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:15,193 INFO L225 Difference]: With dead ends: 2809 [2022-01-17 22:37:15,193 INFO L226 Difference]: Without dead ends: 1659 [2022-01-17 22:37:15,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2022-01-17 22:37:15,194 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 488 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:15,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 980 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 22:37:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-01-17 22:37:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1544. [2022-01-17 22:37:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 2.73298768632534) internal successors, (4217), 1543 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 4217 transitions. [2022-01-17 22:37:15,237 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 4217 transitions. Word has length 48 [2022-01-17 22:37:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:15,238 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 4217 transitions. [2022-01-17 22:37:15,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 4217 transitions. [2022-01-17 22:37:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-17 22:37:15,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:15,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:15,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-17 22:37:15,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-17 22:37:15,455 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash 748118096, now seen corresponding path program 1 times [2022-01-17 22:37:15,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:15,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922798001] [2022-01-17 22:37:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:15,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:15,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922798001] [2022-01-17 22:37:15,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922798001] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:37:15,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967784084] [2022-01-17 22:37:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:15,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:15,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:37:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-17 22:37:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:15,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-17 22:37:15,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:37:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:15,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:37:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:15,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967784084] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:37:15,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:37:15,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-01-17 22:37:15,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040303926] [2022-01-17 22:37:15,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:37:15,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-17 22:37:15,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-17 22:37:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-17 22:37:15,791 INFO L87 Difference]: Start difference. First operand 1544 states and 4217 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:16,203 INFO L93 Difference]: Finished difference Result 3796 states and 10320 transitions. [2022-01-17 22:37:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-17 22:37:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 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 53 [2022-01-17 22:37:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:16,214 INFO L225 Difference]: With dead ends: 3796 [2022-01-17 22:37:16,214 INFO L226 Difference]: Without dead ends: 2469 [2022-01-17 22:37:16,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2022-01-17 22:37:16,215 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 761 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:16,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 761 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 22:37:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2022-01-17 22:37:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 1450. [2022-01-17 22:37:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 2.712215320910973) internal successors, (3930), 1449 states have internal predecessors, (3930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3930 transitions. [2022-01-17 22:37:16,255 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3930 transitions. Word has length 53 [2022-01-17 22:37:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:16,255 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 3930 transitions. [2022-01-17 22:37:16,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3930 transitions. [2022-01-17 22:37:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-17 22:37:16,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:16,257 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:16,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-17 22:37:16,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-17 22:37:16,478 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash 245398254, now seen corresponding path program 2 times [2022-01-17 22:37:16,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:16,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999152607] [2022-01-17 22:37:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:16,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:16,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:16,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999152607] [2022-01-17 22:37:16,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999152607] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:37:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390124783] [2022-01-17 22:37:16,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-17 22:37:16,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:16,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:16,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:37:16,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-17 22:37:16,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-17 22:37:16,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:37:16,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-17 22:37:16,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:37:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:16,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:37:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:16,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390124783] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:37:16,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:37:16,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-01-17 22:37:16,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686658810] [2022-01-17 22:37:16,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:37:16,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-17 22:37:16,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:16,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-17 22:37:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-17 22:37:16,961 INFO L87 Difference]: Start difference. First operand 1450 states and 3930 transitions. Second operand has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:17,643 INFO L93 Difference]: Finished difference Result 5163 states and 14194 transitions. [2022-01-17 22:37:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-17 22:37:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 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 73 [2022-01-17 22:37:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:17,654 INFO L225 Difference]: With dead ends: 5163 [2022-01-17 22:37:17,654 INFO L226 Difference]: Without dead ends: 3059 [2022-01-17 22:37:17,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1133, Invalid=3027, Unknown=0, NotChecked=0, Total=4160 [2022-01-17 22:37:17,656 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 1186 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:17,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 1238 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 22:37:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2022-01-17 22:37:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2269. [2022-01-17 22:37:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2268 states have (on average 2.736772486772487) internal successors, (6207), 2268 states have internal predecessors, (6207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 6207 transitions. [2022-01-17 22:37:17,730 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 6207 transitions. Word has length 73 [2022-01-17 22:37:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:17,730 INFO L470 AbstractCegarLoop]: Abstraction has 2269 states and 6207 transitions. [2022-01-17 22:37:17,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 6207 transitions. [2022-01-17 22:37:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-17 22:37:17,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:17,734 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:17,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-17 22:37:17,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:17,951 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 222177227, now seen corresponding path program 3 times [2022-01-17 22:37:17,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:17,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918024874] [2022-01-17 22:37:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:17,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:18,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918024874] [2022-01-17 22:37:18,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918024874] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:37:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4129336] [2022-01-17 22:37:18,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-17 22:37:18,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:18,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:37:18,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-17 22:37:18,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-01-17 22:37:18,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:37:18,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-17 22:37:18,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:37:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:18,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:37:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:18,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4129336] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:37:18,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:37:18,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2022-01-17 22:37:18,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697692575] [2022-01-17 22:37:18,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:37:18,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-17 22:37:18,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-17 22:37:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2022-01-17 22:37:18,726 INFO L87 Difference]: Start difference. First operand 2269 states and 6207 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:20,282 INFO L93 Difference]: Finished difference Result 8561 states and 23670 transitions. [2022-01-17 22:37:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-17 22:37:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 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 103 [2022-01-17 22:37:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:20,298 INFO L225 Difference]: With dead ends: 8561 [2022-01-17 22:37:20,298 INFO L226 Difference]: Without dead ends: 5034 [2022-01-17 22:37:20,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3634 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2959, Invalid=8383, Unknown=0, NotChecked=0, Total=11342 [2022-01-17 22:37:20,300 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 2701 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:20,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2701 Valid, 1678 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 22:37:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2022-01-17 22:37:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 3450. [2022-01-17 22:37:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3449 states have (on average 2.734125833574949) internal successors, (9430), 3449 states have internal predecessors, (9430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 9430 transitions. [2022-01-17 22:37:20,359 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 9430 transitions. Word has length 103 [2022-01-17 22:37:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:20,359 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 9430 transitions. [2022-01-17 22:37:20,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 9430 transitions. [2022-01-17 22:37:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-01-17 22:37:20,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:20,366 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:20,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-17 22:37:20,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:20,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1908104056, now seen corresponding path program 4 times [2022-01-17 22:37:20,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:20,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720329947] [2022-01-17 22:37:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:20,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 22:37:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:20,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 22:37:20,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720329947] [2022-01-17 22:37:20,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720329947] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-17 22:37:20,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724727670] [2022-01-17 22:37:20,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-17 22:37:20,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-17 22:37:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 22:37:20,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-17 22:37:20,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-17 22:37:20,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-17 22:37:20,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-17 22:37:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-17 22:37:20,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-17 22:37:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:21,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-17 22:37:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 22:37:21,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724727670] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-17 22:37:21,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-17 22:37:21,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 50 [2022-01-17 22:37:21,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306625410] [2022-01-17 22:37:21,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-17 22:37:21,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-17 22:37:21,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 22:37:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-17 22:37:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2022-01-17 22:37:21,805 INFO L87 Difference]: Start difference. First operand 3450 states and 9430 transitions. Second operand has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 22:37:24,404 INFO L93 Difference]: Finished difference Result 11083 states and 30570 transitions. [2022-01-17 22:37:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-01-17 22:37:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 0 states have call successors, (0), 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 173 [2022-01-17 22:37:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 22:37:24,418 INFO L225 Difference]: With dead ends: 11083 [2022-01-17 22:37:24,419 INFO L226 Difference]: Without dead ends: 7659 [2022-01-17 22:37:24,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6101, Invalid=16249, Unknown=0, NotChecked=0, Total=22350 [2022-01-17 22:37:24,423 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 3186 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3186 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-17 22:37:24,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3186 Valid, 1959 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-17 22:37:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2022-01-17 22:37:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 4869. [2022-01-17 22:37:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 2.743837304847987) internal successors, (13357), 4868 states have internal predecessors, (13357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 13357 transitions. [2022-01-17 22:37:24,559 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 13357 transitions. Word has length 173 [2022-01-17 22:37:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 22:37:24,559 INFO L470 AbstractCegarLoop]: Abstraction has 4869 states and 13357 transitions. [2022-01-17 22:37:24,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 22:37:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 13357 transitions. [2022-01-17 22:37:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-17 22:37:24,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 22:37:24,572 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 22:37:24,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-17 22:37:24,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-17 22:37:24,787 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-17 22:37:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 22:37:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1917241726, now seen corresponding path program 5 times [2022-01-17 22:37:24,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 22:37:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867579538] [2022-01-17 22:37:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 22:37:24,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 22:37:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 22:37:24,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-17 22:37:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 22:37:24,920 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-17 22:37:24,921 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-17 22:37:24,922 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-17 22:37:24,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-17 22:37:24,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-17 22:37:24,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 22:37:24,925 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2022-01-17 22:37:24,927 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 22:37:24,930 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 22:37:25,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 10:37:25 BasicIcfg [2022-01-17 22:37:25,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 22:37:25,034 INFO L158 Benchmark]: Toolchain (without parser) took 13218.26ms. Allocated memory was 388.0MB in the beginning and 643.8MB in the end (delta: 255.9MB). Free memory was 333.0MB in the beginning and 485.2MB in the end (delta: -152.2MB). Peak memory consumption was 105.0MB. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 388.0MB. Free memory is still 350.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.82ms. Allocated memory was 388.0MB in the beginning and 534.8MB in the end (delta: 146.8MB). Free memory was 332.8MB in the beginning and 498.1MB in the end (delta: -165.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.99ms. Allocated memory is still 534.8MB. Free memory was 498.1MB in the beginning and 496.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 534.8MB. Free memory was 496.0MB in the beginning and 495.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: RCFGBuilder took 345.30ms. Allocated memory is still 534.8MB. Free memory was 495.0MB in the beginning and 479.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-17 22:37:25,035 INFO L158 Benchmark]: TraceAbstraction took 12359.93ms. Allocated memory was 534.8MB in the beginning and 643.8MB in the end (delta: 109.1MB). Free memory was 479.2MB in the beginning and 485.2MB in the end (delta: -6.0MB). Peak memory consumption was 105.2MB. Max. memory is 16.0GB. [2022-01-17 22:37:25,036 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.09ms. Allocated memory is still 388.0MB. Free memory is still 350.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 436.82ms. Allocated memory was 388.0MB in the beginning and 534.8MB in the end (delta: 146.8MB). Free memory was 332.8MB in the beginning and 498.1MB in the end (delta: -165.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.99ms. Allocated memory is still 534.8MB. Free memory was 498.1MB in the beginning and 496.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 534.8MB. Free memory was 496.0MB in the beginning and 495.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 345.30ms. Allocated memory is still 534.8MB. Free memory was 495.0MB in the beginning and 479.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 12359.93ms. Allocated memory was 534.8MB in the beginning and 643.8MB in the end (delta: 109.1MB). Free memory was 479.2MB in the beginning and 485.2MB in the end (delta: -6.0MB). Peak memory consumption was 105.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=1, k++=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=7, id1={5:0}, id2={3:0}, j=6, k=1, pthread_create(&id2, ((void *)0), t2, ((void *)0))=7] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=10] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=10] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=11] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=12] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=12] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=13] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=14] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=16] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=17] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - UnprovableResult [Line: 713]: 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: 714]: 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, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9010 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9010 mSDsluCounter, 8349 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7456 mSDsCounter, 905 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1478 IncrementalHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 905 mSolverCounterUnsat, 973 mSDtfsCounter, 1478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1280 GetRequests, 852 SyntacticMatches, 2 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13051 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4869occurred in iteration=10, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 7636 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1328 NumberOfCodeBlocks, 1328 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1016 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 0/3162 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! [2022-01-17 22:37:25,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...