/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/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:22:39,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:22:39,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:22:39,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:22:39,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:22:39,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:22:39,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:22:39,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:22:39,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:22:39,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:22:39,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:22:39,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:22:39,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:22:39,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:22:39,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:22:39,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:22:39,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:22:39,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:22:39,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:22:39,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:22:39,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:22:39,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:22:39,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:22:39,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:22:39,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:22:39,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:22:39,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:22:39,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:22:39,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:22:39,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:22:39,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:22:39,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:22:39,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:22:39,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:22:39,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:22:39,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:22:39,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:22:39,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:22:39,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:22:39,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:22:39,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:22:39,805 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 18:22:39,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:22:39,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:22:39,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:22:39,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:22:39,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:22:39,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:22:39,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:22:39,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:22:39,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:22:39,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:22:39,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:22:39,822 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 18:22:39,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:22:39,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:22:39,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:22:39,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:22:39,980 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:22:39,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-03-15 18:22:40,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026cb8792/f7ebb789b57b4da9bdf14209616dac02/FLAG660e04a5d [2022-03-15 18:22:40,405 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:22:40,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-03-15 18:22:40,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026cb8792/f7ebb789b57b4da9bdf14209616dac02/FLAG660e04a5d [2022-03-15 18:22:40,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026cb8792/f7ebb789b57b4da9bdf14209616dac02 [2022-03-15 18:22:40,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:22:40,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:22:40,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:22:40,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:22:40,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:22:40,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff0b87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40, skipping insertion in model container [2022-03-15 18:22:40,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:22:40,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:22:40,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-03-15 18:22:40,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:22:40,619 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:22:40,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-03-15 18:22:40,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:22:40,655 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:22:40,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40 WrapperNode [2022-03-15 18:22:40,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:22:40,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:22:40,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:22:40,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:22:40,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,695 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-03-15 18:22:40,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:22:40,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:22:40,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:22:40,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:22:40,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:22:40,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:22:40,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:22:40,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:22:40,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (1/1) ... [2022-03-15 18:22:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:22:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:22:40,767 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 18:22:40,782 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 18:22:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:22:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:22:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:22:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:22:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:22:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:22:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:22:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 18:22:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 18:22:40,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:22:40,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:22:40,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:22:40,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:22:40,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:22:40,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:22:40,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:22:40,802 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 18:22:40,860 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:22:40,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:22:41,077 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:22:41,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:22:41,084 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 18:22:41,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:22:41 BoogieIcfgContainer [2022-03-15 18:22:41,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:22:41,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:22:41,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:22:41,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:22:41,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:22:40" (1/3) ... [2022-03-15 18:22:41,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769eda6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:22:41, skipping insertion in model container [2022-03-15 18:22:41,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:40" (2/3) ... [2022-03-15 18:22:41,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769eda6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:22:41, skipping insertion in model container [2022-03-15 18:22:41,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:22:41" (3/3) ... [2022-03-15 18:22:41,092 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-03-15 18:22:41,095 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:22:41,096 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:22:41,096 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:22:41,096 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:22:41,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,126 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,126 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,127 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,127 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,132 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:41,147 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 18:22:41,175 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:22:41,186 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 18:22:41,186 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 18:22:41,202 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:22:41,210 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 129 transitions, 290 flow [2022-03-15 18:22:41,215 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 129 transitions, 290 flow [2022-03-15 18:22:41,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 129 transitions, 290 flow [2022-03-15 18:22:41,283 INFO L129 PetriNetUnfolder]: 10/125 cut-off events. [2022-03-15 18:22:41,284 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 18:22:41,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 10/125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-03-15 18:22:41,291 INFO L116 LiptonReduction]: Number of co-enabled transitions 1512 [2022-03-15 18:22:44,391 INFO L131 LiptonReduction]: Checked pairs total: 1824 [2022-03-15 18:22:44,392 INFO L133 LiptonReduction]: Total number of compositions: 109 [2022-03-15 18:22:44,397 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 92 flow [2022-03-15 18:22:44,417 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:22:44,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:44,426 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 18:22:44,427 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:22:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash 770150497, now seen corresponding path program 1 times [2022-03-15 18:22:44,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:44,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101948479] [2022-03-15 18:22:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:44,768 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 18:22:44,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:44,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101948479] [2022-03-15 18:22:44,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101948479] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:44,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:44,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 18:22:44,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397769003] [2022-03-15 18:22:44,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:44,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:44,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 208 transitions. [2022-03-15 18:22:44,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:46,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:22:46,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:22:46,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:46,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:22:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:22:46,797 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 18:22:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:46,871 INFO L93 Difference]: Finished difference Result 181 states and 677 transitions. [2022-03-15 18:22:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:22:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 18:22:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:46,879 INFO L225 Difference]: With dead ends: 181 [2022-03-15 18:22:46,879 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 18:22:46,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 63 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:22:46,882 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:46,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:22:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 18:22:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-03-15 18:22:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.7953216374269005) internal successors, (649), 171 states have internal predecessors, (649), 0 states have call successors, (0), 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 18:22:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 649 transitions. [2022-03-15 18:22:46,916 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 649 transitions. Word has length 21 [2022-03-15 18:22:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:46,917 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 649 transitions. [2022-03-15 18:22:46,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 18:22:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 649 transitions. [2022-03-15 18:22:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:22:46,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:46,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:46,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:22:46,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:22:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1119980428, now seen corresponding path program 1 times [2022-03-15 18:22:46,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:46,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225413148] [2022-03-15 18:22:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:47,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:47,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225413148] [2022-03-15 18:22:47,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225413148] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:47,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:47,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:22:47,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2133016389] [2022-03-15 18:22:47,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:47,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:47,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 294 transitions. [2022-03-15 18:22:47,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:48,577 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [851#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 852#(or (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))), 856#(or (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 853#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 854#(or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))), 855#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296))] [2022-03-15 18:22:48,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:22:48,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:22:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:22:48,579 INFO L87 Difference]: Start difference. First operand 172 states and 649 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 18:22:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:48,891 INFO L93 Difference]: Finished difference Result 286 states and 1077 transitions. [2022-03-15 18:22:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:22:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 22 [2022-03-15 18:22:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:48,894 INFO L225 Difference]: With dead ends: 286 [2022-03-15 18:22:48,894 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 18:22:48,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 17 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:22:48,895 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:48,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:22:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 18:22:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 224. [2022-03-15 18:22:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.937219730941704) internal successors, (878), 223 states have internal predecessors, (878), 0 states have call successors, (0), 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 18:22:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 878 transitions. [2022-03-15 18:22:48,919 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 878 transitions. Word has length 22 [2022-03-15 18:22:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:48,919 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 878 transitions. [2022-03-15 18:22:48,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 18:22:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 878 transitions. [2022-03-15 18:22:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:22:48,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:48,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:48,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:22:48,922 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:22:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1125605493, now seen corresponding path program 1 times [2022-03-15 18:22:48,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:48,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715698596] [2022-03-15 18:22:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:49,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:49,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715698596] [2022-03-15 18:22:49,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715698596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:22:49,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307544617] [2022-03-15 18:22:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:22:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:22:49,033 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 18:22:49,054 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 18:22:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:49,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 18:22:49,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:22:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:49,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:22:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:49,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307544617] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:22:49,300 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:22:49,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 18:22:49,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612217412] [2022-03-15 18:22:49,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:49,303 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:49,342 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 314 transitions. [2022-03-15 18:22:49,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:51,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1730#(< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)), 1733#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1736#(or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))), 1731#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 1737#(or (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))), 1729#(or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))), 1728#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 1732#(or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1734#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1735#(or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)))] [2022-03-15 18:22:51,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:22:51,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:22:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:22:51,338 INFO L87 Difference]: Start difference. First operand 224 states and 878 transitions. Second operand has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 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 18:22:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:52,729 INFO L93 Difference]: Finished difference Result 592 states and 2290 transitions. [2022-03-15 18:22:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:22:52,730 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 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 22 [2022-03-15 18:22:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:52,735 INFO L225 Difference]: With dead ends: 592 [2022-03-15 18:22:52,735 INFO L226 Difference]: Without dead ends: 592 [2022-03-15 18:22:52,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 119 SyntacticMatches, 16 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:22:52,737 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:52,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 18:22:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-03-15 18:22:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 370. [2022-03-15 18:22:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 4.195121951219512) internal successors, (1548), 369 states have internal predecessors, (1548), 0 states have call successors, (0), 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 18:22:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1548 transitions. [2022-03-15 18:22:52,766 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1548 transitions. Word has length 22 [2022-03-15 18:22:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:52,767 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 1548 transitions. [2022-03-15 18:22:52,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 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 18:22:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1548 transitions. [2022-03-15 18:22:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:22:52,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:52,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:52,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 18:22:52,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:22:52,975 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:22:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1053219724, now seen corresponding path program 1 times [2022-03-15 18:22:52,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:52,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032911379] [2022-03-15 18:22:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:53,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:53,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032911379] [2022-03-15 18:22:53,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032911379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:53,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:53,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:22:53,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429695729] [2022-03-15 18:22:53,088 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:53,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:53,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 314 transitions. [2022-03-15 18:22:53,107 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:56,194 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [3096#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 3102#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))), 3103#(<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)), 3099#(and (or (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))), 3092#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 3100#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))))), 3101#(and (or (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)))), 3091#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 3090#(< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)), 3095#(or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 3097#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))) (or (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)))), 3093#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 3104#(or (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 3094#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 3098#(and (or (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:22:56,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:22:56,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:22:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:22:56,195 INFO L87 Difference]: Start difference. First operand 370 states and 1548 transitions. Second operand has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 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 18:22:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:57,138 INFO L93 Difference]: Finished difference Result 696 states and 2760 transitions. [2022-03-15 18:22:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:22:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 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 22 [2022-03-15 18:22:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:57,143 INFO L225 Difference]: With dead ends: 696 [2022-03-15 18:22:57,143 INFO L226 Difference]: Without dead ends: 674 [2022-03-15 18:22:57,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:22:57,144 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 391 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:57,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:22:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-03-15 18:22:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 418. [2022-03-15 18:22:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 4.206235011990407) internal successors, (1754), 417 states have internal predecessors, (1754), 0 states have call successors, (0), 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 18:22:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1754 transitions. [2022-03-15 18:22:57,169 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1754 transitions. Word has length 22 [2022-03-15 18:22:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:57,169 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1754 transitions. [2022-03-15 18:22:57,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 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 18:22:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1754 transitions. [2022-03-15 18:22:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:22:57,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:57,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:57,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:22:57,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:22:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1917868428, now seen corresponding path program 1 times [2022-03-15 18:22:57,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:57,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223071202] [2022-03-15 18:22:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:57,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:22:57,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:57,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223071202] [2022-03-15 18:22:57,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223071202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:22:57,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865712391] [2022-03-15 18:22:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:22:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:22:57,254 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 18:22:57,255 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 18:22:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:57,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 18:22:57,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:22:57,449 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 18:25:37,503 WARN L228 SmtUtils]: Spent 2.48m on a formula simplification. DAG size of input: 14617 DAG size of output: 7130 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 18:27:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:27:41,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:27:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:27:41,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865712391] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:27:41,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:27:41,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 18:27:41,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476925856] [2022-03-15 18:27:41,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:27:41,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:27:41,730 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 294 transitions. [2022-03-15 18:27:41,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:27:45,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [4803#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4789#(or (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4802#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))))), 4804#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))), 4801#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)))), 4790#(< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)), 4791#(or (< (mod (* ~x4~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), 4793#(or (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)) (< (mod (* ~x4~0 4) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4794#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0))), 4796#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 4788#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 4800#(or (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x4~0 4) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4792#(or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4798#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4806#(or (<= (mod ~n~0 4294967296) (mod ~x4~0 4294967296)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x4~0 4) 4294967296) (mod ~n~0 4294967296))), 4805#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 4795#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 4799#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 4797#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x4~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:27:45,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:27:45,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:27:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:27:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:27:45,017 INFO L87 Difference]: Start difference. First operand 418 states and 1754 transitions. Second operand has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 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 18:27:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:27:47,430 INFO L93 Difference]: Finished difference Result 884 states and 3574 transitions. [2022-03-15 18:27:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:27:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 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 22 [2022-03-15 18:27:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:27:47,436 INFO L225 Difference]: With dead ends: 884 [2022-03-15 18:27:47,436 INFO L226 Difference]: Without dead ends: 884 [2022-03-15 18:27:47,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:27:47,437 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 457 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:27:47,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 0 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 18:27:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-03-15 18:27:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 534. [2022-03-15 18:27:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 4.328330206378987) internal successors, (2307), 533 states have internal predecessors, (2307), 0 states have call successors, (0), 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 18:27:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 2307 transitions. [2022-03-15 18:27:47,453 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 2307 transitions. Word has length 22 [2022-03-15 18:27:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:27:47,453 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 2307 transitions. [2022-03-15 18:27:47,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 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 18:27:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 2307 transitions. [2022-03-15 18:27:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:27:47,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:27:47,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:27:47,483 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 18:27:47,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:27:47,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:27:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:27:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -914568534, now seen corresponding path program 1 times [2022-03-15 18:27:47,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:27:47,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77649734] [2022-03-15 18:27:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:27:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:27:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:27:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:27:47,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:27:47,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77649734] [2022-03-15 18:27:47,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77649734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:27:47,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371270471] [2022-03-15 18:27:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:27:47,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:27:47,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:27:47,924 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 18:27:47,929 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 18:27:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:27:48,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:27:48,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:28:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:28:01,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:28:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:28:13,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371270471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:28:13,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:28:13,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-03-15 18:28:13,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616332740] [2022-03-15 18:28:13,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:28:13,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:28:13,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 448 transitions. [2022-03-15 18:28:13,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:31:49,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [6939#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))))), 6933#(and (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1)))), 6941#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 6943#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* ~x1~0 4) (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) (* ~x2~0 4)))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) (* ~x2~0 4)) (+ (* ~x1~0 4) (* (div (* ~x2~0 4) 4294967296) 4294967296) 1))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 6935#(and (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)))), 6947#(and (or (<= (+ (* 4294967296 (div (+ (* ~x1~0 4) 4294967295 (* ~x2~0 (- 4)) (* 17179869184 (div ~x2~0 4294967296))) 4294967296)) 2 (* ~x2~0 4) (* (div ~n~0 4294967296) 4294967296)) (+ (* ~x1~0 4) ~n~0 (* 17179869184 (div ~x2~0 4294967296)))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (<= (+ (* ~x2~0 4) (* (div (+ (* (- 1) ~n~0) (* ~x1~0 4) (* ~x2~0 (- 4)) 4294967297 (* 17179869184 (div ~x2~0 4294967296)) (* (div ~n~0 4294967296) 4294967296)) 4294967296) 4294967296)) (+ (* ~x1~0 4) (* 17179869184 (div ~x2~0 4294967296)))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 6940#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4)) (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296) 1)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), 6929#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1)))), 6911#(or (and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 6930#(and (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1)))), 6932#(and (or (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 6937#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1)))), 6934#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4)) (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296) 1)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)))), 6938#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4)) (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296) 1)))), 6946#(and (or (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0 (* (div ~n~0 4294967296) 4294967296) 4294967298) (+ (* ~x1~0 4) ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (<= (+ (* ~x1~0 4) 6 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~n~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1)))), 6944#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* ~x1~0 4) (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) (* ~x2~0 4)))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) (* ~x2~0 4)) (+ (* ~x1~0 4) (* (div (* ~x2~0 4) 4294967296) 4294967296) 1)))), 6942#(and (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 6931#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))))), 6945#(and (or (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (<= (+ (* ~x1~0 4) 6 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~n~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296) 1))) (or (<= (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 6936#(and (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))) (or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div ~x1~0 4294967296) 4294967296) (* ~x2~0 4)) (+ ~x1~0 (* (div (* ~x2~0 4) 4294967296) 4294967296) 1)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x2~0 4) 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:31:49,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 18:31:49,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:31:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 18:31:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=816, Unknown=19, NotChecked=0, Total=1056 [2022-03-15 18:31:49,885 INFO L87 Difference]: Start difference. First operand 534 states and 2307 transitions. Second operand has 27 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 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 18:31:52,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:58,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_~x1~0 4294967296)) (.cse13 (div c_~x2~0 4294967296)) (.cse10 (* c_~x1~0 4))) (let ((.cse15 (* c_~x2~0 4)) (.cse18 (mod c_~n~0 4294967296)) (.cse16 (* (div .cse10 4294967296) 4294967296)) (.cse11 (* .cse13 4294967296)) (.cse17 (* 4294967296 .cse14)) (.cse8 (div c_~x3~0 4294967296)) (.cse9 (* (div c_~x4~0 4294967296) 4294967296))) (let ((.cse4 (= (+ c_~x3~0 (* (- 4294967296) .cse8) (* (- 1) c_~x4~0) .cse9) 0)) (.cse1 (+ .cse17 c_~x2~0)) (.cse0 (+ c_~x1~0 .cse11)) (.cse12 (+ .cse16 c_~x2~0)) (.cse7 (not (< (mod c_~x1~0 4294967296) .cse18))) (.cse2 (< (mod .cse15 4294967296) .cse18)) (.cse3 (not (< (mod c_~x2~0 4294967296) .cse18))) (.cse6 (* (div .cse15 4294967296) 4294967296)) (.cse5 (+ .cse15 .cse17))) (and (<= .cse0 .cse1) (or .cse2 .cse3 .cse4) (or (< .cse5 (+ .cse6 c_~x1~0 1)) .cse2 .cse3) (or .cse7 .cse4) (= (+ (* 4294967296 .cse8) c_~x4~0) (+ c_~x3~0 .cse9)) (<= .cse1 .cse0) (or (<= (+ .cse10 .cse11) .cse12) .cse7) (<= (+ (* c_~x1~0 3) (* 17179869184 .cse13) 1) (+ (* .cse14 12884901888) .cse15)) (or (< .cse12 (+ .cse10 .cse11 1)) .cse7 (<= (+ .cse10 (* 4294967296 (div c_~n~0 4294967296)) 6) (+ .cse16 c_~n~0))) (or .cse2 .cse3 (<= (+ .cse6 c_~x1~0) .cse5)))))) is different from false [2022-03-15 18:32:56,543 WARN L228 SmtUtils]: Spent 54.62s on a formula simplification. DAG size of input: 101 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:33:01,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:12,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:16,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:22,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:42,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:50,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:52,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:54,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:06,613 WARN L228 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 104 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:34:15,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:17,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:19,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:22,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:24,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:41,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:52,806 WARN L228 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 72 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:35:02,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:08,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:11,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:19,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:26,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:38,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:40,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:53,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:01,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:06,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:18,283 WARN L228 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:36:28,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:55,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:37:06,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-03-15 18:37:11,610 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 18:37:11,611 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 18:37:12,618 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 18:37:12,811 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-15 18:37:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 18:37:12,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-03-15 18:37:12,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 145 SyntacticMatches, 31 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 381.9s TimeCoverageRelationStatistics Valid=928, Invalid=3862, Unknown=44, NotChecked=136, Total=4970 [2022-03-15 18:37:12,820 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 150 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 82.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:37:12,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 692 Invalid, 20 Unknown, 10 Unchecked, 82.6s Time] [2022-03-15 18:37:12,821 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 18:37:12,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 18:37:12,821 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. [2022-03-15 18:37:12,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 18:37:12,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 18:37:12,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 18:37:12,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 18:37:12,824 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-03-15 18:37:12,826 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:37:12,826 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:37:12,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:37:12 BasicIcfg [2022-03-15 18:37:12,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:37:12,828 INFO L158 Benchmark]: Toolchain (without parser) took 872408.14ms. Allocated memory was 220.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 169.7MB in the beginning and 972.7MB in the end (delta: -803.0MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory was 186.0MB in the beginning and 185.9MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.17ms. Allocated memory is still 220.2MB. Free memory was 169.5MB in the beginning and 194.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.54ms. Allocated memory is still 220.2MB. Free memory was 194.2MB in the beginning and 192.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 220.2MB. Free memory was 192.4MB in the beginning and 191.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: RCFGBuilder took 351.22ms. Allocated memory is still 220.2MB. Free memory was 191.1MB in the beginning and 177.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,829 INFO L158 Benchmark]: TraceAbstraction took 871741.67ms. Allocated memory was 220.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 177.2MB in the beginning and 972.7MB in the end (delta: -795.5MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:12,831 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.10ms. Allocated memory is still 220.2MB. Free memory was 186.0MB in the beginning and 185.9MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.17ms. Allocated memory is still 220.2MB. Free memory was 169.5MB in the beginning and 194.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.54ms. Allocated memory is still 220.2MB. Free memory was 194.2MB in the beginning and 192.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 220.2MB. Free memory was 192.4MB in the beginning and 191.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.22ms. Allocated memory is still 220.2MB. Free memory was 191.1MB in the beginning and 177.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 871741.67ms. Allocated memory was 220.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 177.2MB in the beginning and 972.7MB in the end (delta: -795.5MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 132 PlacesBefore, 39 PlacesAfterwards, 129 TransitionsBefore, 30 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 109 TotalNumberOfCompositions, 1824 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1824, positive: 1824, positive conditional: 0, positive unconditional: 1824, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 824, positive: 824, positive conditional: 0, positive unconditional: 824, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1824, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 824, unknown conditional: 0, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 148 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 871.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 328.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1394 SdHoareTripleChecker+Valid, 87.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1394 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 85.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 1884 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4349 IncrementalHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 0 mSDtfsCounter, 4349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 542 SyntacticMatches, 144 SemanticMatches, 165 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 384.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=5, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 888 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 309.8s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 6724 SizeOfPredicates, 16 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 3/14 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