/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-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:00:00,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:00:00,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:00:00,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:00:00,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:00:00,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:00:00,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:00:00,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:00:00,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:00:00,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:00:00,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:00:00,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:00:00,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:00:00,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:00:00,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:00:00,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:00:00,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:00:00,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:00:00,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:00:00,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:00:00,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:00:00,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:00:00,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:00:00,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:00:00,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:00:00,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:00:00,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:00:00,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:00:00,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:00:00,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:00:00,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:00:00,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:00:00,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:00:00,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:00:00,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:00:00,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:00:00,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:00:00,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:00:00,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:00:00,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:00:00,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:00:00,841 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-01 16:00:00,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:00:00,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:00:00,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:00:00,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:00:00,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:00:00,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:00:00,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:00:00,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:00:00,871 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:00:00,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:00:00,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:00:00,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:00:00,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:00:00,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:00:00,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:00:00,874 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-01 16:00:01,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:00:01,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:00:01,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:00:01,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:00:01,082 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:00:01,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-01 16:00:01,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23761ef27/d034ae6a32f14effb3146ff61d2d9d01/FLAG19de40098 [2022-03-01 16:00:01,548 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:00:01,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-01 16:00:01,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23761ef27/d034ae6a32f14effb3146ff61d2d9d01/FLAG19de40098 [2022-03-01 16:00:01,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23761ef27/d034ae6a32f14effb3146ff61d2d9d01 [2022-03-01 16:00:01,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:00:01,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:00:02,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:00:02,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:00:02,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:00:02,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:00:01" (1/1) ... [2022-03-01 16:00:02,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1483b0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02, skipping insertion in model container [2022-03-01 16:00:02,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:00:01" (1/1) ... [2022-03-01 16:00:02,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:00:02,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:00:02,230 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-more-queue-add-2-nl.wvr.c[2870,2883] [2022-03-01 16:00:02,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:00:02,242 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:00:02,262 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-more-queue-add-2-nl.wvr.c[2870,2883] [2022-03-01 16:00:02,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:00:02,277 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:00:02,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02 WrapperNode [2022-03-01 16:00:02,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:00:02,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:00:02,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:00:02,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:00:02,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,318 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-03-01 16:00:02,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:00:02,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:00:02,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:00:02,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:00:02,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:00:02,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:00:02,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:00:02,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:00:02,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (1/1) ... [2022-03-01 16:00:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:00:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:00:02,383 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-01 16:00:02,389 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-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 16:00:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 16:00:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 16:00:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:00:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:00:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:00:02,413 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:00:02,485 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:00:02,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:00:02,748 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:00:02,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:00:02,832 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:00:02,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:00:02 BoogieIcfgContainer [2022-03-01 16:00:02,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:00:02,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:00:02,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:00:02,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:00:02,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:00:01" (1/3) ... [2022-03-01 16:00:02,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ea53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:00:02, skipping insertion in model container [2022-03-01 16:00:02,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:00:02" (2/3) ... [2022-03-01 16:00:02,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ea53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:00:02, skipping insertion in model container [2022-03-01 16:00:02,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:00:02" (3/3) ... [2022-03-01 16:00:02,845 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-03-01 16:00:02,849 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:00:02,849 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:00:02,849 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 16:00:02,849 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:00:02,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,881 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,882 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,883 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,884 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,885 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,888 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,891 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,891 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,891 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,891 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,892 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,892 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,892 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,898 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,899 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:00:02,903 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-01 16:00:02,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:00:02,967 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-01 16:00:02,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-01 16:00:02,979 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 145 transitions, 306 flow [2022-03-01 16:00:03,068 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 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-01 16:00:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 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-01 16:00:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-01 16:00:03,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:03,103 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] [2022-03-01 16:00:03,103 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 753294411, now seen corresponding path program 1 times [2022-03-01 16:00:03,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:03,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214988511] [2022-03-01 16:00:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:03,364 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-01 16:00:03,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:03,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214988511] [2022-03-01 16:00:03,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214988511] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:03,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:03,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:00:03,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308340964] [2022-03-01 16:00:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:03,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 16:00:03,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 16:00:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:00:03,406 INFO L87 Difference]: Start difference. First operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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-01 16:00:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:03,476 INFO L93 Difference]: Finished difference Result 673 states and 1616 transitions. [2022-03-01 16:00:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 16:00:03,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-03-01 16:00:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:03,506 INFO L225 Difference]: With dead ends: 673 [2022-03-01 16:00:03,506 INFO L226 Difference]: Without dead ends: 669 [2022-03-01 16:00:03,508 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-01 16:00:03,511 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:03,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:00:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-03-01 16:00:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-03-01 16:00:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 2.413173652694611) internal successors, (1612), 668 states have internal predecessors, (1612), 0 states have call successors, (0), 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-01 16:00:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1612 transitions. [2022-03-01 16:00:03,603 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1612 transitions. Word has length 104 [2022-03-01 16:00:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:03,604 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 1612 transitions. [2022-03-01 16:00:03,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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-01 16:00:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1612 transitions. [2022-03-01 16:00:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-03-01 16:00:03,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:03,614 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] [2022-03-01 16:00:03,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:00:03,615 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash -745282047, now seen corresponding path program 1 times [2022-03-01 16:00:03,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:03,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605222424] [2022-03-01 16:00:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:03,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:03,866 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-01 16:00:03,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:03,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605222424] [2022-03-01 16:00:03,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605222424] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:03,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:03,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 16:00:03,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038943823] [2022-03-01 16:00:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:03,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:00:03,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:00:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:00:03,869 INFO L87 Difference]: Start difference. First operand 669 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-01 16:00:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:03,959 INFO L93 Difference]: Finished difference Result 778 states and 1820 transitions. [2022-03-01 16:00:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 16:00:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-03-01 16:00:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:03,963 INFO L225 Difference]: With dead ends: 778 [2022-03-01 16:00:03,963 INFO L226 Difference]: Without dead ends: 675 [2022-03-01 16:00:03,963 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-01 16:00:03,964 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:03,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 329 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:00:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-03-01 16:00:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 670. [2022-03-01 16:00:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.411061285500747) internal successors, (1613), 669 states have internal predecessors, (1613), 0 states have call successors, (0), 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-01 16:00:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1613 transitions. [2022-03-01 16:00:03,982 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1613 transitions. Word has length 108 [2022-03-01 16:00:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:03,983 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1613 transitions. [2022-03-01 16:00:03,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-01 16:00:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1613 transitions. [2022-03-01 16:00:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:03,987 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:03,988 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] [2022-03-01 16:00:03,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:00:03,988 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -38797508, now seen corresponding path program 1 times [2022-03-01 16:00:03,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:03,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13814466] [2022-03-01 16:00:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:04,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:04,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13814466] [2022-03-01 16:00:04,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13814466] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:04,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:04,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:00:04,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803271270] [2022-03-01 16:00:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:04,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:00:04,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:00:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:00:04,136 INFO L87 Difference]: Start difference. First operand 670 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:04,164 INFO L93 Difference]: Finished difference Result 712 states and 1721 transitions. [2022-03-01 16:00:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:00:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:04,169 INFO L225 Difference]: With dead ends: 712 [2022-03-01 16:00:04,169 INFO L226 Difference]: Without dead ends: 712 [2022-03-01 16:00:04,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:00:04,170 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:04,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:00:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-03-01 16:00:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-03-01 16:00:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.420534458509142) internal successors, (1721), 711 states have internal predecessors, (1721), 0 states have call successors, (0), 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-01 16:00:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1721 transitions. [2022-03-01 16:00:04,192 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1721 transitions. Word has length 115 [2022-03-01 16:00:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:04,193 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1721 transitions. [2022-03-01 16:00:04,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1721 transitions. [2022-03-01 16:00:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:04,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:04,196 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] [2022-03-01 16:00:04,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 16:00:04,200 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1372661662, now seen corresponding path program 2 times [2022-03-01 16:00:04,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:04,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308132544] [2022-03-01 16:00:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:05,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:05,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308132544] [2022-03-01 16:00:05,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308132544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:05,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:05,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:05,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271467848] [2022-03-01 16:00:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:05,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:05,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:05,013 INFO L87 Difference]: Start difference. First operand 712 states and 1721 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:05,388 INFO L93 Difference]: Finished difference Result 1064 states and 2599 transitions. [2022-03-01 16:00:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:05,393 INFO L225 Difference]: With dead ends: 1064 [2022-03-01 16:00:05,394 INFO L226 Difference]: Without dead ends: 1013 [2022-03-01 16:00:05,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:00:05,395 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 203 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:05,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1237 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:00:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-03-01 16:00:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 774. [2022-03-01 16:00:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 2.4307891332470892) internal successors, (1879), 773 states have internal predecessors, (1879), 0 states have call successors, (0), 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-01 16:00:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1879 transitions. [2022-03-01 16:00:05,418 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1879 transitions. Word has length 115 [2022-03-01 16:00:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:05,419 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1879 transitions. [2022-03-01 16:00:05,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1879 transitions. [2022-03-01 16:00:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:05,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:05,422 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] [2022-03-01 16:00:05,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 16:00:05,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -480697922, now seen corresponding path program 3 times [2022-03-01 16:00:05,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:05,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673195072] [2022-03-01 16:00:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:05,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:05,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673195072] [2022-03-01 16:00:05,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673195072] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:05,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:05,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:05,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220432847] [2022-03-01 16:00:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:05,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:05,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:05,934 INFO L87 Difference]: Start difference. First operand 774 states and 1879 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:06,273 INFO L93 Difference]: Finished difference Result 1112 states and 2694 transitions. [2022-03-01 16:00:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:06,281 INFO L225 Difference]: With dead ends: 1112 [2022-03-01 16:00:06,281 INFO L226 Difference]: Without dead ends: 1061 [2022-03-01 16:00:06,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:06,282 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 199 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:06,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1514 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-03-01 16:00:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 778. [2022-03-01 16:00:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4375804375804377) internal successors, (1894), 777 states have internal predecessors, (1894), 0 states have call successors, (0), 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-01 16:00:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1894 transitions. [2022-03-01 16:00:06,309 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1894 transitions. Word has length 115 [2022-03-01 16:00:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:06,310 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1894 transitions. [2022-03-01 16:00:06,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1894 transitions. [2022-03-01 16:00:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:06,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:06,312 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] [2022-03-01 16:00:06,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 16:00:06,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1782487108, now seen corresponding path program 4 times [2022-03-01 16:00:06,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:06,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772645566] [2022-03-01 16:00:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:06,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:06,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:06,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772645566] [2022-03-01 16:00:06,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772645566] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:06,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:06,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:06,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406349155] [2022-03-01 16:00:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:06,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:06,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:06,646 INFO L87 Difference]: Start difference. First operand 778 states and 1894 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:06,873 INFO L93 Difference]: Finished difference Result 1013 states and 2475 transitions. [2022-03-01 16:00:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:06,874 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:06,879 INFO L225 Difference]: With dead ends: 1013 [2022-03-01 16:00:06,879 INFO L226 Difference]: Without dead ends: 950 [2022-03-01 16:00:06,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:06,884 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 184 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:06,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1123 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:00:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-03-01 16:00:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 778. [2022-03-01 16:00:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4324324324324325) internal successors, (1890), 777 states have internal predecessors, (1890), 0 states have call successors, (0), 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-01 16:00:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1890 transitions. [2022-03-01 16:00:06,908 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1890 transitions. Word has length 115 [2022-03-01 16:00:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:06,908 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1890 transitions. [2022-03-01 16:00:06,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1890 transitions. [2022-03-01 16:00:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:06,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:06,913 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] [2022-03-01 16:00:06,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 16:00:06,913 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash -867085732, now seen corresponding path program 5 times [2022-03-01 16:00:06,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:06,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134220566] [2022-03-01 16:00:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:07,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:07,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134220566] [2022-03-01 16:00:07,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134220566] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:07,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:07,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:07,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924703704] [2022-03-01 16:00:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:07,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:07,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:07,301 INFO L87 Difference]: Start difference. First operand 778 states and 1890 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:07,640 INFO L93 Difference]: Finished difference Result 1113 states and 2715 transitions. [2022-03-01 16:00:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:00:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:07,645 INFO L225 Difference]: With dead ends: 1113 [2022-03-01 16:00:07,645 INFO L226 Difference]: Without dead ends: 1062 [2022-03-01 16:00:07,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:07,649 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 200 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:07,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1364 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-03-01 16:00:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 823. [2022-03-01 16:00:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.427007299270073) internal successors, (1995), 822 states have internal predecessors, (1995), 0 states have call successors, (0), 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-01 16:00:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1995 transitions. [2022-03-01 16:00:07,672 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1995 transitions. Word has length 115 [2022-03-01 16:00:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:07,673 INFO L470 AbstractCegarLoop]: Abstraction has 823 states and 1995 transitions. [2022-03-01 16:00:07,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1995 transitions. [2022-03-01 16:00:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:07,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:07,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:00:07,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 16:00:07,676 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1012764612, now seen corresponding path program 6 times [2022-03-01 16:00:07,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:07,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914547658] [2022-03-01 16:00:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:08,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:08,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914547658] [2022-03-01 16:00:08,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914547658] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:08,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:08,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:08,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443779395] [2022-03-01 16:00:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:08,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:08,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:08,075 INFO L87 Difference]: Start difference. First operand 823 states and 1995 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:08,516 INFO L93 Difference]: Finished difference Result 1235 states and 2985 transitions. [2022-03-01 16:00:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:00:08,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:08,521 INFO L225 Difference]: With dead ends: 1235 [2022-03-01 16:00:08,522 INFO L226 Difference]: Without dead ends: 1184 [2022-03-01 16:00:08,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:00:08,523 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 231 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:08,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 1467 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:00:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-03-01 16:00:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 909. [2022-03-01 16:00:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 2.4129955947136565) internal successors, (2191), 908 states have internal predecessors, (2191), 0 states have call successors, (0), 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-01 16:00:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2191 transitions. [2022-03-01 16:00:08,549 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2191 transitions. Word has length 115 [2022-03-01 16:00:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:08,549 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 2191 transitions. [2022-03-01 16:00:08,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2191 transitions. [2022-03-01 16:00:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:08,552 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:08,552 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] [2022-03-01 16:00:08,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 16:00:08,553 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 874442110, now seen corresponding path program 7 times [2022-03-01 16:00:08,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:08,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094503937] [2022-03-01 16:00:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:08,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:08,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094503937] [2022-03-01 16:00:08,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094503937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:08,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:08,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:08,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278081624] [2022-03-01 16:00:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:08,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:08,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:08,885 INFO L87 Difference]: Start difference. First operand 909 states and 2191 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:09,164 INFO L93 Difference]: Finished difference Result 1193 states and 2870 transitions. [2022-03-01 16:00:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:09,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:09,170 INFO L225 Difference]: With dead ends: 1193 [2022-03-01 16:00:09,170 INFO L226 Difference]: Without dead ends: 1142 [2022-03-01 16:00:09,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:00:09,171 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 238 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:09,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1139 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-03-01 16:00:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 913. [2022-03-01 16:00:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 2.418859649122807) internal successors, (2206), 912 states have internal predecessors, (2206), 0 states have call successors, (0), 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-01 16:00:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2206 transitions. [2022-03-01 16:00:09,196 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 2206 transitions. Word has length 115 [2022-03-01 16:00:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:09,196 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 2206 transitions. [2022-03-01 16:00:09,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 2206 transitions. [2022-03-01 16:00:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:09,199 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:09,199 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] [2022-03-01 16:00:09,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:00:09,199 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -427347076, now seen corresponding path program 8 times [2022-03-01 16:00:09,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:09,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371108759] [2022-03-01 16:00:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:09,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:09,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371108759] [2022-03-01 16:00:09,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371108759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:09,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:09,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:09,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572184258] [2022-03-01 16:00:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:09,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:09,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:09,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:09,504 INFO L87 Difference]: Start difference. First operand 913 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:09,761 INFO L93 Difference]: Finished difference Result 1094 states and 2651 transitions. [2022-03-01 16:00:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:09,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:09,766 INFO L225 Difference]: With dead ends: 1094 [2022-03-01 16:00:09,766 INFO L226 Difference]: Without dead ends: 1031 [2022-03-01 16:00:09,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:00:09,767 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 205 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:09,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1020 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:00:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-03-01 16:00:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 885. [2022-03-01 16:00:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.408371040723982) internal successors, (2129), 884 states have internal predecessors, (2129), 0 states have call successors, (0), 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-01 16:00:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2129 transitions. [2022-03-01 16:00:09,789 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 2129 transitions. Word has length 115 [2022-03-01 16:00:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:09,789 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 2129 transitions. [2022-03-01 16:00:09,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 2129 transitions. [2022-03-01 16:00:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:09,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:09,792 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] [2022-03-01 16:00:09,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:00:09,792 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2058803320, now seen corresponding path program 9 times [2022-03-01 16:00:09,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:09,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098148305] [2022-03-01 16:00:09,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:10,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:10,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098148305] [2022-03-01 16:00:10,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098148305] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:10,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:10,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:10,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754642184] [2022-03-01 16:00:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:10,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:10,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:10,164 INFO L87 Difference]: Start difference. First operand 885 states and 2129 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:10,479 INFO L93 Difference]: Finished difference Result 1171 states and 2834 transitions. [2022-03-01 16:00:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:10,485 INFO L225 Difference]: With dead ends: 1171 [2022-03-01 16:00:10,485 INFO L226 Difference]: Without dead ends: 1120 [2022-03-01 16:00:10,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:10,486 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 186 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:10,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-03-01 16:00:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 901. [2022-03-01 16:00:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 2.4144444444444444) internal successors, (2173), 900 states have internal predecessors, (2173), 0 states have call successors, (0), 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-01 16:00:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2173 transitions. [2022-03-01 16:00:10,508 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2173 transitions. Word has length 115 [2022-03-01 16:00:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:10,508 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 2173 transitions. [2022-03-01 16:00:10,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2173 transitions. [2022-03-01 16:00:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:10,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:10,511 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] [2022-03-01 16:00:10,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 16:00:10,511 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash 382804392, now seen corresponding path program 10 times [2022-03-01 16:00:10,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:10,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350775254] [2022-03-01 16:00:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:10,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:10,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:10,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350775254] [2022-03-01 16:00:10,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350775254] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:10,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:10,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:10,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932394871] [2022-03-01 16:00:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:10,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:10,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:10,927 INFO L87 Difference]: Start difference. First operand 901 states and 2173 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:11,232 INFO L93 Difference]: Finished difference Result 1189 states and 2859 transitions. [2022-03-01 16:00:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:11,237 INFO L225 Difference]: With dead ends: 1189 [2022-03-01 16:00:11,237 INFO L226 Difference]: Without dead ends: 1138 [2022-03-01 16:00:11,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:00:11,238 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 188 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:11,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1286 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-03-01 16:00:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 905. [2022-03-01 16:00:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 2.420353982300885) internal successors, (2188), 904 states have internal predecessors, (2188), 0 states have call successors, (0), 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-01 16:00:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2188 transitions. [2022-03-01 16:00:11,261 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2188 transitions. Word has length 115 [2022-03-01 16:00:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:11,261 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 2188 transitions. [2022-03-01 16:00:11,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2188 transitions. [2022-03-01 16:00:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:11,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:11,264 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] [2022-03-01 16:00:11,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 16:00:11,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash -918984794, now seen corresponding path program 11 times [2022-03-01 16:00:11,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:11,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820956170] [2022-03-01 16:00:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:11,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:11,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820956170] [2022-03-01 16:00:11,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820956170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:11,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:11,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:11,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819711854] [2022-03-01 16:00:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:11,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:11,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:11,572 INFO L87 Difference]: Start difference. First operand 905 states and 2188 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:11,820 INFO L93 Difference]: Finished difference Result 1090 states and 2640 transitions. [2022-03-01 16:00:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:00:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:11,825 INFO L225 Difference]: With dead ends: 1090 [2022-03-01 16:00:11,825 INFO L226 Difference]: Without dead ends: 1027 [2022-03-01 16:00:11,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:11,826 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 194 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:11,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-03-01 16:00:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 897. [2022-03-01 16:00:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 896 states have (on average 2.4129464285714284) internal successors, (2162), 896 states have internal predecessors, (2162), 0 states have call successors, (0), 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-01 16:00:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2162 transitions. [2022-03-01 16:00:11,846 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2162 transitions. Word has length 115 [2022-03-01 16:00:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:11,847 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 2162 transitions. [2022-03-01 16:00:11,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2162 transitions. [2022-03-01 16:00:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-01 16:00:11,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:11,849 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] [2022-03-01 16:00:11,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 16:00:11,850 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash -3583418, now seen corresponding path program 12 times [2022-03-01 16:00:11,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:11,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287494443] [2022-03-01 16:00:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:00:12,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:12,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287494443] [2022-03-01 16:00:12,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287494443] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:12,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:12,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 16:00:12,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764566882] [2022-03-01 16:00:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:12,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:00:12,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:00:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:00:12,221 INFO L87 Difference]: Start difference. First operand 897 states and 2162 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:12,505 INFO L93 Difference]: Finished difference Result 1201 states and 2904 transitions. [2022-03-01 16:00:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:00:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-01 16:00:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:12,511 INFO L225 Difference]: With dead ends: 1201 [2022-03-01 16:00:12,511 INFO L226 Difference]: Without dead ends: 1150 [2022-03-01 16:00:12,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:00:12,512 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 202 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:12,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1037 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:00:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-03-01 16:00:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 869. [2022-03-01 16:00:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 2.402073732718894) internal successors, (2085), 868 states have internal predecessors, (2085), 0 states have call successors, (0), 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-01 16:00:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2085 transitions. [2022-03-01 16:00:12,534 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2085 transitions. Word has length 115 [2022-03-01 16:00:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:12,534 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2085 transitions. [2022-03-01 16:00:12,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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-01 16:00:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2085 transitions. [2022-03-01 16:00:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-01 16:00:12,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:12,537 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:00:12,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 16:00:12,537 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1414840224, now seen corresponding path program 1 times [2022-03-01 16:00:12,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:12,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400197718] [2022-03-01 16:00:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 16:00:12,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:12,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400197718] [2022-03-01 16:00:12,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400197718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:00:12,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:00:12,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 16:00:12,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947743512] [2022-03-01 16:00:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:00:12,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 16:00:12,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 16:00:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:00:12,598 INFO L87 Difference]: Start difference. First operand 869 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-01 16:00:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:12,627 INFO L93 Difference]: Finished difference Result 1737 states and 4340 transitions. [2022-03-01 16:00:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 16:00:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 120 [2022-03-01 16:00:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:12,633 INFO L225 Difference]: With dead ends: 1737 [2022-03-01 16:00:12,633 INFO L226 Difference]: Without dead ends: 1520 [2022-03-01 16:00:12,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:00:12,636 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 117 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:12,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:00:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-03-01 16:00:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1212. [2022-03-01 16:00:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 2.564822460776218) internal successors, (3106), 1211 states have internal predecessors, (3106), 0 states have call successors, (0), 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-01 16:00:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3106 transitions. [2022-03-01 16:00:12,664 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3106 transitions. Word has length 120 [2022-03-01 16:00:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:12,665 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 3106 transitions. [2022-03-01 16:00:12,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-01 16:00:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3106 transitions. [2022-03-01 16:00:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 16:00:12,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:12,668 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] [2022-03-01 16:00:12,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 16:00:12,668 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2096069143, now seen corresponding path program 1 times [2022-03-01 16:00:12,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:12,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787592188] [2022-03-01 16:00:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:12,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:12,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787592188] [2022-03-01 16:00:12,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787592188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:00:12,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877866310] [2022-03-01 16:00:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:12,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:00:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:00:12,750 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-01 16:00:12,751 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-01 16:00:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:12,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-01 16:00:12,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:00:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:13,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:00:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:13,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877866310] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:00:13,669 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:00:13,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-01 16:00:13,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088349532] [2022-03-01 16:00:13,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:00:13,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 16:00:13,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 16:00:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:00:13,671 INFO L87 Difference]: Start difference. First operand 1212 states and 3106 transitions. Second operand has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-01 16:00:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:13,865 INFO L93 Difference]: Finished difference Result 1683 states and 4216 transitions. [2022-03-01 16:00:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:00:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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 121 [2022-03-01 16:00:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:13,871 INFO L225 Difference]: With dead ends: 1683 [2022-03-01 16:00:13,871 INFO L226 Difference]: Without dead ends: 1224 [2022-03-01 16:00:13,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-01 16:00:13,872 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 739 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:13,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 741 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:00:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-03-01 16:00:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2022-03-01 16:00:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 2.5558292282430215) internal successors, (3113), 1218 states have internal predecessors, (3113), 0 states have call successors, (0), 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-01 16:00:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3113 transitions. [2022-03-01 16:00:13,915 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3113 transitions. Word has length 121 [2022-03-01 16:00:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:13,916 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 3113 transitions. [2022-03-01 16:00:13,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-01 16:00:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3113 transitions. [2022-03-01 16:00:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-01 16:00:13,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:13,920 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] [2022-03-01 16:00:13,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-01 16:00:14,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-01 16:00:14,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1461811388, now seen corresponding path program 2 times [2022-03-01 16:00:14,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:14,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329630504] [2022-03-01 16:00:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:15,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:15,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329630504] [2022-03-01 16:00:15,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329630504] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:00:15,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112699476] [2022-03-01 16:00:15,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:00:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:00:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:00:15,100 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-01 16:00:15,127 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-01 16:00:15,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:00:15,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:00:15,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-01 16:00:15,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:00:16,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:00:16,634 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-01 16:00:16,875 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:00:16,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:00:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:16,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:00:17,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:00:17,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 45 [2022-03-01 16:00:17,331 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 24 treesize of output 18 [2022-03-01 16:00:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:18,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112699476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:00:18,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:00:18,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 21] total 62 [2022-03-01 16:00:18,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469080351] [2022-03-01 16:00:18,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:00:18,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-01 16:00:18,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-01 16:00:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3434, Unknown=2, NotChecked=0, Total=3782 [2022-03-01 16:00:18,855 INFO L87 Difference]: Start difference. First operand 1219 states and 3113 transitions. Second operand has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 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-01 16:00:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:22,925 INFO L93 Difference]: Finished difference Result 5266 states and 13499 transitions. [2022-03-01 16:00:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-01 16:00:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 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 128 [2022-03-01 16:00:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:22,949 INFO L225 Difference]: With dead ends: 5266 [2022-03-01 16:00:22,949 INFO L226 Difference]: Without dead ends: 5254 [2022-03-01 16:00:22,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 10 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1470, Invalid=9845, Unknown=27, NotChecked=0, Total=11342 [2022-03-01 16:00:22,952 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 2111 mSDsluCounter, 6489 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:22,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2111 Valid, 6401 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1730 Invalid, 0 Unknown, 346 Unchecked, 1.0s Time] [2022-03-01 16:00:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-03-01 16:00:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3004. [2022-03-01 16:00:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 2.668997668997669) internal successors, (8015), 3003 states have internal predecessors, (8015), 0 states have call successors, (0), 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-01 16:00:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 8015 transitions. [2022-03-01 16:00:23,068 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 8015 transitions. Word has length 128 [2022-03-01 16:00:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:23,068 INFO L470 AbstractCegarLoop]: Abstraction has 3004 states and 8015 transitions. [2022-03-01 16:00:23,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 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-01 16:00:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 8015 transitions. [2022-03-01 16:00:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-01 16:00:23,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:23,076 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] [2022-03-01 16:00:23,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 16:00:23,291 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,SelfDestructingSolverStorable16 [2022-03-01 16:00:23,291 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -803066400, now seen corresponding path program 3 times [2022-03-01 16:00:23,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:23,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339419826] [2022-03-01 16:00:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:24,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:24,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339419826] [2022-03-01 16:00:24,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339419826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:00:24,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509489814] [2022-03-01 16:00:24,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:00:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:00:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:00:24,028 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-01 16:00:24,028 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-01 16:00:24,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 16:00:24,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:00:24,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-01 16:00:24,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:00:24,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:00:24,582 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-01 16:00:24,627 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-01 16:00:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:00:24,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:00:24,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_258) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-01 16:00:24,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:00:24,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 45 [2022-03-01 16:00:24,807 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 24 treesize of output 18 [2022-03-01 16:00:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:00:25,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509489814] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:00:25,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:00:25,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-03-01 16:00:25,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348246355] [2022-03-01 16:00:25,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:00:25,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 16:00:25,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 16:00:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1312, Unknown=1, NotChecked=72, Total=1482 [2022-03-01 16:00:25,303 INFO L87 Difference]: Start difference. First operand 3004 states and 8015 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:00:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:00:28,257 INFO L93 Difference]: Finished difference Result 5956 states and 15868 transitions. [2022-03-01 16:00:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-01 16:00:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-03-01 16:00:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:00:28,276 INFO L225 Difference]: With dead ends: 5956 [2022-03-01 16:00:28,276 INFO L226 Difference]: Without dead ends: 5956 [2022-03-01 16:00:28,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=702, Invalid=4557, Unknown=1, NotChecked=142, Total=5402 [2022-03-01 16:00:28,278 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1871 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:00:28,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1871 Valid, 3258 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1293 Invalid, 0 Unknown, 275 Unchecked, 0.7s Time] [2022-03-01 16:00:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2022-03-01 16:00:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 2795. [2022-03-01 16:00:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2794 states have (on average 2.6385110952040085) internal successors, (7372), 2794 states have internal predecessors, (7372), 0 states have call successors, (0), 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-01 16:00:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7372 transitions. [2022-03-01 16:00:28,378 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7372 transitions. Word has length 128 [2022-03-01 16:00:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:00:28,378 INFO L470 AbstractCegarLoop]: Abstraction has 2795 states and 7372 transitions. [2022-03-01 16:00:28,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:00:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7372 transitions. [2022-03-01 16:00:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:00:28,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:00:28,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:00:28,411 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-01 16:00:28,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-01 16:00:28,609 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:00:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:00:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2037793132, now seen corresponding path program 1 times [2022-03-01 16:00:28,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:00:28,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682527687] [2022-03-01 16:00:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:00:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:30,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:00:30,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682527687] [2022-03-01 16:00:30,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682527687] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:00:30,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081170410] [2022-03-01 16:00:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:00:30,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:00:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:00:30,365 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-01 16:00:30,366 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-01 16:00:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:00:30,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-01 16:00:30,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:00:32,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:00:32,482 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-01 16:00:32,848 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:00:32,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:00:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:33,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:00:35,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:00:35,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:00:35,076 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 66 treesize of output 60 [2022-03-01 16:00:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:00:46,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081170410] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:00:46,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:00:46,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-01 16:00:46,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669448663] [2022-03-01 16:00:46,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:00:46,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-01 16:00:46,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:00:46,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-01 16:00:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=9299, Unknown=18, NotChecked=0, Total=10100 [2022-03-01 16:00:46,905 INFO L87 Difference]: Start difference. First operand 2795 states and 7372 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:01:59,302 WARN L228 SmtUtils]: Spent 57.76s on a formula simplification. DAG size of input: 137 DAG size of output: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:02:09,102 WARN L228 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:02:22,716 WARN L228 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 90 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:02:23,688 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296))) (let ((.cse3 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and .cse3 (forall ((v_ArrVal_287 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_287) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0))) (or (and .cse3 .cse1) .cse0)))) is different from false [2022-03-01 16:02:37,213 WARN L228 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:02:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:02:37,518 INFO L93 Difference]: Finished difference Result 7358 states and 19122 transitions. [2022-03-01 16:02:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-03-01 16:02:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:02:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:02:37,538 INFO L225 Difference]: With dead ends: 7358 [2022-03-01 16:02:37,538 INFO L226 Difference]: Without dead ends: 6986 [2022-03-01 16:02:37,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 227 SyntacticMatches, 29 SemanticMatches, 217 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18751 ImplicationChecksByTransitivity, 120.6s TimeCoverageRelationStatistics Valid=3809, Invalid=43350, Unknown=151, NotChecked=432, Total=47742 [2022-03-01 16:02:37,545 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 2349 mSDsluCounter, 10762 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 10161 SdHoareTripleChecker+Invalid, 7363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4869 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:02:37,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2349 Valid, 10161 Invalid, 7363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2346 Invalid, 0 Unknown, 4869 Unchecked, 1.4s Time] [2022-03-01 16:02:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2022-03-01 16:02:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 3284. [2022-03-01 16:02:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3283 states have (on average 2.6618946085897046) internal successors, (8739), 3283 states have internal predecessors, (8739), 0 states have call successors, (0), 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-01 16:02:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 8739 transitions. [2022-03-01 16:02:37,654 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 8739 transitions. Word has length 133 [2022-03-01 16:02:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:02:37,655 INFO L470 AbstractCegarLoop]: Abstraction has 3284 states and 8739 transitions. [2022-03-01 16:02:37,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:02:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 8739 transitions. [2022-03-01 16:02:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:02:37,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:02:37,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:02:37,691 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-01 16:02:37,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:02:37,889 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:02:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:02:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 403814580, now seen corresponding path program 2 times [2022-03-01 16:02:37,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:02:37,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807284870] [2022-03-01 16:02:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:02:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:02:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:02:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:02:39,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:02:39,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807284870] [2022-03-01 16:02:39,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807284870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:02:39,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976672852] [2022-03-01 16:02:39,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:02:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:02:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:02:39,596 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-01 16:02:39,599 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-01 16:02:39,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:02:39,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:02:39,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-01 16:02:39,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:02:41,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:02:41,965 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-01 16:02:42,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:02:42,353 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:02:42,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 10 [2022-03-01 16:02:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:02:43,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:02:44,451 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:02:44,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:02:44,455 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 66 treesize of output 60 [2022-03-01 16:02:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:02:57,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976672852] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:02:57,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:02:57,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-01 16:02:57,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692713466] [2022-03-01 16:02:57,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:02:57,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-01 16:02:57,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:02:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-01 16:02:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9267, Unknown=19, NotChecked=0, Total=10100 [2022-03-01 16:02:57,600 INFO L87 Difference]: Start difference. First operand 3284 states and 8739 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:03:13,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse1 (= c_~s~0 c_~N~0)) (.cse3 (mod c_~x~0 4294967296)) (.cse2 (mod c_~y~0 4294967296))) (and (or .cse0 (and .cse1 (= .cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3) (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0)) (or .cse0 (and .cse1 (= .cse3 .cse2))))) is different from false [2022-03-01 16:03:26,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-01 16:03:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:03:28,439 INFO L93 Difference]: Finished difference Result 6577 states and 17172 transitions. [2022-03-01 16:03:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-01 16:03:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:03:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:03:28,495 INFO L225 Difference]: With dead ends: 6577 [2022-03-01 16:03:28,495 INFO L226 Difference]: Without dead ends: 6445 [2022-03-01 16:03:28,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 217 SyntacticMatches, 17 SemanticMatches, 188 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13191 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=3025, Invalid=32444, Unknown=67, NotChecked=374, Total=35910 [2022-03-01 16:03:28,498 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 1853 mSDsluCounter, 11119 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 10834 SdHoareTripleChecker+Invalid, 5451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2610 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:03:28,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1853 Valid, 10834 Invalid, 5451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2667 Invalid, 0 Unknown, 2610 Unchecked, 3.4s Time] [2022-03-01 16:03:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-03-01 16:03:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 3595. [2022-03-01 16:03:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3594 states have (on average 2.6747356705620478) internal successors, (9613), 3594 states have internal predecessors, (9613), 0 states have call successors, (0), 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-01 16:03:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 9613 transitions. [2022-03-01 16:03:28,593 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 9613 transitions. Word has length 133 [2022-03-01 16:03:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:03:28,594 INFO L470 AbstractCegarLoop]: Abstraction has 3595 states and 9613 transitions. [2022-03-01 16:03:28,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:03:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 9613 transitions. [2022-03-01 16:03:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:03:28,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:03:28,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:03:28,629 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-01 16:03:28,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:03:28,827 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:03:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:03:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash -897974606, now seen corresponding path program 3 times [2022-03-01 16:03:28,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:03:28,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918891446] [2022-03-01 16:03:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:03:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:03:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:03:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:03:30,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:03:30,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918891446] [2022-03-01 16:03:30,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918891446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:03:30,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644765535] [2022-03-01 16:03:30,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:03:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:03:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:03:30,367 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-01 16:03:30,371 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-01 16:03:30,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-01 16:03:30,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:03:30,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 16:03:30,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:03:32,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:03:32,523 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-01 16:03:32,901 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:03:32,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:03:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:03:33,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:03:35,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:03:35,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:03:35,099 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 66 treesize of output 60 [2022-03-01 16:03:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:03:48,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644765535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:03:48,341 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:03:48,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-01 16:03:48,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611191774] [2022-03-01 16:03:48,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:03:48,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-01 16:03:48,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:03:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-01 16:03:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=9717, Unknown=18, NotChecked=0, Total=10506 [2022-03-01 16:03:48,343 INFO L87 Difference]: Start difference. First operand 3595 states and 9613 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:05:24,617 WARN L228 SmtUtils]: Spent 1.11m on a formula simplification. DAG size of input: 120 DAG size of output: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:05:25,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~s~0 c_~N~0)) (.cse2 (<= c_~x~0 c_~y~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (and (<= c_~N~0 c_~s~0) .cse0 .cse1 .cse2) .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= 1 c_~N~0) .cse5 (or .cse3 (and .cse0 .cse1 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse2)) .cse6 (or .cse7 (and .cse8 (= (mod c_~y~0 4294967296) .cse9))) (or (and .cse8 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse3) (or .cse3 (let ((.cse10 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (<= .cse10 0) (<= 0 c_~q_front~0) (= (select (select |c_#memory_int| c_~q~0.base) .cse10) 1)))) (= c_~q~0.offset 0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0)) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse13 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse12 (+ .cse13 aux_mod_aux_mod_~C~0_30_61)) (.cse11 (* 4294967295 c_~x~0))) (or (<= (+ .cse11 c_~y~0 4294967296) .cse12) (= (+ (* (- 1) c_~y~0) .cse13 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse12 (+ .cse11 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))))) is different from false [2022-03-01 16:05:45,209 WARN L228 SmtUtils]: Spent 16.50s on a formula simplification. DAG size of input: 118 DAG size of output: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:05:48,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0))))) is different from false [2022-03-01 16:05:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:05:51,068 INFO L93 Difference]: Finished difference Result 6388 states and 16797 transitions. [2022-03-01 16:05:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-03-01 16:05:51,068 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:05:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:05:51,083 INFO L225 Difference]: With dead ends: 6388 [2022-03-01 16:05:51,083 INFO L226 Difference]: Without dead ends: 6126 [2022-03-01 16:05:51,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 225 SyntacticMatches, 23 SemanticMatches, 215 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 16704 ImplicationChecksByTransitivity, 134.1s TimeCoverageRelationStatistics Valid=3697, Invalid=42254, Unknown=67, NotChecked=854, Total=46872 [2022-03-01 16:05:51,087 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 2395 mSDsluCounter, 11042 mSDsCounter, 0 mSdLazyCounter, 3100 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 10762 SdHoareTripleChecker+Invalid, 6539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 3100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3222 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:05:51,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2395 Valid, 10762 Invalid, 6539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 3100 Invalid, 0 Unknown, 3222 Unchecked, 2.0s Time] [2022-03-01 16:05:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2022-03-01 16:05:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 3603. [2022-03-01 16:05:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3602 states have (on average 2.6857301499167128) internal successors, (9674), 3602 states have internal predecessors, (9674), 0 states have call successors, (0), 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-01 16:05:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 9674 transitions. [2022-03-01 16:05:51,186 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 9674 transitions. Word has length 133 [2022-03-01 16:05:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:05:51,186 INFO L470 AbstractCegarLoop]: Abstraction has 3603 states and 9674 transitions. [2022-03-01 16:05:51,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:05:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 9674 transitions. [2022-03-01 16:05:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:05:51,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:05:51,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:05:51,221 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-01 16:05:51,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:05:51,412 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:05:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:05:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 545084568, now seen corresponding path program 4 times [2022-03-01 16:05:51,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:05:51,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451217479] [2022-03-01 16:05:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:05:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:05:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:05:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:05:53,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:05:53,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451217479] [2022-03-01 16:05:53,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451217479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:05:53,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278075017] [2022-03-01 16:05:53,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:05:53,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:05:53,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:05:53,101 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-01 16:05:53,101 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-01 16:05:53,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:05:53,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:05:53,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 16:05:53,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:05:55,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:05:55,294 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-01 16:05:55,692 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:05:55,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:05:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:05:56,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:05:58,023 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:05:58,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:05:58,028 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 66 treesize of output 60 [2022-03-01 16:06:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:06:09,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278075017] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:06:09,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:06:09,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-01 16:06:09,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116646347] [2022-03-01 16:06:09,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:06:09,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-01 16:06:09,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:06:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-01 16:06:09,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=9716, Unknown=18, NotChecked=0, Total=10506 [2022-03-01 16:06:09,653 INFO L87 Difference]: Start difference. First operand 3603 states and 9674 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:06:22,565 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (= c_~s~0 0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse3 (= |c_thread2Thread1of1ForFork1_~j~0#1| 1))) (and (or .cse0 .cse1 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= c_~s~0 c_~N~0) (= (mod c_~x~0 4294967296) (mod c_~y~0 4294967296)))) (= c_~y~0 0) .cse2 .cse3 (= c_~C~0 c_~x~0) (<= c_~x~0 c_~C~0) (or (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0)) (and .cse2 (<= 1 c_~N~0) .cse4)) (<= c_~C~0 c_~x~0) .cse4 (or (and (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse7 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse6 (+ .cse7 aux_mod_aux_mod_~C~0_30_61)) (.cse5 (* 4294967295 c_~x~0))) (or (<= (+ .cse5 c_~y~0 4294967296) .cse6) (= (+ (* (- 1) c_~y~0) .cse7 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse6 (+ .cse5 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse1) (or .cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (< 0 c_~N~0) (< 0 c_~n~0) (= c_~q~0.offset 0) (<= 1 c_~q_back~0) (<= c_~n~0 2))) is different from false [2022-03-01 16:06:22,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0)))) (and (or .cse0 .cse1 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= c_~s~0 c_~N~0) (= (mod c_~x~0 4294967296) (mod c_~y~0 4294967296)))) (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (= c_~C~0 c_~x~0) (= c_~s~0 0) (or (and (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse4 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse3 (+ .cse4 aux_mod_aux_mod_~C~0_30_61)) (.cse2 (* 4294967295 c_~x~0))) (or (<= (+ .cse2 c_~y~0 4294967296) .cse3) (= (+ (* (- 1) c_~y~0) .cse4 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse3 (+ .cse2 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse1) (< 0 c_~N~0) (< 0 c_~n~0) (<= 1 c_~q_back~0) (<= c_~n~0 2))) is different from false [2022-03-01 16:06:23,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod c_~x~0 4294967296))) (let ((.cse3 (and .cse8 (= .cse9 (mod c_~y~0 4294967296)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3) (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse1 .cse2) (= c_~s~0 1) (= c_~C~0 c_~x~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse7 .cse3) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse1 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse2) (= c_~q~0.offset 0) (or .cse0 .cse1 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse2) (<= 1 c_~q_back~0) (or (and .cse5 .cse8) .cse7) (<= c_~n~0 2) (or .cse0 .cse1 .cse2 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-01 16:06:26,101 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296))) (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and .cse3 .cse1) .cse0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and .cse3 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-01 16:06:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:06:27,596 INFO L93 Difference]: Finished difference Result 7310 states and 19458 transitions. [2022-03-01 16:06:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-01 16:06:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:06:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:06:27,612 INFO L225 Difference]: With dead ends: 7310 [2022-03-01 16:06:27,613 INFO L226 Difference]: Without dead ends: 6758 [2022-03-01 16:06:27,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 224 SyntacticMatches, 14 SemanticMatches, 198 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 13075 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=3228, Invalid=34930, Unknown=78, NotChecked=1564, Total=39800 [2022-03-01 16:06:27,617 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1751 mSDsluCounter, 12760 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 12255 SdHoareTripleChecker+Invalid, 8017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5653 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:06:27,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1751 Valid, 12255 Invalid, 8017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2284 Invalid, 0 Unknown, 5653 Unchecked, 1.4s Time] [2022-03-01 16:06:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6758 states. [2022-03-01 16:06:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6758 to 3887. [2022-03-01 16:06:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3887 states, 3886 states have (on average 2.6832218219248585) internal successors, (10427), 3886 states have internal predecessors, (10427), 0 states have call successors, (0), 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-01 16:06:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 10427 transitions. [2022-03-01 16:06:27,783 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 10427 transitions. Word has length 133 [2022-03-01 16:06:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:06:27,783 INFO L470 AbstractCegarLoop]: Abstraction has 3887 states and 10427 transitions. [2022-03-01 16:06:27,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:06:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 10427 transitions. [2022-03-01 16:06:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:06:27,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:06:27,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:06:27,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 16:06:27,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:06:27,998 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:06:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:06:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1945316896, now seen corresponding path program 5 times [2022-03-01 16:06:27,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:06:27,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375805105] [2022-03-01 16:06:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:06:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:06:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:06:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:06:30,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:06:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375805105] [2022-03-01 16:06:30,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375805105] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:06:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383398336] [2022-03-01 16:06:30,006 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:06:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:06:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:06:30,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:06:30,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 16:06:30,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 16:06:30,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:06:30,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-01 16:06:30,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:06:30,257 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-01 16:06:30,551 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:06:30,552 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 11 treesize of output 11 [2022-03-01 16:06:31,512 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-01 16:06:31,774 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-01 16:06:31,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2022-03-01 16:06:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:06:32,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:06:34,052 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:06:34,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 116 treesize of output 108 [2022-03-01 16:06:34,057 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 80 treesize of output 68 [2022-03-01 16:06:36,475 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-01 16:06:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:06:36,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383398336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:06:36,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:06:36,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 29] total 91 [2022-03-01 16:06:36,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851228915] [2022-03-01 16:06:36,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:06:36,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-01 16:06:36,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:06:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-01 16:06:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=7542, Unknown=7, NotChecked=0, Total=8190 [2022-03-01 16:06:36,653 INFO L87 Difference]: Start difference. First operand 3887 states and 10427 transitions. Second operand has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 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-01 16:06:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:06:47,700 INFO L93 Difference]: Finished difference Result 6290 states and 16586 transitions. [2022-03-01 16:06:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-01 16:06:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 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 133 [2022-03-01 16:06:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:06:47,711 INFO L225 Difference]: With dead ends: 6290 [2022-03-01 16:06:47,711 INFO L226 Difference]: Without dead ends: 5918 [2022-03-01 16:06:47,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 226 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2082, Invalid=24314, Unknown=10, NotChecked=0, Total=26406 [2022-03-01 16:06:47,713 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 2155 mSDsluCounter, 8128 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 7646 SdHoareTripleChecker+Invalid, 5310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1748 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:06:47,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2155 Valid, 7646 Invalid, 5310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3449 Invalid, 0 Unknown, 1748 Unchecked, 2.5s Time] [2022-03-01 16:06:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2022-03-01 16:06:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4046. [2022-03-01 16:06:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4046 states, 4045 states have (on average 2.684796044499382) internal successors, (10860), 4045 states have internal predecessors, (10860), 0 states have call successors, (0), 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-01 16:06:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4046 states to 4046 states and 10860 transitions. [2022-03-01 16:06:47,814 INFO L78 Accepts]: Start accepts. Automaton has 4046 states and 10860 transitions. Word has length 133 [2022-03-01 16:06:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:06:47,814 INFO L470 AbstractCegarLoop]: Abstraction has 4046 states and 10860 transitions. [2022-03-01 16:06:47,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 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-01 16:06:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4046 states and 10860 transitions. [2022-03-01 16:06:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:06:47,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:06:47,823 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:06:47,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 16:06:48,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-01 16:06:48,040 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:06:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:06:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1067014600, now seen corresponding path program 6 times [2022-03-01 16:06:48,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:06:48,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070339834] [2022-03-01 16:06:48,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:06:48,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:06:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:06:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:06:49,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:06:49,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070339834] [2022-03-01 16:06:49,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070339834] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:06:49,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252859937] [2022-03-01 16:06:49,768 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:06:49,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:06:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:06:49,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:06:49,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 16:06:49,943 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 16:06:49,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:06:49,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-01 16:06:49,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:06:52,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:06:52,169 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-01 16:06:52,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:06:52,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:06:52,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 10 [2022-03-01 16:06:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:06:53,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:06:54,685 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:06:54,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 61 [2022-03-01 16:06:54,690 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 40 treesize of output 34 [2022-03-01 16:06:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:06:57,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252859937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:06:57,388 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:06:57,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 101 [2022-03-01 16:06:57,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634034207] [2022-03-01 16:06:57,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:06:57,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-01 16:06:57,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:06:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-01 16:06:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=9295, Unknown=12, NotChecked=0, Total=10100 [2022-03-01 16:06:57,391 INFO L87 Difference]: Start difference. First operand 4046 states and 10860 transitions. Second operand has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 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-01 16:07:16,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~s~0 c_~N~0)) (.cse1 (+ c_~y~0 (* (div c_~y~0 4294967296) (- 4294967296)))) (.cse2 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (+ (* (div c_~x~0 4294967296) (- 4294967296)) c_~x~0))) (and (or (and .cse0 (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) .cse1)) .cse2) (or (and .cse0 (= .cse1 .cse3)) .cse2) (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0) (and (= (+ c_~C~0 c_~y~0 (* (- 4294967296) (div (+ c_~C~0 c_~y~0) 4294967296))) .cse3) (forall ((v_ArrVal_433 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_433) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))))) is different from false [2022-03-01 16:07:16,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~s~0 c_~N~0)) (.cse1 (+ c_~y~0 (* (div c_~y~0 4294967296) (- 4294967296)))) (.cse3 (+ (* (div c_~x~0 4294967296) (- 4294967296)) c_~x~0)) (.cse2 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or (and .cse0 (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) .cse1)) .cse2) (or (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= (+ c_~C~0 c_~y~0 (* (- 4294967296) (div (+ c_~C~0 c_~y~0) 4294967296))) .cse3) (forall ((v_ArrVal_433 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_433) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) (or (and .cse0 (= .cse1 .cse3)) .cse2))) is different from false [2022-03-01 16:07:20,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-01 16:07:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:07:21,454 INFO L93 Difference]: Finished difference Result 7858 states and 20722 transitions. [2022-03-01 16:07:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-01 16:07:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 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 133 [2022-03-01 16:07:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:07:21,472 INFO L225 Difference]: With dead ends: 7858 [2022-03-01 16:07:21,472 INFO L226 Difference]: Without dead ends: 7726 [2022-03-01 16:07:21,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 209 SyntacticMatches, 14 SemanticMatches, 207 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 15179 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=3746, Invalid=38733, Unknown=171, NotChecked=822, Total=43472 [2022-03-01 16:07:21,475 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 2418 mSDsluCounter, 9646 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 282 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 9172 SdHoareTripleChecker+Invalid, 7142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3318 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:07:21,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2418 Valid, 9172 Invalid, 7142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 3541 Invalid, 1 Unknown, 3318 Unchecked, 5.5s Time] [2022-03-01 16:07:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2022-03-01 16:07:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 4187. [2022-03-01 16:07:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 4186 states have (on average 2.677735308170091) internal successors, (11209), 4186 states have internal predecessors, (11209), 0 states have call successors, (0), 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-01 16:07:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 11209 transitions. [2022-03-01 16:07:21,600 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 11209 transitions. Word has length 133 [2022-03-01 16:07:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:07:21,601 INFO L470 AbstractCegarLoop]: Abstraction has 4187 states and 11209 transitions. [2022-03-01 16:07:21,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.2475247524752477) internal successors, (328), 101 states have internal predecessors, (328), 0 states have call successors, (0), 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-01 16:07:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 11209 transitions. [2022-03-01 16:07:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:07:21,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:07:21,610 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:07:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-01 16:07:21,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-01 16:07:21,823 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:07:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:07:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1926163510, now seen corresponding path program 7 times [2022-03-01 16:07:21,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:07:21,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796414679] [2022-03-01 16:07:21,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:07:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:07:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:07:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:07:23,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:07:23,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796414679] [2022-03-01 16:07:23,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796414679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:07:23,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557562571] [2022-03-01 16:07:23,622 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:07:23,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:07:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:07:23,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:07:23,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 16:07:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:07:23,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-01 16:07:23,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:07:25,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:07:25,988 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-01 16:07:26,372 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:07:26,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:07:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:07:27,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:07:28,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:07:28,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:07:28,742 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 66 treesize of output 60 [2022-03-01 16:07:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:07:38,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557562571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:07:38,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:07:38,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-01 16:07:38,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885734189] [2022-03-01 16:07:38,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:07:38,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-01 16:07:38,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:07:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-01 16:07:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=9728, Unknown=15, NotChecked=0, Total=10506 [2022-03-01 16:07:38,512 INFO L87 Difference]: Start difference. First operand 4187 states and 11209 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:07:51,526 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (+ (* c_~q_front~0 4) c_~q~0.offset))) (let ((.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1)) (.cse11 (<= 1 c_~N~0)) (.cse12 (<= c_~x~0 c_~C~0)) (.cse13 (<= c_~C~0 c_~x~0)) (.cse14 (= c_~s~0 0)) (.cse7 (= |c_thread2Thread1of1ForFork1_~j~0#1| 1)) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse4 (<= .cse15 0)) (.cse5 (<= 0 c_~q_front~0)) (.cse6 (= (select (select |c_#memory_int| c_~q~0.base) .cse15) 1))) (and (= c_~y~0 0) (or .cse0 (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (= c_~s~0 c_~N~0)) .cse1) .cse2 (or .cse3 (and .cse4 .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q~0.base)) .cse6)) .cse7 (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse1 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse10 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse9 (+ .cse10 aux_mod_aux_mod_~C~0_30_61)) (.cse8 (* 4294967295 c_~x~0))) (or (<= (+ .cse8 c_~y~0 4294967296) .cse9) (= (+ (* (- 1) c_~y~0) .cse10 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse9 (+ .cse8 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_462 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_462) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) .cse11 .cse12 (= (+ c_~x~0 (* (- 1) c_~C~0)) 0) .cse13 (or (and .cse2 .cse11 .cse12 .cse13 .cse14) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) .cse14 (or .cse7 .cse3) (or .cse3 (and .cse4 .cse5 .cse6)) (< 0 c_~N~0) (< 0 c_~n~0) (= c_~q~0.offset 0) (<= 1 c_~q_back~0) (<= c_~n~0 2)))) is different from false [2022-03-01 16:07:58,608 WARN L228 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 114 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:08:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:08:05,020 INFO L93 Difference]: Finished difference Result 7052 states and 18545 transitions. [2022-03-01 16:08:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-01 16:08:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:08:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:08:05,030 INFO L225 Difference]: With dead ends: 7052 [2022-03-01 16:08:05,030 INFO L226 Difference]: Without dead ends: 6754 [2022-03-01 16:08:05,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 222 SyntacticMatches, 32 SemanticMatches, 211 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 16136 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=3654, Invalid=41010, Unknown=72, NotChecked=420, Total=45156 [2022-03-01 16:08:05,033 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 2841 mSDsluCounter, 9533 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 8960 SdHoareTripleChecker+Invalid, 8026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5556 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:08:05,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2841 Valid, 8960 Invalid, 8026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2257 Invalid, 0 Unknown, 5556 Unchecked, 1.6s Time] [2022-03-01 16:08:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-03-01 16:08:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 4175. [2022-03-01 16:08:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 4174 states have (on average 2.6684235745088642) internal successors, (11138), 4174 states have internal predecessors, (11138), 0 states have call successors, (0), 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-01 16:08:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 11138 transitions. [2022-03-01 16:08:05,160 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 11138 transitions. Word has length 133 [2022-03-01 16:08:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:08:05,160 INFO L470 AbstractCegarLoop]: Abstraction has 4175 states and 11138 transitions. [2022-03-01 16:08:05,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:08:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 11138 transitions. [2022-03-01 16:08:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:08:05,168 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:08:05,168 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:08:05,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-01 16:08:05,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-01 16:08:05,383 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:08:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:08:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -36261092, now seen corresponding path program 8 times [2022-03-01 16:08:05,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:08:05,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136755344] [2022-03-01 16:08:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:08:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:08:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:08:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:08:07,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:08:07,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136755344] [2022-03-01 16:08:07,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136755344] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:08:07,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566556706] [2022-03-01 16:08:07,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:08:07,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:08:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:08:07,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:08:07,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 16:08:07,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:08:07,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:08:07,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-01 16:08:07,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:08:09,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:08:09,676 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-01 16:08:09,987 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-01 16:08:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:08:10,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:08:12,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:08:12,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 55 [2022-03-01 16:08:12,126 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 34 treesize of output 28 [2022-03-01 16:08:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:08:20,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566556706] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:08:20,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:08:20,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 109 [2022-03-01 16:08:20,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592215365] [2022-03-01 16:08:20,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:08:20,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-03-01 16:08:20,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:08:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-03-01 16:08:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=10987, Unknown=9, NotChecked=0, Total=11772 [2022-03-01 16:08:20,954 INFO L87 Difference]: Start difference. First operand 4175 states and 11138 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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-01 16:09:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:09:08,888 INFO L93 Difference]: Finished difference Result 8665 states and 22965 transitions. [2022-03-01 16:09:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-01 16:09:08,888 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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 133 [2022-03-01 16:09:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:09:08,903 INFO L225 Difference]: With dead ends: 8665 [2022-03-01 16:09:08,904 INFO L226 Difference]: Without dead ends: 8047 [2022-03-01 16:09:08,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 206 SyntacticMatches, 11 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23296 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=5186, Invalid=59480, Unknown=104, NotChecked=0, Total=64770 [2022-03-01 16:09:08,907 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 3648 mSDsluCounter, 13013 mSDsCounter, 0 mSdLazyCounter, 6849 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3648 SdHoareTripleChecker+Valid, 12226 SdHoareTripleChecker+Invalid, 11419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 6849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3821 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:09:08,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3648 Valid, 12226 Invalid, 11419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 6849 Invalid, 0 Unknown, 3821 Unchecked, 8.2s Time] [2022-03-01 16:09:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8047 states. [2022-03-01 16:09:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8047 to 4299. [2022-03-01 16:09:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4299 states, 4298 states have (on average 2.6763610981852026) internal successors, (11503), 4298 states have internal predecessors, (11503), 0 states have call successors, (0), 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-01 16:09:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 11503 transitions. [2022-03-01 16:09:09,012 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 11503 transitions. Word has length 133 [2022-03-01 16:09:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:09:09,012 INFO L470 AbstractCegarLoop]: Abstraction has 4299 states and 11503 transitions. [2022-03-01 16:09:09,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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-01 16:09:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 11503 transitions. [2022-03-01 16:09:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:09:09,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:09:09,021 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:09:09,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-01 16:09:09,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-01 16:09:09,227 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:09:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:09:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1246374708, now seen corresponding path program 9 times [2022-03-01 16:09:09,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:09:09,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880914741] [2022-03-01 16:09:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:09:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:09:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:09:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:09:10,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:09:10,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880914741] [2022-03-01 16:09:10,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880914741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:09:10,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437506896] [2022-03-01 16:09:10,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:09:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:09:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:09:10,906 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:09:10,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-01 16:09:11,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 16:09:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:09:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-01 16:09:11,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:09:12,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:09:12,444 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-01 16:09:12,737 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:09:12,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:09:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:09:13,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:09:14,456 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:09:14,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:09:14,465 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 66 treesize of output 60 [2022-03-01 16:09:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:09:19,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437506896] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:09:19,910 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:09:19,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29, 27] total 84 [2022-03-01 16:09:19,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054762052] [2022-03-01 16:09:19,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:09:19,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-01 16:09:19,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:09:19,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-01 16:09:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=6532, Unknown=10, NotChecked=0, Total=6972 [2022-03-01 16:09:19,911 INFO L87 Difference]: Start difference. First operand 4299 states and 11503 transitions. Second operand has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 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-01 16:09:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:09:26,372 INFO L93 Difference]: Finished difference Result 6250 states and 16492 transitions. [2022-03-01 16:09:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-01 16:09:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 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 133 [2022-03-01 16:09:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:09:26,382 INFO L225 Difference]: With dead ends: 6250 [2022-03-01 16:09:26,382 INFO L226 Difference]: Without dead ends: 6154 [2022-03-01 16:09:26,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 227 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5897 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1470, Invalid=18820, Unknown=16, NotChecked=0, Total=20306 [2022-03-01 16:09:26,383 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 1744 mSDsluCounter, 7731 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 7414 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1552 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:09:26,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1744 Valid, 7414 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2727 Invalid, 0 Unknown, 1552 Unchecked, 1.6s Time] [2022-03-01 16:09:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2022-03-01 16:09:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 4463. [2022-03-01 16:09:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 4462 states have (on average 2.680636485880771) internal successors, (11961), 4462 states have internal predecessors, (11961), 0 states have call successors, (0), 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-01 16:09:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 11961 transitions. [2022-03-01 16:09:26,483 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 11961 transitions. Word has length 133 [2022-03-01 16:09:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:09:26,483 INFO L470 AbstractCegarLoop]: Abstraction has 4463 states and 11961 transitions. [2022-03-01 16:09:26,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 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-01 16:09:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 11961 transitions. [2022-03-01 16:09:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:09:26,492 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:09:26,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:09:26,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-01 16:09:26,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-01 16:09:26,707 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:09:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:09:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -55414478, now seen corresponding path program 10 times [2022-03-01 16:09:26,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:09:26,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247416367] [2022-03-01 16:09:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:09:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:09:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:09:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:09:28,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:09:28,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247416367] [2022-03-01 16:09:28,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247416367] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:09:28,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203764715] [2022-03-01 16:09:28,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:09:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:09:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:09:28,426 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:09:28,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-01 16:09:28,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:09:28,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:09:28,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 16:09:28,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:09:30,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:09:30,639 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-01 16:09:30,986 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:09:30,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:09:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:09:31,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:09:33,258 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:09:33,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:09:33,265 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 66 treesize of output 60 [2022-03-01 16:09:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:09:44,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203764715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:09:44,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:09:44,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-01 16:09:44,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324767266] [2022-03-01 16:09:44,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:09:44,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-01 16:09:44,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:09:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-01 16:09:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=9768, Unknown=9, NotChecked=0, Total=10506 [2022-03-01 16:09:44,576 INFO L87 Difference]: Start difference. First operand 4463 states and 11961 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:10:04,058 WARN L228 SmtUtils]: Spent 15.62s on a formula simplification. DAG size of input: 89 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:10:19,745 WARN L228 SmtUtils]: Spent 12.23s on a formula simplification. DAG size of input: 86 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:10:26,465 WARN L228 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 100 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:10:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:10:35,567 INFO L93 Difference]: Finished difference Result 7210 states and 19188 transitions. [2022-03-01 16:10:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-01 16:10:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:10:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:10:35,577 INFO L225 Difference]: With dead ends: 7210 [2022-03-01 16:10:35,578 INFO L226 Difference]: Without dead ends: 6881 [2022-03-01 16:10:35,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 213 SyntacticMatches, 12 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10556 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=2362, Invalid=29088, Unknown=56, NotChecked=0, Total=31506 [2022-03-01 16:10:35,579 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 1529 mSDsluCounter, 10586 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 10066 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3399 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:10:35,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 10066 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2615 Invalid, 0 Unknown, 3399 Unchecked, 1.6s Time] [2022-03-01 16:10:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2022-03-01 16:10:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4510. [2022-03-01 16:10:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 2.6821911732091372) internal successors, (12094), 4509 states have internal predecessors, (12094), 0 states have call successors, (0), 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-01 16:10:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 12094 transitions. [2022-03-01 16:10:35,678 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 12094 transitions. Word has length 133 [2022-03-01 16:10:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:10:35,678 INFO L470 AbstractCegarLoop]: Abstraction has 4510 states and 12094 transitions. [2022-03-01 16:10:35,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:10:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 12094 transitions. [2022-03-01 16:10:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:10:35,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:10:35,688 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:10:35,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-01 16:10:35,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-01 16:10:35,907 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:10:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:10:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 52006686, now seen corresponding path program 11 times [2022-03-01 16:10:35,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:10:35,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108957728] [2022-03-01 16:10:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:10:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:10:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:10:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:10:37,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:10:37,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108957728] [2022-03-01 16:10:37,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108957728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:10:37,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57255228] [2022-03-01 16:10:37,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:10:37,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:10:37,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:10:37,917 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:10:37,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 16:10:38,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 16:10:38,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:10:38,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-01 16:10:38,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:10:40,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:10:40,114 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-01 16:10:40,393 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-01 16:10:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:10:41,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:10:42,489 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-03-01 16:10:42,659 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-03-01 16:10:42,674 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (forall ((~C~0 Int)) (let ((.cse0 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse0) 4294967296) (mod (+ c_~y~0 .cse0) 4294967296)))))) is different from false [2022-03-01 16:10:42,707 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:10:42,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 59 [2022-03-01 16:10:42,711 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 38 treesize of output 32 [2022-03-01 16:10:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:10:45,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57255228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:10:45,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:10:45,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 109 [2022-03-01 16:10:45,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018251795] [2022-03-01 16:10:45,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:10:45,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-03-01 16:10:45,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:10:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-03-01 16:10:45,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=10433, Unknown=10, NotChecked=630, Total=11772 [2022-03-01 16:10:45,866 INFO L87 Difference]: Start difference. First operand 4510 states and 12094 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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-01 16:10:53,795 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (.cse1 (<= c_~n~0 (+ c_~q_front~0 1))) (.cse2 (<= c_~n~0 0))) (and (or .cse0 .cse1 .cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) .cse1 .cse2))) is different from false [2022-03-01 16:11:07,648 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (.cse4 (<= c_~n~0 (+ c_~q_front~0 1))) (.cse5 (<= c_~n~0 0)) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or .cse3 .cse4 .cse5 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse3 (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) .cse4 .cse5) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2) .cse1) .cse0))) is different from false [2022-03-01 16:11:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:11:26,118 INFO L93 Difference]: Finished difference Result 8158 states and 21777 transitions. [2022-03-01 16:11:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-01 16:11:26,118 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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 133 [2022-03-01 16:11:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:11:26,130 INFO L225 Difference]: With dead ends: 8158 [2022-03-01 16:11:26,130 INFO L226 Difference]: Without dead ends: 7874 [2022-03-01 16:11:26,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 214 SyntacticMatches, 16 SemanticMatches, 209 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 14953 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=3113, Invalid=39106, Unknown=31, NotChecked=2060, Total=44310 [2022-03-01 16:11:26,133 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 2868 mSDsluCounter, 11313 mSDsCounter, 0 mSdLazyCounter, 5554 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 10599 SdHoareTripleChecker+Invalid, 11047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 5554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5275 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:11:26,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2868 Valid, 10599 Invalid, 11047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 5554 Invalid, 0 Unknown, 5275 Unchecked, 3.6s Time] [2022-03-01 16:11:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2022-03-01 16:11:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 4756. [2022-03-01 16:11:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4755 states have (on average 2.6738170347003156) internal successors, (12714), 4755 states have internal predecessors, (12714), 0 states have call successors, (0), 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-01 16:11:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 12714 transitions. [2022-03-01 16:11:26,222 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 12714 transitions. Word has length 133 [2022-03-01 16:11:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:11:26,223 INFO L470 AbstractCegarLoop]: Abstraction has 4756 states and 12714 transitions. [2022-03-01 16:11:26,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 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-01 16:11:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 12714 transitions. [2022-03-01 16:11:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:11:26,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:11:26,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:11:26,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 16:11:26,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:11:26,435 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:11:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:11:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -833138018, now seen corresponding path program 12 times [2022-03-01 16:11:26,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:11:26,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574227125] [2022-03-01 16:11:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:11:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:11:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:11:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:11:28,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:11:28,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574227125] [2022-03-01 16:11:28,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574227125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:11:28,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317006325] [2022-03-01 16:11:28,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:11:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:11:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:11:28,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:11:28,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 16:11:28,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 16:11:28,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:11:28,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-01 16:11:28,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:11:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:11:30,264 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-01 16:11:30,684 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-01 16:11:30,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2022-03-01 16:11:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:11:31,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:11:32,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_front~0 1))) (or (< .cse0 0) (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 .cse0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_607) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))))) is different from false [2022-03-01 16:11:32,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:11:32,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:11:32,994 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 66 treesize of output 60 [2022-03-01 16:11:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:11:37,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317006325] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:11:37,786 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:11:37,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-01 16:11:37,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932480395] [2022-03-01 16:11:37,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:11:37,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-01 16:11:37,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:11:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-01 16:11:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=9616, Unknown=5, NotChecked=200, Total=10506 [2022-03-01 16:11:37,788 INFO L87 Difference]: Start difference. First operand 4756 states and 12714 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:12:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:06,315 INFO L93 Difference]: Finished difference Result 7732 states and 20426 transitions. [2022-03-01 16:12:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-01 16:12:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:12:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:06,328 INFO L225 Difference]: With dead ends: 7732 [2022-03-01 16:12:06,328 INFO L226 Difference]: Without dead ends: 7254 [2022-03-01 16:12:06,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 217 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9769 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=2185, Invalid=28255, Unknown=14, NotChecked=346, Total=30800 [2022-03-01 16:12:06,330 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 2250 mSDsluCounter, 11178 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 10304 SdHoareTripleChecker+Invalid, 8712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5399 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:06,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2250 Valid, 10304 Invalid, 8712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3220 Invalid, 0 Unknown, 5399 Unchecked, 3.0s Time] [2022-03-01 16:12:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2022-03-01 16:12:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5006. [2022-03-01 16:12:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 5005 states have (on average 2.6843156843156843) internal successors, (13435), 5005 states have internal predecessors, (13435), 0 states have call successors, (0), 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-01 16:12:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 13435 transitions. [2022-03-01 16:12:06,448 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 13435 transitions. Word has length 133 [2022-03-01 16:12:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:06,448 INFO L470 AbstractCegarLoop]: Abstraction has 5006 states and 13435 transitions. [2022-03-01 16:12:06,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:12:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 13435 transitions. [2022-03-01 16:12:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:12:06,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:06,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:12:06,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-01 16:12:06,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:06,663 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:12:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -346641282, now seen corresponding path program 13 times [2022-03-01 16:12:06,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:06,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067721983] [2022-03-01 16:12:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:08,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:08,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067721983] [2022-03-01 16:12:08,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067721983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:12:08,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354240680] [2022-03-01 16:12:08,456 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:12:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:12:08,457 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:12:08,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-01 16:12:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:08,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-01 16:12:08,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:12:10,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:12:10,845 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-01 16:12:11,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:12:11,382 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:11,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 10 [2022-03-01 16:12:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:12,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:12:13,321 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:13,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:12:13,325 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 66 treesize of output 60 [2022-03-01 16:12:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:21,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354240680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:12:21,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:12:21,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 102 [2022-03-01 16:12:21,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358161851] [2022-03-01 16:12:21,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:12:21,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-01 16:12:21,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-01 16:12:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=9517, Unknown=7, NotChecked=0, Total=10302 [2022-03-01 16:12:21,026 INFO L87 Difference]: Start difference. First operand 5006 states and 13435 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:12:31,813 WARN L228 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 94 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:12:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:33,819 INFO L93 Difference]: Finished difference Result 7394 states and 19630 transitions. [2022-03-01 16:12:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-01 16:12:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:12:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:33,829 INFO L225 Difference]: With dead ends: 7394 [2022-03-01 16:12:33,830 INFO L226 Difference]: Without dead ends: 7097 [2022-03-01 16:12:33,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 208 SyntacticMatches, 6 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8173 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=2013, Invalid=21229, Unknown=14, NotChecked=0, Total=23256 [2022-03-01 16:12:33,831 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 1909 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 8168 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2608 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:33,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1909 Valid, 8168 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2282 Invalid, 0 Unknown, 2608 Unchecked, 1.4s Time] [2022-03-01 16:12:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2022-03-01 16:12:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 5104. [2022-03-01 16:12:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5104 states, 5103 states have (on average 2.6854791299235745) internal successors, (13704), 5103 states have internal predecessors, (13704), 0 states have call successors, (0), 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-01 16:12:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 13704 transitions. [2022-03-01 16:12:33,928 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 13704 transitions. Word has length 133 [2022-03-01 16:12:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:33,928 INFO L470 AbstractCegarLoop]: Abstraction has 5104 states and 13704 transitions. [2022-03-01 16:12:33,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:12:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 13704 transitions. [2022-03-01 16:12:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:12:33,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:33,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:12:33,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-01 16:12:34,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:34,151 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:12:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 449497782, now seen corresponding path program 14 times [2022-03-01 16:12:34,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:34,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326837141] [2022-03-01 16:12:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:35,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:35,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326837141] [2022-03-01 16:12:35,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326837141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:12:35,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948171577] [2022-03-01 16:12:35,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:12:35,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:12:35,887 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:12:35,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-01 16:12:36,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:12:36,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:12:36,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 16:12:36,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:12:38,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:12:38,169 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-01 16:12:38,623 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-01 16:12:38,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2022-03-01 16:12:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:39,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:12:40,310 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_665 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_665) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-03-01 16:12:40,341 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_665 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_665) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-03-01 16:12:40,357 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_665 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_665) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-03-01 16:12:40,391 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_665 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_665) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))))) is different from false [2022-03-01 16:12:40,418 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:40,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 87 [2022-03-01 16:12:40,423 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 66 treesize of output 60 [2022-03-01 16:12:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:45,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948171577] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:12:45,142 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:12:45,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 102 [2022-03-01 16:12:45,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309893574] [2022-03-01 16:12:45,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:12:45,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-01 16:12:45,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-01 16:12:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=8863, Unknown=4, NotChecked=780, Total=10302 [2022-03-01 16:12:45,144 INFO L87 Difference]: Start difference. First operand 5104 states and 13704 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:13:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:13:04,040 INFO L93 Difference]: Finished difference Result 7539 states and 19829 transitions. [2022-03-01 16:13:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-01 16:13:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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 133 [2022-03-01 16:13:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:13:04,051 INFO L225 Difference]: With dead ends: 7539 [2022-03-01 16:13:04,051 INFO L226 Difference]: Without dead ends: 7407 [2022-03-01 16:13:04,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 209 SyntacticMatches, 10 SemanticMatches, 165 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8432 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=2156, Invalid=24248, Unknown=18, NotChecked=1300, Total=27722 [2022-03-01 16:13:04,053 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 1971 mSDsluCounter, 9382 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 8723 SdHoareTripleChecker+Invalid, 8632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5959 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:13:04,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1971 Valid, 8723 Invalid, 8632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2561 Invalid, 0 Unknown, 5959 Unchecked, 3.7s Time] [2022-03-01 16:13:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7407 states. [2022-03-01 16:13:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7407 to 5163. [2022-03-01 16:13:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5163 states, 5162 states have (on average 2.6857807051530416) internal successors, (13864), 5162 states have internal predecessors, (13864), 0 states have call successors, (0), 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-01 16:13:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 13864 transitions. [2022-03-01 16:13:04,166 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 13864 transitions. Word has length 133 [2022-03-01 16:13:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:04,166 INFO L470 AbstractCegarLoop]: Abstraction has 5163 states and 13864 transitions. [2022-03-01 16:13:04,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 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-01 16:13:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 13864 transitions. [2022-03-01 16:13:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 16:13:04,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:04,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-03-01 16:13:04,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-01 16:13:04,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:04,386 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 16:13:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash -852291404, now seen corresponding path program 15 times [2022-03-01 16:13:04,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:04,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729132214] [2022-03-01 16:13:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:13:06,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:06,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729132214] [2022-03-01 16:13:06,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729132214] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:13:06,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537593579] [2022-03-01 16:13:06,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:13:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:13:06,116 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:13:06,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-01 16:13:06,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 16:13:06,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:13:06,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-01 16:13:06,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:13:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:13:07,677 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-01 16:13:08,005 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-01 16:13:08,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 10 [2022-03-01 16:13:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:13:08,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:13:09,945 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:13:09,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 84 treesize of output 76 [2022-03-01 16:13:09,949 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 48 treesize of output 36 Received shutdown request... [2022-03-01 16:13:15,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-01 16:13:15,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-01 16:13:15,892 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 16:13:15,910 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 16:13:16,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:16,083 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. [2022-03-01 16:13:16,084 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-01 16:13:16,084 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-01 16:13:16,086 INFO L732 BasicCegarLoop]: Path program histogram: [15, 12, 3, 1, 1, 1] [2022-03-01 16:13:16,088 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 16:13:16,088 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 16:13:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 04:13:16 BasicIcfg [2022-03-01 16:13:16,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 16:13:16,090 INFO L158 Benchmark]: Toolchain (without parser) took 794097.02ms. Allocated memory was 182.5MB in the beginning and 508.6MB in the end (delta: 326.1MB). Free memory was 124.9MB in the beginning and 228.6MB in the end (delta: -103.7MB). Peak memory consumption was 223.4MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,090 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 16:13:16,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.55ms. Allocated memory was 182.5MB in the beginning and 244.3MB in the end (delta: 61.9MB). Free memory was 124.7MB in the beginning and 213.6MB in the end (delta: -88.9MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.93ms. Allocated memory is still 244.3MB. Free memory was 213.6MB in the beginning and 212.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,091 INFO L158 Benchmark]: Boogie Preprocessor took 27.11ms. Allocated memory is still 244.3MB. Free memory was 212.1MB in the beginning and 210.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,091 INFO L158 Benchmark]: RCFGBuilder took 488.21ms. Allocated memory is still 244.3MB. Free memory was 210.5MB in the beginning and 188.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,091 INFO L158 Benchmark]: TraceAbstraction took 793253.63ms. Allocated memory was 244.3MB in the beginning and 508.6MB in the end (delta: 264.2MB). Free memory was 187.9MB in the beginning and 228.6MB in the end (delta: -40.7MB). Peak memory consumption was 224.1MB. Max. memory is 8.0GB. [2022-03-01 16:13:16,092 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.55ms. Allocated memory was 182.5MB in the beginning and 244.3MB in the end (delta: 61.9MB). Free memory was 124.7MB in the beginning and 213.6MB in the end (delta: -88.9MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.93ms. Allocated memory is still 244.3MB. Free memory was 213.6MB in the beginning and 212.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.11ms. Allocated memory is still 244.3MB. Free memory was 212.1MB in the beginning and 210.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 488.21ms. Allocated memory is still 244.3MB. Free memory was 210.5MB in the beginning and 188.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 793253.63ms. Allocated memory was 244.3MB in the beginning and 508.6MB in the end (delta: 264.2MB). Free memory was 187.9MB in the beginning and 228.6MB in the end (delta: -40.7MB). Peak memory consumption was 224.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 793.1s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.2s, AutomataDifference: 561.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 39029 SdHoareTripleChecker+Valid, 45.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39029 mSDsluCounter, 162015 SdHoareTripleChecker+Invalid, 40.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 55610 IncrementalHoareTripleChecker+Unchecked, 168713 mSDsCounter, 2886 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53002 IncrementalHoareTripleChecker+Invalid, 111499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2886 mSolverCounterUnsat, 5827 mSDtfsCounter, 53002 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7078 GetRequests, 3776 SyntacticMatches, 212 SemanticMatches, 3090 ConstructedPredicates, 22 IntricatePredicates, 5 DeprecatedPredicates, 187802 ImplicationChecksByTransitivity, 642.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5163occurred in iteration=32, InterpolantAutomatonStates: 1989, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 45524 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 210.6s InterpolantComputationTime, 6190 NumberOfCodeBlocks, 6176 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 8363 ConstructedInterpolants, 1089 QuantifiedInterpolants, 187900 SizeOfPredicates, 591 NumberOfNonLiveVariables, 5169 ConjunctsInSsa, 1031 ConjunctsInUnsatCore, 66 InterpolantComputations, 15 PerfectInterpolantSequences, 75/714 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown