/usr/bin/java -Xmx8000000000 -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/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:14:57,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:14:57,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:14:57,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:14:57,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:14:57,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:14:57,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:14:57,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:14:57,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:14:57,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:14:57,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:14:57,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:14:57,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:14:57,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:14:57,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:14:57,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:14:57,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:14:57,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:14:57,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:14:57,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:14:57,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:14:57,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:14:57,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:14:57,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:14:57,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:14:57,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:14:57,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:14:57,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:14:57,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:14:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:14:57,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:14:57,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:14:57,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:14:57,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:14:57,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:14:57,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:14:57,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:14:57,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:14:57,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:14:57,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:14:57,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:14:57,695 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-03-03 17:14:57,732 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:14:57,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:14:57,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:14:57,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:14:57,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:14:57,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:14:57,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:14:57,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:14:57,735 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:14:57,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:14:57,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:14:57,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:14:57,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:14:57,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:14:57,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:14:57,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:14:57,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:14:57,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:14:57,738 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:14:57,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:14:57,739 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-03-03 17:14:57,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:14:57,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:14:57,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:14:57,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:14:57,981 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:14:57,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-03-03 17:14:58,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b16442/14c2f6ce563e4c41b3d70b013f8f892d/FLAGdf6ea75d0 [2022-03-03 17:14:58,374 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:14:58,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-03-03 17:14:58,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b16442/14c2f6ce563e4c41b3d70b013f8f892d/FLAGdf6ea75d0 [2022-03-03 17:14:58,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b16442/14c2f6ce563e4c41b3d70b013f8f892d [2022-03-03 17:14:58,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:14:58,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:14:58,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:14:58,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:14:58,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:14:58,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:14:58" (1/1) ... [2022-03-03 17:14:58,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2acba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:58, skipping insertion in model container [2022-03-03 17:14:58,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:14:58" (1/1) ... [2022-03-03 17:14:58,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:14:58,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:14:59,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-03-03 17:14:59,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:14:59,054 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:14:59,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-03-03 17:14:59,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:14:59,123 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:14:59,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59 WrapperNode [2022-03-03 17:14:59,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:14:59,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:14:59,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:14:59,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:14:59,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,186 INFO L137 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 319 [2022-03-03 17:14:59,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:14:59,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:14:59,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:14:59,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:14:59,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:14:59,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:14:59,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:14:59,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:14:59,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (1/1) ... [2022-03-03 17:14:59,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:14:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:59,265 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-03-03 17:14:59,278 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-03-03 17:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:14:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:14:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:14:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:14:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:14:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:14:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:14:59,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:14:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-03 17:14:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:14:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:14:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:14:59,311 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:14:59,426 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:14:59,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:14:59,806 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:15:00,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:15:00,005 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-03 17:15:00,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:15:00 BoogieIcfgContainer [2022-03-03 17:15:00,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:15:00,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:15:00,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:15:00,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:15:00,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:14:58" (1/3) ... [2022-03-03 17:15:00,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb2d6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:15:00, skipping insertion in model container [2022-03-03 17:15:00,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:14:59" (2/3) ... [2022-03-03 17:15:00,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb2d6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:15:00, skipping insertion in model container [2022-03-03 17:15:00,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:15:00" (3/3) ... [2022-03-03 17:15:00,018 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2022-03-03 17:15:00,024 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:15:00,024 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:15:00,024 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:15:00,024 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:15:00,086 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,087 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,088 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,089 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,091 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,093 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,093 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,094 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,094 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,101 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,113 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,116 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,122 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,122 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,123 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,124 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,125 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,125 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,125 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,125 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,126 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,126 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,126 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,126 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,126 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,127 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,127 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,127 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,129 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,129 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,142 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,142 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,142 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,142 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,143 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:15:00,148 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-03 17:15:00,203 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:15:00,212 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, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:15:00,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-03 17:15:00,229 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 241 places, 247 transitions, 526 flow [2022-03-03 17:15:01,107 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17163 states, 17162 states have (on average 4.972788719263489) internal successors, (85343), 17162 states have internal predecessors, (85343), 0 states have call successors, (0), 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-03-03 17:15:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 17163 states, 17162 states have (on average 4.972788719263489) internal successors, (85343), 17162 states have internal predecessors, (85343), 0 states have call successors, (0), 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-03-03 17:15:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-03-03 17:15:01,299 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:01,300 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, 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, 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, 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, 1, 1, 1, 1] [2022-03-03 17:15:01,301 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 700030212, now seen corresponding path program 1 times [2022-03-03 17:15:01,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:01,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002501528] [2022-03-03 17:15:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:01,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:01,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002501528] [2022-03-03 17:15:01,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002501528] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:01,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:01,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:15:01,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312600661] [2022-03-03 17:15:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:01,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:15:01,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:15:01,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:15:01,749 INFO L87 Difference]: Start difference. First operand has 17163 states, 17162 states have (on average 4.972788719263489) internal successors, (85343), 17162 states have internal predecessors, (85343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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-03-03 17:15:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:02,284 INFO L93 Difference]: Finished difference Result 17163 states and 76928 transitions. [2022-03-03 17:15:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:15:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2022-03-03 17:15:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:02,491 INFO L225 Difference]: With dead ends: 17163 [2022-03-03 17:15:02,491 INFO L226 Difference]: Without dead ends: 17156 [2022-03-03 17:15:02,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:15:02,496 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:02,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:15:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17156 states. [2022-03-03 17:15:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17156 to 17156. [2022-03-03 17:15:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17156 states, 17155 states have (on average 4.483882250072865) internal successors, (76921), 17155 states have internal predecessors, (76921), 0 states have call successors, (0), 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-03-03 17:15:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17156 states to 17156 states and 76921 transitions. [2022-03-03 17:15:03,690 INFO L78 Accepts]: Start accepts. Automaton has 17156 states and 76921 transitions. Word has length 182 [2022-03-03 17:15:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:03,692 INFO L470 AbstractCegarLoop]: Abstraction has 17156 states and 76921 transitions. [2022-03-03 17:15:03,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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-03-03 17:15:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 17156 states and 76921 transitions. [2022-03-03 17:15:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-03-03 17:15:03,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:03,942 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, 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, 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, 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, 1, 1, 1, 1] [2022-03-03 17:15:03,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:15:03,944 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2075849468, now seen corresponding path program 1 times [2022-03-03 17:15:03,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:03,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452556611] [2022-03-03 17:15:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:04,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:04,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452556611] [2022-03-03 17:15:04,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452556611] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:04,269 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:04,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 17:15:04,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658254440] [2022-03-03 17:15:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:04,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:15:04,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:15:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:15:04,272 INFO L87 Difference]: Start difference. First operand 17156 states and 76921 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 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-03-03 17:15:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:04,806 INFO L93 Difference]: Finished difference Result 23030 states and 103765 transitions. [2022-03-03 17:15:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:15:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2022-03-03 17:15:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:05,112 INFO L225 Difference]: With dead ends: 23030 [2022-03-03 17:15:05,112 INFO L226 Difference]: Without dead ends: 23030 [2022-03-03 17:15:05,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:15:05,114 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 173 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:05,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 656 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23030 states. [2022-03-03 17:15:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23030 to 19114. [2022-03-03 17:15:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19114 states, 19113 states have (on average 4.4927013027782134) internal successors, (85869), 19113 states have internal predecessors, (85869), 0 states have call successors, (0), 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-03-03 17:15:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19114 states to 19114 states and 85869 transitions. [2022-03-03 17:15:06,393 INFO L78 Accepts]: Start accepts. Automaton has 19114 states and 85869 transitions. Word has length 182 [2022-03-03 17:15:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:06,393 INFO L470 AbstractCegarLoop]: Abstraction has 19114 states and 85869 transitions. [2022-03-03 17:15:06,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 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-03-03 17:15:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19114 states and 85869 transitions. [2022-03-03 17:15:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:06,475 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:06,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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:06,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:15:06,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash 154825513, now seen corresponding path program 1 times [2022-03-03 17:15:06,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:06,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208868773] [2022-03-03 17:15:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:06,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:06,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208868773] [2022-03-03 17:15:06,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208868773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:15:06,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320804613] [2022-03-03 17:15:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:15:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:15:06,715 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-03-03 17:15:06,743 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-03-03 17:15:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:06,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-03 17:15:06,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:15:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:07,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:15:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:08,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320804613] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:15:08,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:15:08,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 10] total 21 [2022-03-03 17:15:08,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019160152] [2022-03-03 17:15:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:08,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:15:08,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:15:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:15:08,063 INFO L87 Difference]: Start difference. First operand 19114 states and 85869 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:08,789 INFO L93 Difference]: Finished difference Result 36841 states and 166581 transitions. [2022-03-03 17:15:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 17:15:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:09,080 INFO L225 Difference]: With dead ends: 36841 [2022-03-03 17:15:09,080 INFO L226 Difference]: Without dead ends: 36841 [2022-03-03 17:15:09,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-03-03 17:15:09,083 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 549 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:09,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1209 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:15:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36841 states. [2022-03-03 17:15:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36841 to 23626. [2022-03-03 17:15:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23626 states, 23625 states have (on average 4.500952380952381) internal successors, (106335), 23625 states have internal predecessors, (106335), 0 states have call successors, (0), 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-03-03 17:15:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23626 states to 23626 states and 106335 transitions. [2022-03-03 17:15:10,532 INFO L78 Accepts]: Start accepts. Automaton has 23626 states and 106335 transitions. Word has length 186 [2022-03-03 17:15:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:10,535 INFO L470 AbstractCegarLoop]: Abstraction has 23626 states and 106335 transitions. [2022-03-03 17:15:10,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23626 states and 106335 transitions. [2022-03-03 17:15:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:10,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:10,698 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:10,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 17:15:10,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:15:10,902 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1698395801, now seen corresponding path program 2 times [2022-03-03 17:15:10,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:10,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760399776] [2022-03-03 17:15:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:11,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:11,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760399776] [2022-03-03 17:15:11,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760399776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:11,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:11,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:11,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880689764] [2022-03-03 17:15:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:11,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:11,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:11,089 INFO L87 Difference]: Start difference. First operand 23626 states and 106335 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:11,765 INFO L93 Difference]: Finished difference Result 34091 states and 153970 transitions. [2022-03-03 17:15:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:15:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:11,984 INFO L225 Difference]: With dead ends: 34091 [2022-03-03 17:15:11,984 INFO L226 Difference]: Without dead ends: 34091 [2022-03-03 17:15:11,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-03 17:15:11,985 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 159 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:11,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 998 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34091 states. [2022-03-03 17:15:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34091 to 23028. [2022-03-03 17:15:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23028 states, 23027 states have (on average 4.501975941286316) internal successors, (103667), 23027 states have internal predecessors, (103667), 0 states have call successors, (0), 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-03-03 17:15:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23028 states to 23028 states and 103667 transitions. [2022-03-03 17:15:13,230 INFO L78 Accepts]: Start accepts. Automaton has 23028 states and 103667 transitions. Word has length 186 [2022-03-03 17:15:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:13,231 INFO L470 AbstractCegarLoop]: Abstraction has 23028 states and 103667 transitions. [2022-03-03 17:15:13,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 23028 states and 103667 transitions. [2022-03-03 17:15:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:13,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:13,293 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:13,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:15:13,294 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash -303133097, now seen corresponding path program 3 times [2022-03-03 17:15:13,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:13,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708150271] [2022-03-03 17:15:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:13,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:13,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708150271] [2022-03-03 17:15:13,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708150271] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:13,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:13,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:13,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350317656] [2022-03-03 17:15:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:13,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:13,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:13,689 INFO L87 Difference]: Start difference. First operand 23028 states and 103667 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:14,649 INFO L93 Difference]: Finished difference Result 54400 states and 244060 transitions. [2022-03-03 17:15:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:15:14,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:14,984 INFO L225 Difference]: With dead ends: 54400 [2022-03-03 17:15:14,984 INFO L226 Difference]: Without dead ends: 54400 [2022-03-03 17:15:14,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:15:14,985 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 222 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:14,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 967 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54400 states. [2022-03-03 17:15:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54400 to 23572. [2022-03-03 17:15:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23572 states, 23571 states have (on average 4.539264350260914) internal successors, (106995), 23571 states have internal predecessors, (106995), 0 states have call successors, (0), 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-03-03 17:15:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23572 states to 23572 states and 106995 transitions. [2022-03-03 17:15:16,400 INFO L78 Accepts]: Start accepts. Automaton has 23572 states and 106995 transitions. Word has length 186 [2022-03-03 17:15:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:16,400 INFO L470 AbstractCegarLoop]: Abstraction has 23572 states and 106995 transitions. [2022-03-03 17:15:16,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23572 states and 106995 transitions. [2022-03-03 17:15:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:16,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:16,469 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:16,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:15:16,470 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -149105601, now seen corresponding path program 4 times [2022-03-03 17:15:16,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:16,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066009239] [2022-03-03 17:15:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:16,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:16,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066009239] [2022-03-03 17:15:16,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066009239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:16,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:16,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:16,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389639248] [2022-03-03 17:15:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:16,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:16,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:16,656 INFO L87 Difference]: Start difference. First operand 23572 states and 106995 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:17,450 INFO L93 Difference]: Finished difference Result 35533 states and 158727 transitions. [2022-03-03 17:15:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 17:15:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:17,623 INFO L225 Difference]: With dead ends: 35533 [2022-03-03 17:15:17,624 INFO L226 Difference]: Without dead ends: 34717 [2022-03-03 17:15:17,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:15:17,626 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 163 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:17,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 940 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34717 states. [2022-03-03 17:15:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34717 to 24388. [2022-03-03 17:15:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24388 states, 24387 states have (on average 4.519580104153852) internal successors, (110219), 24387 states have internal predecessors, (110219), 0 states have call successors, (0), 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-03-03 17:15:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24388 states to 24388 states and 110219 transitions. [2022-03-03 17:15:18,750 INFO L78 Accepts]: Start accepts. Automaton has 24388 states and 110219 transitions. Word has length 186 [2022-03-03 17:15:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:18,750 INFO L470 AbstractCegarLoop]: Abstraction has 24388 states and 110219 transitions. [2022-03-03 17:15:18,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24388 states and 110219 transitions. [2022-03-03 17:15:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:18,810 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:18,810 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:18,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 17:15:18,811 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash 337966567, now seen corresponding path program 5 times [2022-03-03 17:15:18,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:18,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604945664] [2022-03-03 17:15:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:18,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:18,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:18,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604945664] [2022-03-03 17:15:18,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604945664] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:18,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:18,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:18,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051064316] [2022-03-03 17:15:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:18,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:18,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:18,937 INFO L87 Difference]: Start difference. First operand 24388 states and 110219 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:19,595 INFO L93 Difference]: Finished difference Result 47139 states and 209853 transitions. [2022-03-03 17:15:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 17:15:19,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:19,832 INFO L225 Difference]: With dead ends: 47139 [2022-03-03 17:15:19,832 INFO L226 Difference]: Without dead ends: 47139 [2022-03-03 17:15:19,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:19,833 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 181 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:19,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 531 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47139 states. [2022-03-03 17:15:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47139 to 23844. [2022-03-03 17:15:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23844 states, 23843 states have (on average 4.494526695466175) internal successors, (107163), 23843 states have internal predecessors, (107163), 0 states have call successors, (0), 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-03-03 17:15:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23844 states to 23844 states and 107163 transitions. [2022-03-03 17:15:21,175 INFO L78 Accepts]: Start accepts. Automaton has 23844 states and 107163 transitions. Word has length 186 [2022-03-03 17:15:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:21,175 INFO L470 AbstractCegarLoop]: Abstraction has 23844 states and 107163 transitions. [2022-03-03 17:15:21,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 23844 states and 107163 transitions. [2022-03-03 17:15:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:21,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:21,231 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:21,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 17:15:21,231 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash 817851647, now seen corresponding path program 6 times [2022-03-03 17:15:21,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:21,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123222078] [2022-03-03 17:15:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:21,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:21,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123222078] [2022-03-03 17:15:21,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123222078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:21,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:21,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:21,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577209740] [2022-03-03 17:15:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:21,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:21,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:21,382 INFO L87 Difference]: Start difference. First operand 23844 states and 107163 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:21,999 INFO L93 Difference]: Finished difference Result 40754 states and 179154 transitions. [2022-03-03 17:15:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 17:15:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:22,199 INFO L225 Difference]: With dead ends: 40754 [2022-03-03 17:15:22,199 INFO L226 Difference]: Without dead ends: 39938 [2022-03-03 17:15:22,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:22,199 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 163 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:22,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 563 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states. [2022-03-03 17:15:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 23300. [2022-03-03 17:15:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23300 states, 23299 states have (on average 4.456629039872956) internal successors, (103835), 23299 states have internal predecessors, (103835), 0 states have call successors, (0), 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-03-03 17:15:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23300 states to 23300 states and 103835 transitions. [2022-03-03 17:15:23,369 INFO L78 Accepts]: Start accepts. Automaton has 23300 states and 103835 transitions. Word has length 186 [2022-03-03 17:15:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:23,369 INFO L470 AbstractCegarLoop]: Abstraction has 23300 states and 103835 transitions. [2022-03-03 17:15:23,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23300 states and 103835 transitions. [2022-03-03 17:15:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-03-03 17:15:23,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:23,434 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:23,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 17:15:23,435 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1629913357, now seen corresponding path program 7 times [2022-03-03 17:15:23,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:23,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678005094] [2022-03-03 17:15:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:23,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:23,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678005094] [2022-03-03 17:15:23,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678005094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:23,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:23,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 17:15:23,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364077276] [2022-03-03 17:15:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:23,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 17:15:23,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 17:15:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:23,540 INFO L87 Difference]: Start difference. First operand 23300 states and 103835 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:23,853 INFO L93 Difference]: Finished difference Result 24713 states and 106950 transitions. [2022-03-03 17:15:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 17:15:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2022-03-03 17:15:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:23,971 INFO L225 Difference]: With dead ends: 24713 [2022-03-03 17:15:23,971 INFO L226 Difference]: Without dead ends: 23081 [2022-03-03 17:15:23,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-03 17:15:23,972 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 148 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:23,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 526 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23081 states. [2022-03-03 17:15:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23081 to 19220. [2022-03-03 17:15:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19220 states, 19219 states have (on average 4.436599198709611) internal successors, (85267), 19219 states have internal predecessors, (85267), 0 states have call successors, (0), 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-03-03 17:15:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 85267 transitions. [2022-03-03 17:15:24,705 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 85267 transitions. Word has length 186 [2022-03-03 17:15:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:24,705 INFO L470 AbstractCegarLoop]: Abstraction has 19220 states and 85267 transitions. [2022-03-03 17:15:24,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 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-03-03 17:15:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 85267 transitions. [2022-03-03 17:15:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-03-03 17:15:24,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:24,749 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:24,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 17:15:24,750 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash 23893394, now seen corresponding path program 1 times [2022-03-03 17:15:24,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:24,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787947509] [2022-03-03 17:15:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:15:25,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:25,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787947509] [2022-03-03 17:15:25,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787947509] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:15:25,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:15:25,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:15:25,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544679163] [2022-03-03 17:15:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:15:25,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:15:25,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:25,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:15:25,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:15:25,031 INFO L87 Difference]: Start difference. First operand 19220 states and 85267 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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-03-03 17:15:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:25,275 INFO L93 Difference]: Finished difference Result 21890 states and 95415 transitions. [2022-03-03 17:15:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 17:15:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-03-03 17:15:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:25,346 INFO L225 Difference]: With dead ends: 21890 [2022-03-03 17:15:25,346 INFO L226 Difference]: Without dead ends: 19226 [2022-03-03 17:15:25,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-03-03 17:15:25,347 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 135 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:25,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 823 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:15:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19226 states. [2022-03-03 17:15:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19226 to 19221. [2022-03-03 17:15:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19221 states, 19220 states have (on average 4.436420395421436) internal successors, (85268), 19220 states have internal predecessors, (85268), 0 states have call successors, (0), 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-03-03 17:15:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19221 states to 19221 states and 85268 transitions. [2022-03-03 17:15:26,015 INFO L78 Accepts]: Start accepts. Automaton has 19221 states and 85268 transitions. Word has length 189 [2022-03-03 17:15:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:26,016 INFO L470 AbstractCegarLoop]: Abstraction has 19221 states and 85268 transitions. [2022-03-03 17:15:26,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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-03-03 17:15:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19221 states and 85268 transitions. [2022-03-03 17:15:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-03-03 17:15:26,061 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:26,061 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:26,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 17:15:26,062 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1871631607, now seen corresponding path program 1 times [2022-03-03 17:15:26,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:26,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213674467] [2022-03-03 17:15:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:27,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213674467] [2022-03-03 17:15:27,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213674467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:15:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116579973] [2022-03-03 17:15:27,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:27,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:15:27,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:15:27,288 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-03-03 17:15:27,292 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-03-03 17:15:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:27,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-03 17:15:27,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:15:27,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:15:27,596 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:15:27,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-03 17:15:27,661 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:15:27,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-03 17:15:28,433 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:15:28,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-03 17:15:28,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:15:29,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:15:30,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:15:30,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:15:30,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:15:30,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:15:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:31,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:15:34,340 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:15:34,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-03-03 17:15:34,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 699 treesize of output 659 [2022-03-03 17:15:34,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 542 [2022-03-03 17:15:34,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 267 [2022-03-03 17:15:34,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 518 treesize of output 470 [2022-03-03 17:15:37,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:15:37,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-03 17:15:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:37,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116579973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:15:37,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:15:37,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31, 31] total 75 [2022-03-03 17:15:37,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645261689] [2022-03-03 17:15:37,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:15:37,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-03 17:15:37,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-03 17:15:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=5068, Unknown=48, NotChecked=0, Total=5550 [2022-03-03 17:15:37,082 INFO L87 Difference]: Start difference. First operand 19221 states and 85268 transitions. Second operand has 75 states, 75 states have (on average 6.426666666666667) internal successors, (482), 75 states have internal predecessors, (482), 0 states have call successors, (0), 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-03-03 17:15:39,419 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 c_~total~0) (forall ((~q1_back~0 Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_270)) (.cse1 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (<= c_~n1~0 ~q1_back~0) (<= (select (select .cse0 c_~q1~0.base) .cse1) 0) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~q1~0.base) .cse1) c_~total~0)) (< ~q1_back~0 0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) is different from false [2022-03-03 17:15:40,027 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~q1_back~0 Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_270)) (.cse1 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (<= c_~n1~0 ~q1_back~0) (<= (select (select .cse0 c_~q1~0.base) .cse1) 0) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~q1~0.base) .cse1) c_~total~0)) (< ~q1_back~0 0)))) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_270))) (or (<= 1 (+ c_~total~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (not (= c_~C~0 (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset))))))) (<= (+ c_~q1_back~0 1) c_~q1_front~0) (<= c_~n1~0 c_~q1_back~0) (< c_~q1_front~0 c_~q1_back~0) (< c_~q1_back~0 0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) is different from false [2022-03-03 17:15:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:46,187 INFO L93 Difference]: Finished difference Result 151881 states and 672693 transitions. [2022-03-03 17:15:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-03 17:15:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 6.426666666666667) internal successors, (482), 75 states have internal predecessors, (482), 0 states have call successors, (0), 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 196 [2022-03-03 17:15:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:47,357 INFO L225 Difference]: With dead ends: 151881 [2022-03-03 17:15:47,357 INFO L226 Difference]: Without dead ends: 127740 [2022-03-03 17:15:47,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 360 SyntacticMatches, 11 SemanticMatches, 144 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6634 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1918, Invalid=18604, Unknown=78, NotChecked=570, Total=21170 [2022-03-03 17:15:47,362 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 4499 mSDsluCounter, 13724 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 11879 SdHoareTripleChecker+Invalid, 7765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3919 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:47,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4499 Valid, 11879 Invalid, 7765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 3672 Invalid, 0 Unknown, 3919 Unchecked, 2.2s Time] [2022-03-03 17:15:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127740 states. [2022-03-03 17:15:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127740 to 44795. [2022-03-03 17:15:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44795 states, 44794 states have (on average 4.433562530696076) internal successors, (198597), 44794 states have internal predecessors, (198597), 0 states have call successors, (0), 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-03-03 17:15:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44795 states to 44795 states and 198597 transitions. [2022-03-03 17:15:50,436 INFO L78 Accepts]: Start accepts. Automaton has 44795 states and 198597 transitions. Word has length 196 [2022-03-03 17:15:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:50,436 INFO L470 AbstractCegarLoop]: Abstraction has 44795 states and 198597 transitions. [2022-03-03 17:15:50,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.426666666666667) internal successors, (482), 75 states have internal predecessors, (482), 0 states have call successors, (0), 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-03-03 17:15:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44795 states and 198597 transitions. [2022-03-03 17:15:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-03-03 17:15:50,571 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:50,571 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:50,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-03 17:15:50,772 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,SelfDestructingSolverStorable10 [2022-03-03 17:15:50,773 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:15:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 835171037, now seen corresponding path program 2 times [2022-03-03 17:15:50,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:50,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498215969] [2022-03-03 17:15:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:52,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:52,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498215969] [2022-03-03 17:15:52,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498215969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:15:52,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020416764] [2022-03-03 17:15:52,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:15:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:15:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:15:52,284 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-03-03 17:15:52,285 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-03-03 17:15:52,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:15:52,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:15:52,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 17:15:52,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:15:52,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:15:52,601 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:15:52,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 17:15:53,230 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:15:53,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:15:53,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:15:54,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:15:55,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:15:55,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:15:55,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:15:55,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:15:55,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:15:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:15:55,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:15:58,187 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:15:58,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2022-03-03 17:15:58,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 695 treesize of output 671 [2022-03-03 17:15:58,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 626 [2022-03-03 17:15:58,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 578 [2022-03-03 17:15:58,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 578 treesize of output 482 [2022-03-03 17:15:58,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 242 [2022-03-03 17:16:00,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-03-03 17:16:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:16:00,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020416764] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:16:00,673 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:16:00,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 29] total 74 [2022-03-03 17:16:00,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909731925] [2022-03-03 17:16:00,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:16:00,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-03 17:16:00,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:16:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-03 17:16:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=4926, Unknown=77, NotChecked=0, Total=5402 [2022-03-03 17:16:00,675 INFO L87 Difference]: Start difference. First operand 44795 states and 198597 transitions. Second operand has 74 states, 74 states have (on average 6.5675675675675675) internal successors, (486), 74 states have internal predecessors, (486), 0 states have call successors, (0), 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-03-03 17:16:03,962 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((~q1_back~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321)) (.cse2 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (<= c_~n1~0 ~q1_back~0) (<= 1 (+ (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_324) c_~q1~0.base) .cse2) c_~total~0)) (<= (select (select .cse1 c_~q1~0.base) .cse2) 0) (< ~q1_back~0 0)))) (<= 0 c_~total~0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 1) (= c_~total~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-03-03 17:16:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:16:13,035 INFO L93 Difference]: Finished difference Result 256281 states and 1172605 transitions. [2022-03-03 17:16:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-03 17:16:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 6.5675675675675675) internal successors, (486), 74 states have internal predecessors, (486), 0 states have call successors, (0), 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 196 [2022-03-03 17:16:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:16:15,653 INFO L225 Difference]: With dead ends: 256281 [2022-03-03 17:16:15,653 INFO L226 Difference]: Without dead ends: 233556 [2022-03-03 17:16:15,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 357 SyntacticMatches, 9 SemanticMatches, 142 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6431 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2230, Invalid=17843, Unknown=237, NotChecked=282, Total=20592 [2022-03-03 17:16:15,671 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 5024 mSDsluCounter, 13805 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5024 SdHoareTripleChecker+Valid, 11885 SdHoareTripleChecker+Invalid, 7754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4723 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:16:15,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5024 Valid, 11885 Invalid, 7754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2861 Invalid, 0 Unknown, 4723 Unchecked, 1.5s Time] [2022-03-03 17:16:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233556 states. [2022-03-03 17:16:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233556 to 86297. [2022-03-03 17:16:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86297 states, 86296 states have (on average 4.65337906739594) internal successors, (401568), 86296 states have internal predecessors, (401568), 0 states have call successors, (0), 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-03-03 17:16:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86297 states to 86297 states and 401568 transitions. [2022-03-03 17:16:22,788 INFO L78 Accepts]: Start accepts. Automaton has 86297 states and 401568 transitions. Word has length 196 [2022-03-03 17:16:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:16:22,789 INFO L470 AbstractCegarLoop]: Abstraction has 86297 states and 401568 transitions. [2022-03-03 17:16:22,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 6.5675675675675675) internal successors, (486), 74 states have internal predecessors, (486), 0 states have call successors, (0), 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-03-03 17:16:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 86297 states and 401568 transitions. [2022-03-03 17:16:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-03-03 17:16:23,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:16:23,441 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:16:23,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 17:16:23,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:16:23,664 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:16:23,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:16:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1361152370, now seen corresponding path program 1 times [2022-03-03 17:16:23,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:16:23,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44213672] [2022-03-03 17:16:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:16:23,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:16:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:16:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-03 17:16:23,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:16:23,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44213672] [2022-03-03 17:16:23,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44213672] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:16:23,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:16:23,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:16:23,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443155726] [2022-03-03 17:16:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:16:23,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:16:23,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:16:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:16:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:16:23,858 INFO L87 Difference]: Start difference. First operand 86297 states and 401568 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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-03-03 17:16:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:16:26,092 INFO L93 Difference]: Finished difference Result 129029 states and 582196 transitions. [2022-03-03 17:16:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:16:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-03-03 17:16:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:16:26,832 INFO L225 Difference]: With dead ends: 129029 [2022-03-03 17:16:26,832 INFO L226 Difference]: Without dead ends: 107341 [2022-03-03 17:16:26,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:16:26,833 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 543 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:16:26,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 603 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:16:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107341 states. [2022-03-03 17:16:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107341 to 98754. [2022-03-03 17:16:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98754 states, 98753 states have (on average 4.584458193675129) internal successors, (452729), 98753 states have internal predecessors, (452729), 0 states have call successors, (0), 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-03-03 17:16:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98754 states to 98754 states and 452729 transitions. [2022-03-03 17:16:31,525 INFO L78 Accepts]: Start accepts. Automaton has 98754 states and 452729 transitions. Word has length 199 [2022-03-03 17:16:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:16:31,525 INFO L470 AbstractCegarLoop]: Abstraction has 98754 states and 452729 transitions. [2022-03-03 17:16:31,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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-03-03 17:16:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 98754 states and 452729 transitions. [2022-03-03 17:16:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-03-03 17:16:31,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:16:31,882 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:16:31,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 17:16:31,883 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:16:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:16:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1830324973, now seen corresponding path program 3 times [2022-03-03 17:16:31,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:16:31,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055597933] [2022-03-03 17:16:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:16:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:16:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:16:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-03 17:16:31,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:16:31,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055597933] [2022-03-03 17:16:31,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055597933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:16:31,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433944105] [2022-03-03 17:16:31,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:16:31,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:16:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:16:31,992 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-03-03 17:16:31,993 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-03-03 17:16:32,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 17:16:32,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:16:32,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-03 17:16:32,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:16:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:16:32,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:16:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:16:33,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433944105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:16:33,472 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:16:33,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-03-03 17:16:33,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768984437] [2022-03-03 17:16:33,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:16:33,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-03 17:16:33,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:16:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-03 17:16:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:16:33,474 INFO L87 Difference]: Start difference. First operand 98754 states and 452729 transitions. Second operand has 21 states, 21 states have (on average 14.285714285714286) internal successors, (300), 21 states have internal predecessors, (300), 0 states have call successors, (0), 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-03-03 17:16:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:16:34,734 INFO L93 Difference]: Finished difference Result 97657 states and 428416 transitions. [2022-03-03 17:16:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 17:16:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 14.285714285714286) internal successors, (300), 21 states have internal predecessors, (300), 0 states have call successors, (0), 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 202 [2022-03-03 17:16:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:16:35,132 INFO L225 Difference]: With dead ends: 97657 [2022-03-03 17:16:35,132 INFO L226 Difference]: Without dead ends: 71797 [2022-03-03 17:16:35,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 17:16:35,133 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1037 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:16:35,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 2698 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 17:16:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71797 states. [2022-03-03 17:16:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71797 to 50371. [2022-03-03 17:16:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50371 states, 50370 states have (on average 4.3563232082588845) internal successors, (219428), 50370 states have internal predecessors, (219428), 0 states have call successors, (0), 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-03-03 17:16:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50371 states to 50371 states and 219428 transitions. [2022-03-03 17:16:37,534 INFO L78 Accepts]: Start accepts. Automaton has 50371 states and 219428 transitions. Word has length 202 [2022-03-03 17:16:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:16:37,534 INFO L470 AbstractCegarLoop]: Abstraction has 50371 states and 219428 transitions. [2022-03-03 17:16:37,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.285714285714286) internal successors, (300), 21 states have internal predecessors, (300), 0 states have call successors, (0), 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-03-03 17:16:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 50371 states and 219428 transitions. [2022-03-03 17:16:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-03-03 17:16:37,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:16:37,677 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:16:37,695 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-03-03 17:16:37,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:16:37,878 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:16:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:16:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1350702442, now seen corresponding path program 4 times [2022-03-03 17:16:37,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:16:37,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494874362] [2022-03-03 17:16:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:16:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:16:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:16:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:16:39,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:16:39,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494874362] [2022-03-03 17:16:39,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494874362] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:16:39,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467869644] [2022-03-03 17:16:39,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:16:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:16:39,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:16:39,624 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-03-03 17:16:39,625 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-03-03 17:16:39,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:16:39,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:16:39,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-03 17:16:39,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:16:40,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:16:41,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:16:41,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:16:41,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:16:41,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:16:41,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:16:41,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:16:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:16:41,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:16:41,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (<= 1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-03 17:16:41,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (<= 1 (+ c_~total~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-03-03 17:16:42,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441))) (or (not (= c_~C~0 (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) (+ (* c_~q1_front~0 4) ~q1~0.offset)) c_~total~0))))) is different from false [2022-03-03 17:16:42,101 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441))) (or (not (= c_~C~0 (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) (+ (* c_~q1_front~0 4) ~q1~0.offset)) c_~total~0))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-03-03 17:16:42,118 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441))) (or (not (= c_~C~0 (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) (+ (* c_~q1_front~0 4) ~q1~0.offset)) c_~total~0))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-03-03 17:16:42,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441)) (.cse1 (+ (* ~q1_back~0 4) ~q1~0.offset))) (or (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~q1~0.base) .cse1) c_~total~0)) (<= (select (select .cse0 c_~q1~0.base) .cse1) 0)))) is different from false [2022-03-03 17:16:42,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441)) (.cse1 (+ (* ~q1_back~0 4) ~q1~0.offset))) (or (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1) c_~total~0)) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1) 0)))) is different from false [2022-03-03 17:16:42,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441)) (.cse1 (+ (* ~q1_back~0 4) ~q1~0.offset))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) 0) (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) c_~total~0))))) is different from false [2022-03-03 17:16:42,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (~q1~0.offset Int) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_441)) (.cse1 (+ (* ~q1_back~0 4) ~q1~0.offset))) (or (<= 1 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~total~0)) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 0)))) is different from false [2022-03-03 17:16:42,581 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:16:42,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-03-03 17:16:42,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 699 treesize of output 659 [2022-03-03 17:16:42,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 542 [2022-03-03 17:16:42,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 494 [2022-03-03 17:16:42,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 477 [2022-03-03 17:16:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-03-03 17:16:43,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467869644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:16:43,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:16:43,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 21] total 63 [2022-03-03 17:16:43,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128776418] [2022-03-03 17:16:43,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:16:43,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-03 17:16:43,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:16:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-03 17:16:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2627, Unknown=9, NotChecked=1008, Total=3906 [2022-03-03 17:16:43,382 INFO L87 Difference]: Start difference. First operand 50371 states and 219428 transitions. Second operand has 63 states, 63 states have (on average 7.73015873015873) internal successors, (487), 63 states have internal predecessors, (487), 0 states have call successors, (0), 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-03-03 17:16:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:16:57,947 INFO L93 Difference]: Finished difference Result 104802 states and 453959 transitions. [2022-03-03 17:16:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-03 17:16:57,947 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 7.73015873015873) internal successors, (487), 63 states have internal predecessors, (487), 0 states have call successors, (0), 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 203 [2022-03-03 17:16:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:16:58,807 INFO L225 Difference]: With dead ends: 104802 [2022-03-03 17:16:58,807 INFO L226 Difference]: Without dead ends: 101526 [2022-03-03 17:16:58,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 381 SyntacticMatches, 20 SemanticMatches, 167 ConstructedPredicates, 9 IntricatePredicates, 8 DeprecatedPredicates, 8636 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3139, Invalid=22328, Unknown=9, NotChecked=2916, Total=28392 [2022-03-03 17:16:58,811 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 6554 mSDsluCounter, 10519 mSDsCounter, 0 mSdLazyCounter, 3972 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6554 SdHoareTripleChecker+Valid, 9735 SdHoareTripleChecker+Invalid, 11091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 3972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6863 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:16:58,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6554 Valid, 9735 Invalid, 11091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 3972 Invalid, 0 Unknown, 6863 Unchecked, 2.1s Time] [2022-03-03 17:16:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101526 states. [2022-03-03 17:17:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101526 to 54401. [2022-03-03 17:17:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54401 states, 54400 states have (on average 4.364963235294118) internal successors, (237454), 54400 states have internal predecessors, (237454), 0 states have call successors, (0), 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-03-03 17:17:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54401 states to 54401 states and 237454 transitions. [2022-03-03 17:17:01,641 INFO L78 Accepts]: Start accepts. Automaton has 54401 states and 237454 transitions. Word has length 203 [2022-03-03 17:17:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:17:01,641 INFO L470 AbstractCegarLoop]: Abstraction has 54401 states and 237454 transitions. [2022-03-03 17:17:01,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 7.73015873015873) internal successors, (487), 63 states have internal predecessors, (487), 0 states have call successors, (0), 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-03-03 17:17:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 54401 states and 237454 transitions. [2022-03-03 17:17:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-03-03 17:17:01,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:17:01,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:17:01,838 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-03-03 17:17:02,021 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,SelfDestructingSolverStorable14 [2022-03-03 17:17:02,022 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:17:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:17:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1028262330, now seen corresponding path program 5 times [2022-03-03 17:17:02,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:17:02,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253599371] [2022-03-03 17:17:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:17:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:17:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:17:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:17:03,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:17:03,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253599371] [2022-03-03 17:17:03,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253599371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:17:03,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687634105] [2022-03-03 17:17:03,367 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:17:03,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:17:03,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:17:03,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:17:03,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 17:17:03,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:17:03,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:17:03,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-03 17:17:03,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:17:04,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:17:05,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:17:05,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:17:05,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:17:05,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-03 17:17:05,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-03 17:17:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:17:06,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:17:08,428 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:17:08,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2022-03-03 17:17:08,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 737 treesize of output 697 [2022-03-03 17:17:08,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 697 treesize of output 637 [2022-03-03 17:17:08,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 292 [2022-03-03 17:17:08,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 470 [2022-03-03 17:17:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:17:10,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687634105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:17:10,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:17:10,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 28] total 72 [2022-03-03 17:17:10,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887952562] [2022-03-03 17:17:10,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:17:10,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-03 17:17:10,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:17:10,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-03 17:17:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=4621, Unknown=49, NotChecked=0, Total=5112 [2022-03-03 17:17:10,239 INFO L87 Difference]: Start difference. First operand 54401 states and 237454 transitions. Second operand has 72 states, 72 states have (on average 6.930555555555555) internal successors, (499), 72 states have internal predecessors, (499), 0 states have call successors, (0), 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-03-03 17:17:14,890 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 c_~total~0) (forall ((~q1_back~0 Int) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_495)) (.cse1 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (<= c_~n1~0 ~q1_back~0) (<= (select (select .cse0 c_~q1~0.base) .cse1) 0) (< ~q1_back~0 0) (<= 1 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_496) c_~q1~0.base) .cse1) c_~total~0))))) (= c_~total~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|)) is different from false [2022-03-03 17:17:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:17:25,909 INFO L93 Difference]: Finished difference Result 219836 states and 958032 transitions. [2022-03-03 17:17:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-03 17:17:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 6.930555555555555) internal successors, (499), 72 states have internal predecessors, (499), 0 states have call successors, (0), 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 203 [2022-03-03 17:17:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:17:27,831 INFO L225 Difference]: With dead ends: 219836 [2022-03-03 17:17:27,832 INFO L226 Difference]: Without dead ends: 210380 [2022-03-03 17:17:27,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 377 SyntacticMatches, 4 SemanticMatches, 171 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8203 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=3447, Invalid=25862, Unknown=107, NotChecked=340, Total=29756 [2022-03-03 17:17:27,834 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 5027 mSDsluCounter, 16401 mSDsCounter, 0 mSdLazyCounter, 5302 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5027 SdHoareTripleChecker+Valid, 14337 SdHoareTripleChecker+Invalid, 8411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 5302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2954 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:17:27,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5027 Valid, 14337 Invalid, 8411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 5302 Invalid, 0 Unknown, 2954 Unchecked, 2.6s Time] [2022-03-03 17:17:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210380 states. [2022-03-03 17:17:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210380 to 76069. [2022-03-03 17:17:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76069 states, 76068 states have (on average 4.344007992848504) internal successors, (330440), 76068 states have internal predecessors, (330440), 0 states have call successors, (0), 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-03-03 17:17:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76069 states to 76069 states and 330440 transitions. [2022-03-03 17:17:33,587 INFO L78 Accepts]: Start accepts. Automaton has 76069 states and 330440 transitions. Word has length 203 [2022-03-03 17:17:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:17:33,587 INFO L470 AbstractCegarLoop]: Abstraction has 76069 states and 330440 transitions. [2022-03-03 17:17:33,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 6.930555555555555) internal successors, (499), 72 states have internal predecessors, (499), 0 states have call successors, (0), 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-03-03 17:17:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 76069 states and 330440 transitions. [2022-03-03 17:17:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-03-03 17:17:33,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:17:33,828 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:17:33,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 17:17:34,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-03 17:17:34,029 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-03 17:17:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:17:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -559902322, now seen corresponding path program 6 times [2022-03-03 17:17:34,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:17:34,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635375327] [2022-03-03 17:17:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:17:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:17:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:17:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:17:35,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:17:35,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635375327] [2022-03-03 17:17:35,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635375327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:17:35,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561970675] [2022-03-03 17:17:35,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:17:35,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:17:35,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:17:35,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:17:35,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 17:17:35,642 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:17:35,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:17:35,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-03 17:17:35,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:17:36,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:17:38,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:17:38,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:17:38,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:17:38,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-03 17:17:39,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:17:39,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-03 17:17:39,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:17:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:17:39,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:17:41,787 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:17:41,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 55 [2022-03-03 17:17:41,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43399 treesize of output 42359 [2022-03-03 17:17:41,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42230 treesize of output 36086 [2022-03-03 17:17:42,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18109 treesize of output 17329 [2022-03-03 17:17:42,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35318 treesize of output 32246 [2022-03-03 17:17:42,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32363 treesize of output 30803