/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:02:22,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:02:22,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:02:22,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:02:22,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:02:22,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:02:22,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:02:22,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:02:22,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:02:22,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:02:22,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:02:22,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:02:22,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:02:22,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:02:22,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:02:22,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:02:22,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:02:22,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:02:22,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:02:22,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:02:22,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:02:22,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:02:22,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:02:22,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:02:22,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:02:22,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:02:22,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:02:22,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:02:22,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:02:22,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:02:22,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:02:22,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:02:22,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:02:22,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:02:22,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:02:22,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:02:22,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:02:22,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:02:22,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:02:22,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:02:22,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:02:22,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:02:22,581 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:02:22,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:02:22,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:02:22,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:02:22,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:02:22,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:02:22,583 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:02:22,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:02:22,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:02:22,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:02:22,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:02:22,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:02:22,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:02:22,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:02:22,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:02:22,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:02:22,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:02:22,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:02:22,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:02:22,586 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:02:22,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:02:22,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:02:22,586 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-15 20:02:22,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:02:22,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:02:22,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:02:22,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:02:22,791 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:02:22,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-03-15 20:02:22,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5a1d964/555c7171b53c4ee0abf7885cf57dd471/FLAG2847c5641 [2022-03-15 20:02:23,205 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:02:23,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-03-15 20:02:23,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5a1d964/555c7171b53c4ee0abf7885cf57dd471/FLAG2847c5641 [2022-03-15 20:02:23,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5a1d964/555c7171b53c4ee0abf7885cf57dd471 [2022-03-15 20:02:23,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:02:23,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:02:23,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:02:23,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:02:23,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:02:23,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:23,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ff04c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23, skipping insertion in model container [2022-03-15 20:02:23,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:23,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:02:23,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:02:23,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-03-15 20:02:23,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-03-15 20:02:23,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-03-15 20:02:23,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:02:23,888 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:02:23,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-03-15 20:02:23,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-03-15 20:02:23,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-03-15 20:02:23,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:02:23,971 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:02:23,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23 WrapperNode [2022-03-15 20:02:23,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:02:23,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:02:23,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:02:23,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:02:23,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:23,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,008 INFO L137 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-03-15 20:02:24,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:02:24,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:02:24,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:02:24,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:02:24,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:02:24,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:02:24,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:02:24,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:02:24,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (1/1) ... [2022-03-15 20:02:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:02:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:24,070 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-15 20:02:24,084 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-15 20:02:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:02:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 20:02:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 20:02:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 20:02:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:02:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:02:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:02:24,098 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:02:24,196 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:02:24,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:02:24,366 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:02:24,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:02:24,372 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:02:24,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:02:24 BoogieIcfgContainer [2022-03-15 20:02:24,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:02:24,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:02:24,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:02:24,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:02:24,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:02:23" (1/3) ... [2022-03-15 20:02:24,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7685fb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:02:24, skipping insertion in model container [2022-03-15 20:02:24,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:02:23" (2/3) ... [2022-03-15 20:02:24,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7685fb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:02:24, skipping insertion in model container [2022-03-15 20:02:24,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:02:24" (3/3) ... [2022-03-15 20:02:24,379 INFO L111 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2022-03-15 20:02:24,382 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:02:24,383 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:02:24,383 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-03-15 20:02:24,383 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:02:24,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,418 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,418 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,418 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,418 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,418 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,419 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,419 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,420 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,420 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,420 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,420 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,421 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,421 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,421 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,421 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,421 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,422 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,422 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,422 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,422 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,438 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,439 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:02:24,443 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:02:24,470 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:02:24,474 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:02:24,475 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-03-15 20:02:24,483 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:02:24,488 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 158 transitions, 332 flow [2022-03-15 20:02:24,490 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 158 transitions, 332 flow [2022-03-15 20:02:24,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 158 transitions, 332 flow [2022-03-15 20:02:24,541 INFO L129 PetriNetUnfolder]: 11/156 cut-off events. [2022-03-15 20:02:24,541 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:02:24,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 156 events. 11/156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 292 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-03-15 20:02:24,550 INFO L116 LiptonReduction]: Number of co-enabled transitions 4890 [2022-03-15 20:02:28,560 INFO L131 LiptonReduction]: Checked pairs total: 10759 [2022-03-15 20:02:28,561 INFO L133 LiptonReduction]: Total number of compositions: 139 [2022-03-15 20:02:28,566 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions, 98 flow [2022-03-15 20:02:28,610 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 360 states, 355 states have (on average 2.8422535211267608) internal successors, (1009), 359 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 360 states, 355 states have (on average 2.8422535211267608) internal successors, (1009), 359 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:02:28,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:28,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 20:02:28,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1146087194, now seen corresponding path program 1 times [2022-03-15 20:02:28,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:28,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457756235] [2022-03-15 20:02:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:28,889 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-15 20:02:28,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:28,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457756235] [2022-03-15 20:02:28,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457756235] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:28,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:28,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:02:28,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670854273] [2022-03-15 20:02:28,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:28,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:28,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 20:02:28,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:28,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:28,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:02:28,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:02:28,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:02:28,928 INFO L87 Difference]: Start difference. First operand has 360 states, 355 states have (on average 2.8422535211267608) internal successors, (1009), 359 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:29,018 INFO L93 Difference]: Finished difference Result 544 states and 1462 transitions. [2022-03-15 20:02:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:02:29,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-03-15 20:02:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:29,029 INFO L225 Difference]: With dead ends: 544 [2022-03-15 20:02:29,030 INFO L226 Difference]: Without dead ends: 544 [2022-03-15 20:02:29,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 20:02:29,032 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:29,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 14 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:02:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-03-15 20:02:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2022-03-15 20:02:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 535 states have (on average 2.7271028037383176) internal successors, (1459), 539 states have internal predecessors, (1459), 0 states have call successors, (0), 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-15 20:02:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1459 transitions. [2022-03-15 20:02:29,087 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1459 transitions. Word has length 6 [2022-03-15 20:02:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:29,088 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 1459 transitions. [2022-03-15 20:02:29,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1459 transitions. [2022-03-15 20:02:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:02:29,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:29,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:29,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:02:29,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1875599359, now seen corresponding path program 1 times [2022-03-15 20:02:29,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:29,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463143295] [2022-03-15 20:02:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:29,121 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:29,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815611272] [2022-03-15 20:02:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:29,124 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-15 20:02:29,136 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-15 20:02:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:29,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:02:29,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:29,274 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-15 20:02:29,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:29,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:29,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463143295] [2022-03-15 20:02:29,275 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:29,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815611272] [2022-03-15 20:02:29,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815611272] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:29,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:29,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:02:29,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264582154] [2022-03-15 20:02:29,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:29,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:29,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2022-03-15 20:02:29,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:29,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:29,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:02:29,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:02:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:02:29,279 INFO L87 Difference]: Start difference. First operand 540 states and 1459 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:29,364 INFO L93 Difference]: Finished difference Result 618 states and 1663 transitions. [2022-03-15 20:02:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:02:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:02:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:29,367 INFO L225 Difference]: With dead ends: 618 [2022-03-15 20:02:29,367 INFO L226 Difference]: Without dead ends: 618 [2022-03-15 20:02:29,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:02:29,368 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:29,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:02:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-03-15 20:02:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 566. [2022-03-15 20:02:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 561 states have (on average 2.72192513368984) internal successors, (1527), 565 states have internal predecessors, (1527), 0 states have call successors, (0), 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-15 20:02:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1527 transitions. [2022-03-15 20:02:29,392 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1527 transitions. Word has length 8 [2022-03-15 20:02:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:29,392 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1527 transitions. [2022-03-15 20:02:29,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1527 transitions. [2022-03-15 20:02:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:02:29,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:29,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:29,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:02:29,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:29,595 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 491531289, now seen corresponding path program 1 times [2022-03-15 20:02:29,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:29,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114919429] [2022-03-15 20:02:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:29,628 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-15 20:02:29,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:29,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114919429] [2022-03-15 20:02:29,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114919429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:29,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:29,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:02:29,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550379164] [2022-03-15 20:02:29,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:29,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:29,630 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 20:02:29,630 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:29,630 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:29,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:02:29,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:02:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:02:29,631 INFO L87 Difference]: Start difference. First operand 566 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:29,697 INFO L93 Difference]: Finished difference Result 656 states and 1738 transitions. [2022-03-15 20:02:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:02:29,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:02:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:29,701 INFO L225 Difference]: With dead ends: 656 [2022-03-15 20:02:29,701 INFO L226 Difference]: Without dead ends: 610 [2022-03-15 20:02:29,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 20:02:29,703 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:29,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:02:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-03-15 20:02:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 586. [2022-03-15 20:02:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 2.738382099827883) internal successors, (1591), 585 states have internal predecessors, (1591), 0 states have call successors, (0), 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-15 20:02:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1591 transitions. [2022-03-15 20:02:29,730 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1591 transitions. Word has length 9 [2022-03-15 20:02:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:29,730 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 1591 transitions. [2022-03-15 20:02:29,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1591 transitions. [2022-03-15 20:02:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:02:29,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:29,741 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:29,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:02:29,742 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1295703682, now seen corresponding path program 1 times [2022-03-15 20:02:29,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:29,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139914394] [2022-03-15 20:02:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:29,757 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:29,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714344982] [2022-03-15 20:02:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:29,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:29,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:29,762 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-15 20:02:29,769 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-15 20:02:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:29,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:02:29,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:02:29,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:29,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:29,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139914394] [2022-03-15 20:02:29,909 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:29,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714344982] [2022-03-15 20:02:29,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714344982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:29,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:29,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 20:02:29,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675497864] [2022-03-15 20:02:29,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:29,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:29,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:02:29,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:29,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:29,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:02:29,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:02:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:02:29,918 INFO L87 Difference]: Start difference. First operand 586 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-15 20:02:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:29,969 INFO L93 Difference]: Finished difference Result 478 states and 1270 transitions. [2022-03-15 20:02:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:02:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:02:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:29,977 INFO L225 Difference]: With dead ends: 478 [2022-03-15 20:02:29,977 INFO L226 Difference]: Without dead ends: 446 [2022-03-15 20:02:29,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-15 20:02:29,978 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:29,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 7 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:02:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-03-15 20:02:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 398. [2022-03-15 20:02:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.619647355163728) internal successors, (1040), 397 states have internal predecessors, (1040), 0 states have call successors, (0), 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-15 20:02:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1040 transitions. [2022-03-15 20:02:29,986 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1040 transitions. Word has length 15 [2022-03-15 20:02:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:29,986 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 1040 transitions. [2022-03-15 20:02:29,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-15 20:02:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1040 transitions. [2022-03-15 20:02:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:02:29,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:29,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:30,008 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-15 20:02:30,192 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,SelfDestructingSolverStorable3 [2022-03-15 20:02:30,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1805899814, now seen corresponding path program 1 times [2022-03-15 20:02:30,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:30,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397088335] [2022-03-15 20:02:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:30,209 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:30,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134317682] [2022-03-15 20:02:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:30,211 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-15 20:02:30,212 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-15 20:02:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:30,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:02:30,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:30,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:02:30,357 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-15 20:02:30,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:30,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:30,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397088335] [2022-03-15 20:02:30,357 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:30,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134317682] [2022-03-15 20:02:30,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134317682] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:30,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:30,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:02:30,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399602325] [2022-03-15 20:02:30,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:30,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:30,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2022-03-15 20:02:30,367 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:30,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:30,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:02:30,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:02:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:02:30,380 INFO L87 Difference]: Start difference. First operand 398 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:30,420 INFO L93 Difference]: Finished difference Result 236 states and 538 transitions. [2022-03-15 20:02:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:02:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:02:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:30,421 INFO L225 Difference]: With dead ends: 236 [2022-03-15 20:02:30,421 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 20:02:30,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-15 20:02:30,422 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:30,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:02:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 20:02:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2022-03-15 20:02:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.3230769230769233) internal successors, (453), 195 states have internal predecessors, (453), 0 states have call successors, (0), 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-15 20:02:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 453 transitions. [2022-03-15 20:02:30,427 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 453 transitions. Word has length 17 [2022-03-15 20:02:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:30,427 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 453 transitions. [2022-03-15 20:02:30,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 453 transitions. [2022-03-15 20:02:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:02:30,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:30,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:30,447 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-15 20:02:30,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:30,643 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1217462602, now seen corresponding path program 1 times [2022-03-15 20:02:30,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:30,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105275137] [2022-03-15 20:02:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:30,664 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:30,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972682139] [2022-03-15 20:02:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:30,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:30,668 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-15 20:02:30,669 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-15 20:02:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:30,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:02:30,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:33,213 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-15 20:02:33,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:33,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:33,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105275137] [2022-03-15 20:02:33,213 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:33,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972682139] [2022-03-15 20:02:33,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972682139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:33,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:33,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:02:33,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725328928] [2022-03-15 20:02:33,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:33,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:33,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2022-03-15 20:02:33,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:48,735 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,736 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,746 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,747 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,836 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,837 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,849 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,850 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,879 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,880 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,885 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:48,886 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:48,899 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:48,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:02:48,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:02:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:02:48,900 INFO L87 Difference]: Start difference. First operand 196 states and 453 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:49,025 INFO L93 Difference]: Finished difference Result 346 states and 798 transitions. [2022-03-15 20:02:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:02:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:02:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:49,027 INFO L225 Difference]: With dead ends: 346 [2022-03-15 20:02:49,027 INFO L226 Difference]: Without dead ends: 346 [2022-03-15 20:02:49,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:02:49,027 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:49,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 24 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:02:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-03-15 20:02:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2022-03-15 20:02:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.3221884498480243) internal successors, (764), 329 states have internal predecessors, (764), 0 states have call successors, (0), 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-15 20:02:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 764 transitions. [2022-03-15 20:02:49,034 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 764 transitions. Word has length 18 [2022-03-15 20:02:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:49,034 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 764 transitions. [2022-03-15 20:02:49,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:02:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 764 transitions. [2022-03-15 20:02:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:02:49,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:49,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:49,056 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-15 20:02:49,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:49,237 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash -913374399, now seen corresponding path program 1 times [2022-03-15 20:02:49,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:49,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172972105] [2022-03-15 20:02:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:49,255 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:49,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980480717] [2022-03-15 20:02:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:49,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:49,256 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-15 20:02:49,259 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-15 20:02:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:49,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 20:02:49,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:49,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:02:49,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:02:49,452 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:02:49,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:02:49,487 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 13 treesize of output 15 [2022-03-15 20:02:49,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:02:49,733 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 52 treesize of output 46 [2022-03-15 20:02:49,779 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-15 20:02:49,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:49,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:49,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172972105] [2022-03-15 20:02:49,780 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:49,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980480717] [2022-03-15 20:02:49,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980480717] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:49,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:49,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:02:49,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959673781] [2022-03-15 20:02:49,780 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:49,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:49,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 20:02:49,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:50,111 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,111 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,118 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,118 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,176 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,176 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,188 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,189 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,247 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,247 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,252 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,253 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,295 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,296 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,301 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:50,301 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:50,310 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:50,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:02:50,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:02:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:02:50,311 INFO L87 Difference]: Start difference. First operand 330 states and 764 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-15 20:02:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:50,510 INFO L93 Difference]: Finished difference Result 546 states and 1253 transitions. [2022-03-15 20:02:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:02:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:02:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:50,512 INFO L225 Difference]: With dead ends: 546 [2022-03-15 20:02:50,512 INFO L226 Difference]: Without dead ends: 538 [2022-03-15 20:02:50,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:02:50,513 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:50,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 32 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-03-15 20:02:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-03-15 20:02:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 468. [2022-03-15 20:02:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.321199143468951) internal successors, (1084), 467 states have internal predecessors, (1084), 0 states have call successors, (0), 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-15 20:02:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1084 transitions. [2022-03-15 20:02:50,522 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1084 transitions. Word has length 19 [2022-03-15 20:02:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:50,522 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1084 transitions. [2022-03-15 20:02:50,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-15 20:02:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1084 transitions. [2022-03-15 20:02:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:02:50,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:50,523 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] [2022-03-15 20:02:50,540 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-15 20:02:50,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:50,737 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1750165474, now seen corresponding path program 1 times [2022-03-15 20:02:50,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:50,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590875033] [2022-03-15 20:02:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:50,749 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:50,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240135394] [2022-03-15 20:02:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:50,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:50,750 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-15 20:02:50,782 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-15 20:02:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:50,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 20:02:50,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:50,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:02:50,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:02:51,014 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:02:51,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:02:51,045 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 13 treesize of output 15 [2022-03-15 20:02:51,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:02:51,301 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 52 treesize of output 46 [2022-03-15 20:02:51,360 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-15 20:02:51,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:51,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:51,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590875033] [2022-03-15 20:02:51,360 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:51,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240135394] [2022-03-15 20:02:51,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240135394] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:51,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:51,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:02:51,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1449020100] [2022-03-15 20:02:51,361 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:51,362 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:51,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 99 transitions. [2022-03-15 20:02:51,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:51,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:51,953 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:51,958 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:51,959 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,021 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,023 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,027 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,028 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,074 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,075 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,079 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,079 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,134 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,134 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,139 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:52,139 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:52,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:52,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:02:52,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:02:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:02:52,148 INFO L87 Difference]: Start difference. First operand 468 states and 1084 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 20:02:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:52,304 INFO L93 Difference]: Finished difference Result 540 states and 1241 transitions. [2022-03-15 20:02:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:02:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 20 [2022-03-15 20:02:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:52,306 INFO L225 Difference]: With dead ends: 540 [2022-03-15 20:02:52,306 INFO L226 Difference]: Without dead ends: 510 [2022-03-15 20:02:52,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:02:52,307 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 95 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:52,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 23 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-03-15 20:02:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-03-15 20:02:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 468. [2022-03-15 20:02:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.325481798715203) internal successors, (1086), 467 states have internal predecessors, (1086), 0 states have call successors, (0), 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-15 20:02:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1086 transitions. [2022-03-15 20:02:52,315 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1086 transitions. Word has length 20 [2022-03-15 20:02:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:52,315 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1086 transitions. [2022-03-15 20:02:52,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 20:02:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1086 transitions. [2022-03-15 20:02:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:02:52,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:52,316 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] [2022-03-15 20:02:52,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 20:02:52,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:52,533 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1750165009, now seen corresponding path program 1 times [2022-03-15 20:02:52,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:52,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912329231] [2022-03-15 20:02:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:52,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:52,552 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:52,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580407801] [2022-03-15 20:02:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:52,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:52,660 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-15 20:02:52,661 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-15 20:02:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:52,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 20:02:52,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:02:52,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:02:52,871 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:02:52,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:02:52,894 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 13 treesize of output 15 [2022-03-15 20:02:52,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:02:53,063 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 52 treesize of output 46 [2022-03-15 20:02:53,116 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-15 20:02:53,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:53,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:53,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912329231] [2022-03-15 20:02:53,116 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:53,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580407801] [2022-03-15 20:02:53,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580407801] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:53,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:53,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:02:53,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540433279] [2022-03-15 20:02:53,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:53,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:53,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 76 transitions. [2022-03-15 20:02:53,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:53,502 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,503 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,511 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,511 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,517 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,517 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,524 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,527 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,713 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,714 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,722 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,723 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,788 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,789 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,793 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,793 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,806 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,817 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,817 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,859 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,859 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,867 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:53,868 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:53,874 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:53,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:02:53,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:02:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:02:53,875 INFO L87 Difference]: Start difference. First operand 468 states and 1086 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 20:02:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:54,072 INFO L93 Difference]: Finished difference Result 513 states and 1173 transitions. [2022-03-15 20:02:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:02:54,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 20 [2022-03-15 20:02:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:54,074 INFO L225 Difference]: With dead ends: 513 [2022-03-15 20:02:54,074 INFO L226 Difference]: Without dead ends: 510 [2022-03-15 20:02:54,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:02:54,074 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:54,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 38 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-03-15 20:02:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-03-15 20:02:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 460. [2022-03-15 20:02:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.3311546840958606) internal successors, (1070), 459 states have internal predecessors, (1070), 0 states have call successors, (0), 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-15 20:02:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1070 transitions. [2022-03-15 20:02:54,082 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1070 transitions. Word has length 20 [2022-03-15 20:02:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:54,082 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1070 transitions. [2022-03-15 20:02:54,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 20:02:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1070 transitions. [2022-03-15 20:02:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:02:54,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:54,083 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] [2022-03-15 20:02:54,111 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-15 20:02:54,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:54,293 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444848, now seen corresponding path program 1 times [2022-03-15 20:02:54,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:54,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618048397] [2022-03-15 20:02:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:54,308 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:54,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486198280] [2022-03-15 20:02:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:54,322 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-15 20:02:54,324 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-15 20:02:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:54,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 20:02:54,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:54,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:02:54,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:02:54,573 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:02:54,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:02:54,605 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 13 treesize of output 15 [2022-03-15 20:02:54,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:02:54,788 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 52 treesize of output 46 [2022-03-15 20:02:54,850 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-15 20:02:54,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:54,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:54,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618048397] [2022-03-15 20:02:54,851 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:54,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486198280] [2022-03-15 20:02:54,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486198280] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:54,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:54,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:02:54,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717876524] [2022-03-15 20:02:54,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:54,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:54,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 134 transitions. [2022-03-15 20:02:54,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:55,843 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,844 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,849 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,850 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,855 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,856 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,864 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,864 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,920 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,921 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,925 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,954 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,955 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:55,959 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:55,960 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,008 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,009 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,013 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,015 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,025 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13843#(and (= ~value~0 |t2Thread1of1ForFork1_#t~ret8#1|) (= ~value~0 0))] [2022-03-15 20:02:56,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:02:56,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:56,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:02:56,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:02:56,026 INFO L87 Difference]: Start difference. First operand 460 states and 1070 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-15 20:02:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:56,209 INFO L93 Difference]: Finished difference Result 503 states and 1159 transitions. [2022-03-15 20:02:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:02:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2022-03-15 20:02:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:56,211 INFO L225 Difference]: With dead ends: 503 [2022-03-15 20:02:56,211 INFO L226 Difference]: Without dead ends: 499 [2022-03-15 20:02:56,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:02:56,212 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:56,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 38 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-03-15 20:02:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-03-15 20:02:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 442. [2022-03-15 20:02:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.3197278911564627) internal successors, (1023), 441 states have internal predecessors, (1023), 0 states have call successors, (0), 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-15 20:02:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1023 transitions. [2022-03-15 20:02:56,220 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1023 transitions. Word has length 21 [2022-03-15 20:02:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:56,220 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 1023 transitions. [2022-03-15 20:02:56,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-15 20:02:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1023 transitions. [2022-03-15 20:02:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:02:56,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:56,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:02:56,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 20:02:56,435 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,SelfDestructingSolverStorable9 [2022-03-15 20:02:56,435 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1876178164, now seen corresponding path program 1 times [2022-03-15 20:02:56,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:56,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986583316] [2022-03-15 20:02:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:56,448 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:56,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527773614] [2022-03-15 20:02:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:56,450 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-15 20:02:56,451 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-15 20:02:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:56,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-15 20:02:56,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:02:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:02:56,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:02:56,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:02:56,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986583316] [2022-03-15 20:02:56,579 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:02:56,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527773614] [2022-03-15 20:02:56,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527773614] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:02:56,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:02:56,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:02:56,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781156252] [2022-03-15 20:02:56,579 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:02:56,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:02:56,587 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 89 transitions. [2022-03-15 20:02:56,587 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:02:56,739 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,739 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,742 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,742 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,760 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,760 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,764 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:02:56,765 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:02:56,790 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:02:56,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:02:56,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:02:56,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:02:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:02:56,791 INFO L87 Difference]: Start difference. First operand 442 states and 1023 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-15 20:02:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:02:56,860 INFO L93 Difference]: Finished difference Result 310 states and 694 transitions. [2022-03-15 20:02:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:02:56,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:02:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:02:56,861 INFO L225 Difference]: With dead ends: 310 [2022-03-15 20:02:56,861 INFO L226 Difference]: Without dead ends: 246 [2022-03-15 20:02:56,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:02:56,862 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:02:56,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:02:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-03-15 20:02:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-03-15 20:02:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.2122448979591836) internal successors, (542), 245 states have internal predecessors, (542), 0 states have call successors, (0), 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-15 20:02:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 542 transitions. [2022-03-15 20:02:56,866 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 542 transitions. Word has length 23 [2022-03-15 20:02:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:02:56,866 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 542 transitions. [2022-03-15 20:02:56,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-15 20:02:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 542 transitions. [2022-03-15 20:02:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:02:56,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:02:56,867 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:02:56,891 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-15 20:02:57,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:57,083 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:02:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:02:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1371678506, now seen corresponding path program 1 times [2022-03-15 20:02:57,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:02:57,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219962620] [2022-03-15 20:02:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:02:57,098 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:02:57,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265039387] [2022-03-15 20:02:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:02:57,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:02:57,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:02:57,099 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-15 20:02:57,125 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-15 20:02:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:02:57,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:02:57,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:03:14,038 WARN L228 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 20:03:23,579 WARN L228 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 20:03:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:03:30,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:03:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:03:31,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:03:31,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219962620] [2022-03-15 20:03:31,178 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:03:31,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265039387] [2022-03-15 20:03:31,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265039387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:03:31,178 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:03:31,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-03-15 20:03:31,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1106265076] [2022-03-15 20:03:31,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:03:31,182 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:03:31,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 116 transitions. [2022-03-15 20:03:31,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:04:26,364 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:26,365 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:26,369 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:26,370 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:31,031 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:31,032 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:31,040 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:31,041 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:31,055 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:31,055 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:31,066 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:31,067 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:31,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:04:31,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:04:31,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:04:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:04:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:04:31,093 INFO L87 Difference]: Start difference. First operand 246 states and 542 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-15 20:04:33,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-15 20:04:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:04:33,422 INFO L93 Difference]: Finished difference Result 342 states and 755 transitions. [2022-03-15 20:04:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:04:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 36 [2022-03-15 20:04:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:04:33,424 INFO L225 Difference]: With dead ends: 342 [2022-03-15 20:04:33,424 INFO L226 Difference]: Without dead ends: 342 [2022-03-15 20:04:33,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:04:33,425 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:04:33,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:04:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-03-15 20:04:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-03-15 20:04:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.2140762463343107) internal successors, (755), 341 states have internal predecessors, (755), 0 states have call successors, (0), 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-15 20:04:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 755 transitions. [2022-03-15 20:04:33,431 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 755 transitions. Word has length 36 [2022-03-15 20:04:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:04:33,431 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 755 transitions. [2022-03-15 20:04:33,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-15 20:04:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 755 transitions. [2022-03-15 20:04:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 20:04:33,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:04:33,432 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:04:33,455 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-15 20:04:33,632 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,SelfDestructingSolverStorable11 [2022-03-15 20:04:33,633 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:04:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:04:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash 427629877, now seen corresponding path program 1 times [2022-03-15 20:04:33,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:04:33,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279264634] [2022-03-15 20:04:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:04:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:04:33,650 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:04:33,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65805986] [2022-03-15 20:04:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:04:33,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:04:33,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:04:33,651 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-15 20:04:33,652 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-15 20:04:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:04:34,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:04:34,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:04:34,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-03-15 20:04:34,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:04:34,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2022-03-15 20:04:34,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-03-15 20:04:34,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 75 treesize of output 42 [2022-03-15 20:04:34,681 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 17 treesize of output 9 [2022-03-15 20:04:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:04:34,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:04:35,000 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 41 treesize of output 37 [2022-03-15 20:04:35,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:35,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-15 20:04:35,031 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 17 treesize of output 11 [2022-03-15 20:04:35,076 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:35,076 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 27 treesize of output 31 [2022-03-15 20:04:35,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:04:35,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2022-03-15 20:04:35,219 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 20:04:35,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 97 [2022-03-15 20:04:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:04:46,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:04:46,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279264634] [2022-03-15 20:04:46,640 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:04:46,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65805986] [2022-03-15 20:04:46,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65805986] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:04:46,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:04:46,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2022-03-15 20:04:46,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130799380] [2022-03-15 20:04:46,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:04:46,644 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:04:46,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 117 transitions. [2022-03-15 20:04:46,658 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:04:46,857 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:46,857 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:46,865 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:46,866 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,870 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,871 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,881 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,881 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,907 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,907 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,912 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,913 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,976 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,977 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:51,990 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:04:51,991 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:04:52,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17595#(and (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 1) (= ~next~0 (mod 1 (mod ~buffer_size~0 4294967296))) (= |~#buffer~0.offset| 0) (= ~first~0 1) (= ~buffer_size~0 10))] [2022-03-15 20:04:52,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:04:52,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:04:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:04:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:04:52,382 INFO L87 Difference]: Start difference. First operand 342 states and 755 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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-15 20:04:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:04:53,654 INFO L93 Difference]: Finished difference Result 590 states and 1310 transitions. [2022-03-15 20:04:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:04:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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 37 [2022-03-15 20:04:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:04:53,657 INFO L225 Difference]: With dead ends: 590 [2022-03-15 20:04:53,657 INFO L226 Difference]: Without dead ends: 562 [2022-03-15 20:04:53,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:04:53,659 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:04:53,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 206 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:04:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-03-15 20:04:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 470. [2022-03-15 20:04:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.204690831556503) internal successors, (1034), 469 states have internal predecessors, (1034), 0 states have call successors, (0), 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-15 20:04:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1034 transitions. [2022-03-15 20:04:53,668 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1034 transitions. Word has length 37 [2022-03-15 20:04:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:04:53,669 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1034 transitions. [2022-03-15 20:04:53,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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-15 20:04:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1034 transitions. [2022-03-15 20:04:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:04:53,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:04:53,670 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:04:53,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:04:53,876 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,SelfDestructingSolverStorable12 [2022-03-15 20:04:53,876 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:04:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:04:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1526977506, now seen corresponding path program 1 times [2022-03-15 20:04:53,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:04:53,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190988055] [2022-03-15 20:04:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:04:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:04:53,890 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:04:53,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774060569] [2022-03-15 20:04:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:04:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:04:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:04:53,892 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-15 20:04:53,893 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-15 20:04:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:04:54,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 20:04:54,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:04:54,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:04:54,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:04:54,566 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:04:54,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:04:54,610 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 13 treesize of output 15 [2022-03-15 20:04:54,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:04:59,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-03-15 20:05:03,919 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 19 [2022-03-15 20:05:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:05:06,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:08:16,934 WARN L228 SmtUtils]: Spent 1.43m on a formula simplification that was a NOOP. DAG size: 160 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:09:06,202 WARN L228 SmtUtils]: Spent 16.63s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:09:10,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse1 (mod c_~next~0 4294967296))) (or (<= .cse0 .cse1) (<= (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 4294967296) 0) (let ((.cse4 (<= .cse1 2147483647))) (let ((.cse3 (not .cse4)) (.cse2 (<= (mod (+ c_~first~0 1) 4294967296) 2147483647))) (and (or .cse2 (and (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_960 (Array Int Int))) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod c_~next~0 4294967296)) 0) (+ |~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) 2)) .cse3) (or .cse4 (forall ((|~#buffer~0.offset| Int) (v_ArrVal_960 (Array Int Int))) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod c_~next~0 4294967296) (- 4294967296)) 0) (+ |~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) 2))))) (or (and (or (forall ((|~#buffer~0.offset| Int) (v_ArrVal_960 (Array Int Int))) (= 2 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod c_~next~0 4294967296) (- 4294967296)) 0) (+ |~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) 2) (+ |~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))) .cse4) (or .cse3 (forall ((|~#buffer~0.offset| Int) (v_ArrVal_960 (Array Int Int))) (= 2 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| (mod c_~next~0 4294967296)) 0) (+ |~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) 2) (+ |~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))))) (not .cse2))))))) is different from false [2022-03-15 20:09:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:09:11,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:11,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190988055] [2022-03-15 20:09:11,580 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:09:11,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774060569] [2022-03-15 20:09:11,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774060569] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:09:11,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:09:11,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 27 [2022-03-15 20:09:11,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369647943] [2022-03-15 20:09:11,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:11,585 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:11,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 137 transitions. [2022-03-15 20:09:11,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:25,158 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:25,159 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:25,163 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:25,163 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:25,167 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:25,168 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:32,194 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:32,194 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:36,885 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:36,886 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:36,890 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:36,890 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:36,910 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:36,911 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:36,927 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:36,928 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:43,725 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:43,726 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:43,735 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:43,735 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:43,742 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:43,742 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:50,650 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:50,651 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:50,656 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:50,656 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:50,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19401#(and (= ~next~0 (mod (mod ~first~0 4294967296) 10)) (= ~first~0 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 2) (= |~#buffer~0.base| 3))] [2022-03-15 20:09:50,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:09:50,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:09:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=670, Unknown=28, NotChecked=54, Total=870 [2022-03-15 20:09:50,676 INFO L87 Difference]: Start difference. First operand 470 states and 1034 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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-15 20:09:53,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:09:58,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:10:01,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:10:03,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:10:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:03,781 INFO L93 Difference]: Finished difference Result 796 states and 1752 transitions. [2022-03-15 20:10:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:10:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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 41 [2022-03-15 20:10:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:03,784 INFO L225 Difference]: With dead ends: 796 [2022-03-15 20:10:03,784 INFO L226 Difference]: Without dead ends: 768 [2022-03-15 20:10:03,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 217.8s TimeCoverageRelationStatistics Valid=146, Invalid=822, Unknown=28, NotChecked=60, Total=1056 [2022-03-15 20:10:03,785 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 93 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:03,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 337 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1639 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2022-03-15 20:10:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-03-15 20:10:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 521. [2022-03-15 20:10:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.207692307692308) internal successors, (1148), 520 states have internal predecessors, (1148), 0 states have call successors, (0), 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-15 20:10:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1148 transitions. [2022-03-15 20:10:03,795 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1148 transitions. Word has length 41 [2022-03-15 20:10:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:03,795 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1148 transitions. [2022-03-15 20:10:03,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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-15 20:10:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1148 transitions. [2022-03-15 20:10:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:10:03,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:03,796 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:03,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:10:04,007 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,SelfDestructingSolverStorable13 [2022-03-15 20:10:04,007 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:10:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1686184890, now seen corresponding path program 2 times [2022-03-15 20:10:04,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:04,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084079806] [2022-03-15 20:10:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:04,022 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:10:04,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931318310] [2022-03-15 20:10:04,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:10:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:10:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:10:04,024 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-15 20:10:04,025 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-15 20:10:04,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:10:04,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:10:04,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 20:10:04,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:10:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:10:04,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:10:04,536 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:10:04,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:10:04,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:10:11,783 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 13 treesize of output 15 [2022-03-15 20:10:14,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2022-03-15 20:10:17,041 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 19 treesize of output 15 [2022-03-15 20:10:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:17,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:10:21,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse2 (mod (+ c_~first~0 1) 4294967296)) (.cse1 (mod c_~next~0 4294967296))) (or (<= 7 |c_t1Thread1of1ForFork0_~i~0#1|) (<= .cse0 .cse1) (<= .cse0 .cse2) (let ((.cse5 (<= .cse2 2147483647)) (.cse4 (<= .cse1 2147483647))) (let ((.cse7 (not .cse4)) (.cse6 (not .cse5)) (.cse3 (<= (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) 127))) (and (or (not .cse3) (and (or .cse4 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))) .cse5) (or .cse6 (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) |c_t1Thread1of1ForFork0_~i~0#1|))))) (or (and (or .cse5 (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))) .cse6)) .cse7))) (or (and (or .cse7 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))) .cse5) (or (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))) .cse6))) (or .cse4 (and (or .cse6 (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) (or .cse5 (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_t1Thread1of1ForFork0_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))))) .cse3)))) (<= .cse1 0))) is different from false [2022-03-15 20:10:21,332 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~buffer_size~0 4294967296)) (.cse13 (mod (+ c_~first~0 1) 4294967296)) (.cse14 (mod c_~next~0 4294967296))) (or (let ((.cse5 (<= .cse14 2147483647)) (.cse3 (<= .cse13 2147483647))) (let ((.cse0 (<= (mod (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 256) 127)) (.cse2 (not .cse3)) (.cse6 (not .cse5))) (and (or (not .cse0) (and (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse1 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse1 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse2) (or .cse3 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse4 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse4 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))))) .cse5) (or .cse6 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse7 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse7 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse7 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse8 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse8)))))))) (or .cse0 (and (or .cse5 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse9 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse9 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse9 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse10 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse10 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))))))) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse11 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse11))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse12 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse12 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))))) .cse6)))))) (<= .cse15 .cse14) (<= .cse15 .cse13) (<= .cse14 0) (<= 6 |c_t1Thread1of1ForFork0_~i~0#1|))) is different from false [2022-03-15 20:10:21,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~buffer_size~0 4294967296)) (.cse13 (mod (+ c_~first~0 1) 4294967296)) (.cse14 (mod c_~next~0 4294967296))) (or (let ((.cse5 (<= .cse14 2147483647)) (.cse3 (<= .cse13 2147483647))) (let ((.cse0 (<= (mod (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 256) 127)) (.cse2 (not .cse3)) (.cse6 (not .cse5))) (and (or (not .cse0) (and (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse1 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse1 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse2) (or .cse3 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse4 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse4 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))))) .cse5) (or .cse6 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse7 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse7 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse7 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse8 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse8)))))))) (or .cse0 (and (or .cse5 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse9 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse9 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse9 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse10 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse10 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))))))) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse11 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse11))) .cse3) (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (= .cse12 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse12 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))))) .cse6)))))) (<= .cse15 .cse14) (<= .cse15 .cse13) (not (<= (mod c_~send~0 256) 0)) (<= .cse14 0) (<= 6 |c_t1Thread1of1ForFork0_~i~0#1|))) is different from false [2022-03-15 20:10:23,022 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse2 (mod (+ c_~first~0 1) 4294967296)) (.cse1 (mod c_~next~0 4294967296))) (or (<= 5 |c_t1Thread1of1ForFork0_~i~0#1|) (<= .cse0 .cse1) (<= .cse0 .cse2) (let ((.cse3 (<= .cse1 2147483647)) (.cse4 (<= .cse2 2147483647))) (let ((.cse7 (not .cse4)) (.cse10 (not .cse3)) (.cse11 (<= (mod (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|) 256) 127))) (and (or (and (or .cse3 (and (or .cse4 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse5 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse5 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse5 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse6 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (- 256) (mod .cse6 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse6))) .cse7))) (or (and (or .cse4 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse8 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse8 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse8 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse9 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse9 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (- 256) (mod .cse9 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse7)) .cse10)) .cse11) (or (and (or .cse3 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse12 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse12 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse4) (or .cse7 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse13 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod .cse13 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse13)))))) (or (and (or .cse4 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse14 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse14 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse14 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse15 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod .cse15 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse15))) .cse7)) .cse10)) (not .cse11))))) (<= .cse1 0))) is different from false [2022-03-15 20:10:23,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296))) (let ((.cse2 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 4294967296)) (.cse1 (mod (+ c_~first~0 1) 4294967296))) (or (<= 5 |c_t1Thread1of1ForFork0_~i~0#1|) (<= .cse0 .cse1) (<= .cse2 0) (let ((.cse3 (<= .cse1 2147483647)) (.cse8 (<= .cse2 2147483647))) (let ((.cse11 (<= (mod (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|) 256) 127)) (.cse7 (not .cse8)) (.cse6 (not .cse3))) (and (or (and (or (and (or .cse3 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse4 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse4 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse5 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse5 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse5 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse6)) .cse7) (or .cse8 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse9 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse9 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse9))) .cse3) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse10 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse10 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse10))) .cse6)))) .cse11) (or (not .cse11) (and (or .cse8 (and (or .cse3 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse12 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse12 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse13 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse13 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse13 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse6))) (or .cse7 (and (or .cse3 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse14 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse14 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse14 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or .cse6 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse15 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse15 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse15)))))))))))))) is different from false [2022-03-15 20:10:51,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296))) (let ((.cse1 (mod (+ c_~first~0 1) 4294967296)) (.cse35 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 4294967296)) (.cse36 (mod c_~next~0 4294967296))) (or (<= 5 |c_t1Thread1of1ForFork0_~i~0#1|) (<= .cse0 .cse1) (let ((.cse5 (<= .cse36 2147483647)) (.cse9 (<= .cse1 2147483647)) (.cse3 (<= .cse35 2147483647)) (.cse21 (<= (mod (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|) 256) 127))) (let ((.cse22 (<= (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) 127)) (.cse2 (not .cse21)) (.cse14 (not .cse3)) (.cse8 (not .cse9)) (.cse7 (not .cse5))) (and (or (and (or .cse2 (and (or .cse3 (and (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse4 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse4 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse5) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse6 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse6 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse6))) .cse7)) .cse8) (or .cse9 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse10 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse10 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse10))) .cse7) (or .cse5 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse11 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse11 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse11 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))))))) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse12 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse12 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse12 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse9) (or .cse8 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse13 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse13 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse13 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))))) .cse14))) (or (and (or .cse5 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse15 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse15 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse15 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse8) (or .cse9 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse16 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse16 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse16)))))) (or .cse7 (and (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse17 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse17 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse17 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse8) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse18 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse18 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse18 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse9)) .cse3) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse19 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse19 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse19 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse9) (or .cse8 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse20 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse20 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse20 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))))) .cse14)))) .cse21)) (not .cse22)) (or .cse22 (and (or (and (or .cse14 (and (or .cse8 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse23 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse23 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse23 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))))) (or .cse9 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse24 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (mod .cse24 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse24)))))) (or (and (or (and (or .cse9 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse25 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse25 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse25 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or .cse8 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse26 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse26 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse26 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))))) .cse7) (or (and (or .cse9 (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse27 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse27 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse27 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse28 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (mod .cse28 256)) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse28))) .cse8)) .cse5)) .cse3)) .cse2) (or (and (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse29 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse29 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse9) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse30 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse30 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) .cse30))) .cse8)) .cse5) (or (and (or .cse14 (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse31 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse31 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) .cse31))) .cse9) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse32 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse32 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) (+ (- 256) (mod .cse32 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse8))) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse33 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse33 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse33 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296)))))) .cse9) (or (forall ((v_ArrVal_1075 (Array Int Int))) (let ((.cse34 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (= .cse34 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) (+ (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (- 256)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) (+ (- 256) (mod .cse34 256))) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296)))))) .cse8)) .cse3)) .cse7)) .cse21)))))) (<= .cse35 0) (not (< .cse36 .cse0))))) is different from false [2022-03-15 20:11:04,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296))) (let ((.cse1 (mod c_~next~0 4294967296)) (.cse8 (mod (+ c_~first~0 1) 4294967296)) (.cse7 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 4294967296))) (or (<= .cse0 .cse1) (let ((.cse4 (<= .cse8 2147483647))) (let ((.cse6 (<= .cse7 2147483647)) (.cse5 (not .cse4))) (and (or (let ((.cse3 (<= .cse1 2147483647))) (let ((.cse2 (not .cse3))) (and (or (and (or .cse2 (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))) 2))) (or (forall ((v_ArrVal_1075 (Array Int Int))) (= 2 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))) .cse3)) .cse4) (or (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (= 2 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset| (- 4294967296)) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))))) .cse3) (or (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296) (- 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) 2)) .cse2)) .cse5)))) .cse6) (or (not .cse6) (and (or (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296))) 2)) .cse5) (or (forall ((v_ArrVal_1075 (Array Int Int))) (= 2 (select (store (select (store (store |c_#memory_int| |c_~#buffer~0.base| (store (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod c_~next~0 4294967296) |c_~#buffer~0.offset|) 0)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1075) |c_~#buffer~0.base|) (+ |c_~#buffer~0.offset| (mod (mod (mod (+ c_~next~0 1) 4294967296) (mod c_~buffer_size~0 4294967296)) 4294967296)) 2) (+ |c_~#buffer~0.offset| (mod (+ c_~first~0 1) 4294967296) (- 4294967296))))) .cse4)))))) (<= .cse0 .cse8) (<= .cse7 0)))) is different from false [2022-03-15 20:11:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-03-15 20:11:06,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:11:06,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084079806] [2022-03-15 20:11:06,228 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:11:06,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931318310] [2022-03-15 20:11:06,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931318310] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:11:06,228 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:11:06,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2022-03-15 20:11:06,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044040030] [2022-03-15 20:11:06,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:11:06,233 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:11:06,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 135 transitions. [2022-03-15 20:11:06,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:11:51,397 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:11:51,398 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:11:51,403 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:11:51,404 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:11:51,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [21523#(and (or (= ~buffer_size~0 10) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= |~#buffer~0.offset| 0) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= |~#buffer~0.base| 3) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (<= 6 |t1Thread1of1ForFork0_~i~0#1|) (= ~first~0 0)) (or (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 1) (<= 6 |t1Thread1of1ForFork0_~i~0#1|))), 21520#(and (or (= ~buffer_size~0 10) (not (= (mod ~send~0 256) 0))) (or (= |~#buffer~0.offset| 0) (not (= (mod ~send~0 256) 0))) (or (not (= (mod ~send~0 256) 0)) (= ~first~0 0)) (or (= |t1Thread1of1ForFork0_~i~0#1| 1) (not (= (mod ~send~0 256) 0))) (or (not (= (mod ~send~0 256) 0)) (= |~#buffer~0.base| 3)) (or (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (not (= (mod ~send~0 256) 0))) (or (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (not (= (mod ~send~0 256) 0)))), 21525#(and (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= |~#buffer~0.base| 3) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= ~buffer_size~0 10) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= |~#buffer~0.offset| 0) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|) (= ~first~0 0)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|) (= (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)))) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 1) (not (< (mod (mod (mod (+ ~next~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) 4294967296) (mod ~buffer_size~0 4294967296))) (<= 6 |t1Thread1of1ForFork0_~i~0#1|))), 21519#(and (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (= |~#buffer~0.offset| 0) (= ~buffer_size~0 10) (= |t1Thread1of1ForFork0_~i~0#1| 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (= |~#buffer~0.base| 3) (= ~first~0 0)), 21518#(and (= |~#buffer~0.offset| 0) (= ~first~0 1) (= ~buffer_size~0 10) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (= (mod (mod ~first~0 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 2) (= |~#buffer~0.base| 3)), 21521#(and (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (= |t1Thread1of1ForFork0_~i~0#1| 1) (not (= (mod ~send~0 256) 0))) (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (= ~buffer_size~0 10) (not (= (mod ~send~0 256) 0))) (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (not (= (mod ~send~0 256) 0)) (= |~#buffer~0.base| 3)) (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (= |~#buffer~0.offset| 0) (not (= (mod ~send~0 256) 0))) (or (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (not (= (mod ~send~0 256) 0))) (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (not (= (mod ~send~0 256) 0))) (or (<= 7 |t1Thread1of1ForFork0_~i~0#1|) (not (= (mod ~send~0 256) 0)) (= ~first~0 0))), 21522#(and (or (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|) (= ~first~0 0)) (or (not (= (mod ~send~0 256) 0)) (= |~#buffer~0.base| 3) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 1) (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= |~#buffer~0.offset| 0) (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (= ~buffer_size~0 10) (not (= (mod ~send~0 256) 0)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|))), 21524#(and (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= (mod (mod (+ ~first~0 1) 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= |~#buffer~0.base| 3) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 1) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= ~buffer_size~0 10) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#buffer~0.base|)) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (= |~#buffer~0.offset| 0) (<= 6 |t1Thread1of1ForFork0_~i~0#1|)) (or (< (+ 2147483648 |t1Thread1of1ForFork0_~i~0#1|) 0) (<= 6 |t1Thread1of1ForFork0_~i~0#1|) (= ~first~0 0)))] [2022-03-15 20:11:51,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:11:51,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:11:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:11:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=922, Unknown=9, NotChecked=476, Total=1560 [2022-03-15 20:11:51,495 INFO L87 Difference]: Start difference. First operand 521 states and 1148 transitions. Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 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-15 20:11:54,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:02,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:13,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:15,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:22,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:25,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:27,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:29,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:35,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:37,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:40,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:42,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:44,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:48,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:12:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:51,506 INFO L93 Difference]: Finished difference Result 938 states and 2067 transitions. [2022-03-15 20:12:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:12:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 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 41 [2022-03-15 20:12:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:51,509 INFO L225 Difference]: With dead ends: 938 [2022-03-15 20:12:51,509 INFO L226 Difference]: Without dead ends: 910 [2022-03-15 20:12:51,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=322, Invalid=1953, Unknown=9, NotChecked=686, Total=2970 [2022-03-15 20:12:51,511 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 267 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 46 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:51,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 387 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2046 Invalid, 14 Unknown, 0 Unchecked, 33.8s Time] [2022-03-15 20:12:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-03-15 20:12:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 510. [2022-03-15 20:12:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.212180746561886) internal successors, (1126), 509 states have internal predecessors, (1126), 0 states have call successors, (0), 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-15 20:12:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1126 transitions. [2022-03-15 20:12:51,520 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1126 transitions. Word has length 41 [2022-03-15 20:12:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:51,520 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1126 transitions. [2022-03-15 20:12:51,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 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-15 20:12:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1126 transitions. [2022-03-15 20:12:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:12:51,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:51,521 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:51,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:12:51,735 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,SelfDestructingSolverStorable14 [2022-03-15 20:12:51,735 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:12:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2009426959, now seen corresponding path program 3 times [2022-03-15 20:12:51,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:51,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387413757] [2022-03-15 20:12:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:51,750 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:12:51,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805967663] [2022-03-15 20:12:51,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:12:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:12:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:12:51,752 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-15 20:12:51,753 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-15 20:12:52,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:12:52,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:12:52,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 20:12:52,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:12:53,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-03-15 20:12:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:12:53,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:12:53,181 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-03-15 20:12:53,199 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 59 treesize of output 38 [2022-03-15 20:12:53,441 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 15 treesize of output 7 [2022-03-15 20:12:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:53,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:12:54,436 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 41 treesize of output 37 [2022-03-15 20:12:54,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:12:54,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:12:54,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-15 20:12:55,466 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 17 treesize of output 10 [2022-03-15 20:12:56,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:12:56,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-03-15 20:12:57,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:12:57,116 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 28 treesize of output 32 [2022-03-15 20:13:00,374 INFO L353 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-03-15 20:13:00,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 98 [2022-03-15 20:13:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:47,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:47,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387413757] [2022-03-15 20:13:47,813 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:13:47,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805967663] [2022-03-15 20:13:47,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805967663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:47,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:47,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2022-03-15 20:13:47,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1257728623] [2022-03-15 20:13:47,813 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:47,818 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:47,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 157 transitions. [2022-03-15 20:13:47,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:55,619 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:55,620 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:55,631 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:55,632 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,314 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,315 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,318 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,318 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,364 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,365 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,369 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,369 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,410 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,410 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,423 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:56,423 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:56,436 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [23805#(and (= ~next~0 (mod 1 (mod ~buffer_size~0 4294967296))) (= |~#buffer~0.offset| 0) (= ~first~0 1) (= ~buffer_size~0 10) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 3))] [2022-03-15 20:13:56,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:13:56,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:13:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:13:56,437 INFO L87 Difference]: Start difference. First operand 510 states and 1126 transitions. Second operand has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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-15 20:13:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:58,780 INFO L93 Difference]: Finished difference Result 798 states and 1758 transitions. [2022-03-15 20:13:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:13:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 45 [2022-03-15 20:13:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:58,783 INFO L225 Difference]: With dead ends: 798 [2022-03-15 20:13:58,784 INFO L226 Difference]: Without dead ends: 770 [2022-03-15 20:13:58,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:13:58,784 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 94 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:58,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 354 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:13:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-03-15 20:13:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 550. [2022-03-15 20:13:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.2185792349726774) internal successors, (1218), 549 states have internal predecessors, (1218), 0 states have call successors, (0), 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-15 20:13:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1218 transitions. [2022-03-15 20:13:58,815 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1218 transitions. Word has length 45 [2022-03-15 20:13:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:58,815 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1218 transitions. [2022-03-15 20:13:58,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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-15 20:13:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1218 transitions. [2022-03-15 20:13:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 20:13:58,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:58,816 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:58,824 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-15 20:13:59,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:59,023 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:13:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1401608772, now seen corresponding path program 4 times [2022-03-15 20:13:59,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:59,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153901009] [2022-03-15 20:13:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:59,040 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:13:59,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369200175] [2022-03-15 20:13:59,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:13:59,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:59,042 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-15 20:13:59,043 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-15 20:13:59,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:13:59,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:59,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 20:13:59,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:22,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 20:14:29,010 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 15 treesize of output 7 [2022-03-15 20:14:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:14:29,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:31,513 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 41 treesize of output 37 [2022-03-15 20:14:31,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:31,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:14:31,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-03-15 20:14:31,548 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 17 treesize of output 10 [2022-03-15 20:14:31,604 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 58 treesize of output 40 [2022-03-15 20:14:31,703 INFO L353 Elim1Store]: treesize reduction 78, result has 24.3 percent of original size [2022-03-15 20:14:31,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 115 [2022-03-15 20:14:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:14:48,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:48,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153901009] [2022-03-15 20:14:48,028 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:14:48,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369200175] [2022-03-15 20:14:48,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369200175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:48,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:48,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2022-03-15 20:14:48,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810000851] [2022-03-15 20:14:48,028 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:48,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:48,060 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 177 transitions. [2022-03-15 20:14:48,060 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:38,342 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:38,343 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:38,354 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:38,354 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:38,372 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:38,373 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:38,387 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:38,387 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:43,006 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:43,006 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:43,012 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:15:43,013 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:15:43,088 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26023#(and (= |~#buffer~0.offset| 0) (= ~first~0 1) (= ~buffer_size~0 10) (= (mod (mod ~first~0 4294967296) (mod ~buffer_size~0 4294967296)) ~next~0) (= (+ |t1Thread1of1ForFork0_~i~0#1| 1) 4))] [2022-03-15 20:15:43,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:15:43,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:15:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=644, Unknown=2, NotChecked=0, Total=756 [2022-03-15 20:15:43,089 INFO L87 Difference]: Start difference. First operand 550 states and 1218 transitions. Second operand has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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-15 20:15:45,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:15:47,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:15:50,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-03-15 20:15:52,821 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~first~0 4294967296))) (and (= (mod |c_t1Thread1of1ForFork0_~i~0#1| 256) (select (select |c_#memory_int| |c_~#buffer~0.base|) (+ (mod (mod .cse0 10) 4294967296) |c_~#buffer~0.offset|))) (= |c_~#buffer~0.offset| 0) (= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= c_~first~0 1) (= c_~buffer_size~0 10) (= c_~next~0 (mod .cse0 (mod c_~buffer_size~0 4294967296))))) is different from false [2022-03-15 20:16:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:04,492 INFO L93 Difference]: Finished difference Result 842 states and 1858 transitions. [2022-03-15 20:16:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:16:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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 49 [2022-03-15 20:16:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:04,496 INFO L225 Difference]: With dead ends: 842 [2022-03-15 20:16:04,496 INFO L226 Difference]: Without dead ends: 814 [2022-03-15 20:16:04,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 18 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=124, Invalid=744, Unknown=6, NotChecked=56, Total=930 [2022-03-15 20:16:04,496 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 100 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:04,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 390 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1632 Invalid, 3 Unknown, 3 Unchecked, 7.9s Time] [2022-03-15 20:16:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-03-15 20:16:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 614. [2022-03-15 20:16:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.238172920065253) internal successors, (1372), 613 states have internal predecessors, (1372), 0 states have call successors, (0), 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-15 20:16:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1372 transitions. [2022-03-15 20:16:04,506 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1372 transitions. Word has length 49 [2022-03-15 20:16:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:04,506 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 1372 transitions. [2022-03-15 20:16:04,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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-15 20:16:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1372 transitions. [2022-03-15 20:16:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 20:16:04,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:04,508 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:04,526 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-15 20:16:04,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:16:04,726 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-03-15 20:16:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1422893377, now seen corresponding path program 1 times [2022-03-15 20:16:04,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:04,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003494066] [2022-03-15 20:16:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:04,751 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:16:04,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470537473] [2022-03-15 20:16:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:04,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:04,752 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-15 20:16:04,753 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-15 20:16:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:05,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 20:16:05,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:05,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-03-15 20:16:05,071 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:16:05,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:16:05,118 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 13 treesize of output 15 [2022-03-15 20:16:05,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-03-15 20:16:06,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-03-15 20:16:06,315 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 21 treesize of output 17 [2022-03-15 20:16:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:06,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-03-15 20:16:56,877 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:16:56,878 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-03-15 20:16:56,894 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-15 20:16:56,898 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-15 20:16:57,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:16:57,079 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. [2022-03-15 20:16:57,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 8 remaining) [2022-03-15 20:16:57,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (5 of 8 remaining) [2022-03-15 20:16:57,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-03-15 20:16:57,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-03-15 20:16:57,081 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-03-15 20:16:57,081 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-03-15 20:16:57,081 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-03-15 20:16:57,082 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:57,084 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:16:57,084 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:16:57,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:16:57 BasicIcfg [2022-03-15 20:16:57,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:16:57,087 INFO L158 Benchmark]: Toolchain (without parser) took 873520.40ms. Allocated memory was 182.5MB in the beginning and 273.7MB in the end (delta: 91.2MB). Free memory was 127.6MB in the beginning and 148.5MB in the end (delta: -21.0MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.86ms. Allocated memory was 182.5MB in the beginning and 227.5MB in the end (delta: 45.1MB). Free memory was 127.3MB in the beginning and 189.4MB in the end (delta: -62.1MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.72ms. Allocated memory is still 227.5MB. Free memory was 189.0MB in the beginning and 186.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: Boogie Preprocessor took 19.86ms. Allocated memory is still 227.5MB. Free memory was 186.9MB in the beginning and 185.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: RCFGBuilder took 343.81ms. Allocated memory is still 227.5MB. Free memory was 185.2MB in the beginning and 169.1MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,087 INFO L158 Benchmark]: TraceAbstraction took 872711.78ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 168.4MB in the beginning and 148.5MB in the end (delta: 19.9MB). Peak memory consumption was 67.0MB. Max. memory is 8.0GB. [2022-03-15 20:16:57,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.86ms. Allocated memory was 182.5MB in the beginning and 227.5MB in the end (delta: 45.1MB). Free memory was 127.3MB in the beginning and 189.4MB in the end (delta: -62.1MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.72ms. Allocated memory is still 227.5MB. Free memory was 189.0MB in the beginning and 186.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.86ms. Allocated memory is still 227.5MB. Free memory was 186.9MB in the beginning and 185.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.81ms. Allocated memory is still 227.5MB. Free memory was 185.2MB in the beginning and 169.1MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 872711.78ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 168.4MB in the beginning and 148.5MB in the end (delta: 19.9MB). Peak memory consumption was 67.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 154 PlacesBefore, 41 PlacesAfterwards, 158 TransitionsBefore, 41 TransitionsAfterwards, 4890 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 139 TotalNumberOfCompositions, 10759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7086, positive: 6793, positive conditional: 0, positive unconditional: 6793, negative: 293, negative conditional: 0, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2970, positive: 2918, positive conditional: 0, positive unconditional: 2918, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7086, positive: 3875, positive conditional: 0, positive unconditional: 3875, negative: 241, negative conditional: 0, negative unconditional: 241, unknown: 2970, unknown conditional: 0, unknown unconditional: 2970] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 247, Positive conditional cache size: 0, Positive unconditional cache size: 247, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - 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: 749]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 763]: 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 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 764]: 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 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 226 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 872.6s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 101.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 56.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1163 mSDsluCounter, 1965 SdHoareTripleChecker+Invalid, 51.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 6005 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8901 IncrementalHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 238 mSDtfsCounter, 8901 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 888 SyntacticMatches, 45 SemanticMatches, 222 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 313.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=17, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1562 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 472.6s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 651 ConstructedInterpolants, 32 QuantifiedInterpolants, 39276 SizeOfPredicates, 141 NumberOfNonLiveVariables, 3980 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 8/290 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