/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-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:22:22,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:22:22,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:22:22,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:22:22,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:22:22,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:22:22,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:22:22,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:22:22,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:22:22,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:22:22,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:22:22,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:22:22,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:22:22,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:22:22,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:22:22,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:22:22,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:22:22,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:22:23,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:22:23,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:22:23,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:22:23,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:22:23,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:22:23,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:22:23,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:22:23,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:22:23,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:22:23,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:22:23,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:22:23,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:22:23,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:22:23,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:22:23,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:22:23,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:22:23,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:22:23,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:22:23,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:22:23,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:22:23,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:22:23,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:22:23,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:22:23,037 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:23,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:22:23,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:22:23,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:22:23,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:22:23,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:22:23,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:22:23,075 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:22:23,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:22:23,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:22:23,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:22:23,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:22:23,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:22:23,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:22:23,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:22:23,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:22:23,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:22:23,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:22:23,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:22:23,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:22:23,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:22:23,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:22:23,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:22:23,080 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:22:23,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:22:23,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:22:23,080 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:23,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:22:23,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:22:23,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:22:23,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:22:23,323 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:22:23,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-03-15 18:22:23,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fba77f0/270cdad6295b49d0ac0243592a73e6e5/FLAGa25e21722 [2022-03-15 18:22:23,729 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:22:23,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-03-15 18:22:23,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fba77f0/270cdad6295b49d0ac0243592a73e6e5/FLAGa25e21722 [2022-03-15 18:22:24,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fba77f0/270cdad6295b49d0ac0243592a73e6e5 [2022-03-15 18:22:24,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:22:24,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:22:24,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:22:24,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:22:24,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:22:24,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:22:24" (1/1) ... [2022-03-15 18:22:24,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3255300f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:24, skipping insertion in model container [2022-03-15 18:22:24,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:22:24" (1/1) ... [2022-03-15 18:22:24,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:22:24,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:22:24,321 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-exp1x3.wvr.c[1849,1862] [2022-03-15 18:22:24,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:22:24,330 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:22:24,347 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-exp1x3.wvr.c[1849,1862] [2022-03-15 18:22:24,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:22:24,359 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:22:24,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:24 WrapperNode [2022-03-15 18:22:24,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:22:24,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:22:24,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:22:24,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:22:24,367 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:24" (1/1) ... [2022-03-15 18:22:24,373 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:24" (1/1) ... [2022-03-15 18:22:24,388 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-03-15 18:22:24,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:22:24,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:22:24,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:22:24,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:22:24,396 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:24" (1/1) ... [2022-03-15 18:22:24,396 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:24" (1/1) ... [2022-03-15 18:22:24,398 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:24" (1/1) ... [2022-03-15 18:22:24,398 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:24" (1/1) ... [2022-03-15 18:22:24,402 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:24" (1/1) ... [2022-03-15 18:22:24,405 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:24" (1/1) ... [2022-03-15 18:22:24,406 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:24" (1/1) ... [2022-03-15 18:22:24,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:22:24,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:22:24,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:22:24,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:22:24,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:24" (1/1) ... [2022-03-15 18:22:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:22:24,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:22:24,445 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:24,467 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:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:22:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:22:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:22:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:22:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:22:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:22:24,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:22:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:22:24,495 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:24,580 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:22:24,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:22:24,710 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:22:24,716 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:22:24,717 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 18:22:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:22:24 BoogieIcfgContainer [2022-03-15 18:22:24,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:22:24,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:22:24,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:22:24,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:22:24,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:22:24" (1/3) ... [2022-03-15 18:22:24,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481214f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:22:24, skipping insertion in model container [2022-03-15 18:22:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:22:24" (2/3) ... [2022-03-15 18:22:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481214f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:22:24, skipping insertion in model container [2022-03-15 18:22:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:22:24" (3/3) ... [2022-03-15 18:22:24,726 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2022-03-15 18:22:24,731 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:22:24,731 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:22:24,731 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:22:24,731 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:22:24,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:22:24,788 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 18:22:24,857 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:22:24,864 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:24,864 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 18:22:24,876 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:22:24,885 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 81 transitions, 178 flow [2022-03-15 18:22:24,887 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 81 transitions, 178 flow [2022-03-15 18:22:24,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2022-03-15 18:22:24,924 INFO L129 PetriNetUnfolder]: 6/79 cut-off events. [2022-03-15 18:22:24,924 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 18:22:24,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 6/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-03-15 18:22:24,929 INFO L116 LiptonReduction]: Number of co-enabled transitions 252 [2022-03-15 18:22:27,010 INFO L131 LiptonReduction]: Checked pairs total: 298 [2022-03-15 18:22:27,011 INFO L133 LiptonReduction]: Total number of compositions: 75 [2022-03-15 18:22:27,021 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 16 transitions, 48 flow [2022-03-15 18:22:27,033 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 18:22:27,040 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:27,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:27,041 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:22:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 494960174, now seen corresponding path program 1 times [2022-03-15 18:22:27,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:27,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903861029] [2022-03-15 18:22:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:27,299 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:27,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:27,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903861029] [2022-03-15 18:22:27,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903861029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:27,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:27,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 18:22:27,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214988132] [2022-03-15 18:22:27,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:27,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:27,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2022-03-15 18:22:27,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:27,712 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:22:27,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:22:27,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:22:27,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:22:27,732 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:27,763 INFO L93 Difference]: Finished difference Result 37 states and 77 transitions. [2022-03-15 18:22:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:22:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 18:22:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:27,772 INFO L225 Difference]: With dead ends: 37 [2022-03-15 18:22:27,772 INFO L226 Difference]: Without dead ends: 32 [2022-03-15 18:22:27,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:22:27,779 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:27,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:22:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-15 18:22:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-15 18:22:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 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:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 67 transitions. [2022-03-15 18:22:27,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 67 transitions. Word has length 11 [2022-03-15 18:22:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:27,808 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 67 transitions. [2022-03-15 18:22:27,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2022-03-15 18:22:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 18:22:27,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:27,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:27,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:22:27,810 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:22:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1272955449, now seen corresponding path program 1 times [2022-03-15 18:22:27,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:27,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61820357] [2022-03-15 18:22:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:27,914 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:27,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:27,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61820357] [2022-03-15 18:22:27,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61820357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:27,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:27,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:22:27,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014755047] [2022-03-15 18:22:27,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:27,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:27,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 40 transitions. [2022-03-15 18:22:27,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:28,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [233#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 234#(and (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)) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))))] [2022-03-15 18:22:28,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:22:28,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:22:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:22:28,162 INFO L87 Difference]: Start difference. First operand 32 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:28,254 INFO L93 Difference]: Finished difference Result 36 states and 71 transitions. [2022-03-15 18:22:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:22:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 18:22:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:28,255 INFO L225 Difference]: With dead ends: 36 [2022-03-15 18:22:28,255 INFO L226 Difference]: Without dead ends: 28 [2022-03-15 18:22:28,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:22:28,257 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:28,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:22:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-15 18:22:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-15 18:22:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 59 transitions. [2022-03-15 18:22:28,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 59 transitions. Word has length 12 [2022-03-15 18:22:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:28,263 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 59 transitions. [2022-03-15 18:22:28,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 59 transitions. [2022-03-15 18:22:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 18:22:28,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:28,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:28,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:22:28,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:22:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 116692302, now seen corresponding path program 1 times [2022-03-15 18:22:28,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:28,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773049871] [2022-03-15 18:22:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:28,370 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:28,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:28,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773049871] [2022-03-15 18:22:28,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773049871] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:22:28,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:22:28,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:22:28,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137707836] [2022-03-15 18:22:28,371 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:28,372 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:28,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 40 transitions. [2022-03-15 18:22:28,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:22:28,586 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [334#(<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)), 332#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 335#(or (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 331#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 333#(or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:22:28,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:22:28,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:22:28,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:22:28,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:22:28,588 INFO L87 Difference]: Start difference. First operand 28 states and 59 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:22:28,722 INFO L93 Difference]: Finished difference Result 34 states and 73 transitions. [2022-03-15 18:22:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:22:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 18:22:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:22:28,724 INFO L225 Difference]: With dead ends: 34 [2022-03-15 18:22:28,724 INFO L226 Difference]: Without dead ends: 34 [2022-03-15 18:22:28,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:22:28,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:22:28,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:22:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-15 18:22:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-15 18:22:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 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:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 73 transitions. [2022-03-15 18:22:28,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 73 transitions. Word has length 12 [2022-03-15 18:22:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:22:28,732 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 73 transitions. [2022-03-15 18:22:28,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:22:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 73 transitions. [2022-03-15 18:22:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 18:22:28,733 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:22:28,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:22:28,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:22:28,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:22:28,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:22:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash -132791619, now seen corresponding path program 1 times [2022-03-15 18:22:28,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:22:28,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405680992] [2022-03-15 18:22:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:22:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:29,015 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:22:29,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:22:29,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405680992] [2022-03-15 18:22:29,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405680992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:22:29,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679367363] [2022-03-15 18:22:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:22:29,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:22:29,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:22:29,018 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:29,046 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:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:22:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 18:22:29,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:22:40,180 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:22:40,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:22:49,100 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:22:49,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679367363] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:22:49,101 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:22:49,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 18:22:49,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039642954] [2022-03-15 18:22:49,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:22:49,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:22:49,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2022-03-15 18:22:49,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:00,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [529#(and (or (< (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296))) (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296) 1)) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)))))), 530#(and (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)))) (<= (+ 3 ~x2~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296))) (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296) 1)) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 528#(and (or (< (mod ~x1~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)) (<= (+ 3 ~x2~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))), 527#(and (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)))), 532#(and (or (<= (* 2 ~x2~0) (+ (* 2 ~x1~0) (* (div (+ (- 1) (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0 (* (div (+ (- 1) (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0 (* (- 4294967296) (div (* 2 ~x1~0) 4294967296))) 2147483648) 2147483648)) 4294967296) 4294967296) (* 8589934592 (div ~x2~0 4294967296)))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (<= (+ (* 2 ~x2~0) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~x2~0) (* (- 2) ~x1~0) (* (- 8589934592) (div ~x2~0 4294967296))) 4294967296) 4294967296) ~n~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)) (* 8589934592 (div ~x2~0 4294967296)) 4294967293)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 531#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 2 ~x2~0) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0) (* (- 8589934592) (div ~x2~0 4294967296))) 4294967296) 4294967296) (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* 8589934592 (div ~x2~0 4294967296)) 4294967293))) (or (<= (* 2 ~x2~0) (+ (* (div (+ (* 2147483648 (div (+ (- 1) (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0 (* (div ~x1~0 4294967296) (- 4294967296))) 2147483648)) (- 1) (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) 4294967296) 4294967296) ~x1~0 (* 8589934592 (div ~x2~0 4294967296)))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:23:00,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:23:00,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:23:00,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=319, Unknown=7, NotChecked=0, Total=420 [2022-03-15 18:23:00,383 INFO L87 Difference]: Start difference. First operand 34 states and 73 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:23:50,186 WARN L228 SmtUtils]: Spent 47.03s on a formula simplification. DAG size of input: 85 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:23:56,078 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:24:03,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:24:10,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:24:16,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:24:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:24:22,168 INFO L93 Difference]: Finished difference Result 94 states and 210 transitions. [2022-03-15 18:24:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:24:22,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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 13 [2022-03-15 18:24:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:24:22,174 INFO L225 Difference]: With dead ends: 94 [2022-03-15 18:24:22,174 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 18:24:22,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 97.9s TimeCoverageRelationStatistics Valid=200, Invalid=659, Unknown=11, NotChecked=0, Total=870 [2022-03-15 18:24:22,176 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:24:22,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2022-03-15 18:24:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 18:24:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2022-03-15 18:24:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.490566037735849) internal successors, (132), 53 states have internal predecessors, (132), 0 states have call successors, (0), 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:24:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 132 transitions. [2022-03-15 18:24:22,182 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 132 transitions. Word has length 13 [2022-03-15 18:24:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:24:22,182 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 132 transitions. [2022-03-15 18:24:22,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:24:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 132 transitions. [2022-03-15 18:24:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 18:24:22,190 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:24:22,190 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:24:22,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 18:24:22,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:24:22,391 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:24:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:24:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 177927380, now seen corresponding path program 2 times [2022-03-15 18:24:22,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:24:22,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485675480] [2022-03-15 18:24:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:24:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:24:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:24:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:24:22,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:24:22,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485675480] [2022-03-15 18:24:22,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485675480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:24:22,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139918882] [2022-03-15 18:24:22,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:24:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:24:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:24:22,546 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:24:22,547 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:24:56,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:24:56,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:24:56,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:24:56,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:25:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:25:01,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:25:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:25:31,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139918882] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:25:31,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:25:31,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2022-03-15 18:25:31,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353366669] [2022-03-15 18:25:31,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:25:31,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:25:31,487 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 74 transitions. [2022-03-15 18:25:31,487 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:25:34,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [847#(or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), 850#(or (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))), 851#(or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= ~x2~0 (+ 2147483647 (* 2147483648 (div (* 2 ~x1~0) 4294967296)) (* 2147483648 (div (+ (* (- 1) ~n~0) (* 2 ~x2~0) (* (- 4294967296) (div (* 2 ~x1~0) 4294967296)) (* (- 8589934592) (div ~x2~0 4294967296)) (* (div ~n~0 4294967296) 4294967296)) 4294967296)) (* (div ~x2~0 4294967296) 4294967296)))), 849#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= ~x2~0 (+ 2147483647 (* (div ~x1~0 4294967296) 2147483648) (* (div (+ (* (- 1) ~n~0) (* 2 ~x2~0) (* (div ~x1~0 4294967296) (- 4294967296)) (* (- 8589934592) (div ~x2~0 4294967296)) (* (div ~n~0 4294967296) 4294967296)) 4294967296) 2147483648) (* (div ~x2~0 4294967296) 4294967296)))), 848#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 846#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))] [2022-03-15 18:25:34,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:25:34,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:25:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:25:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=326, Unknown=3, NotChecked=0, Total=420 [2022-03-15 18:25:34,030 INFO L87 Difference]: Start difference. First operand 54 states and 132 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 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:25:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:25:40,429 INFO L93 Difference]: Finished difference Result 98 states and 218 transitions. [2022-03-15 18:25:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:25:40,429 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 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 14 [2022-03-15 18:25:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:25:40,430 INFO L225 Difference]: With dead ends: 98 [2022-03-15 18:25:40,430 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 18:25:40,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=229, Invalid=823, Unknown=4, NotChecked=0, Total=1056 [2022-03-15 18:25:40,432 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:25:40,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 18:25:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 18:25:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2022-03-15 18:25:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.491228070175439) internal successors, (142), 57 states have internal predecessors, (142), 0 states have call successors, (0), 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:25:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 142 transitions. [2022-03-15 18:25:40,438 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 142 transitions. Word has length 14 [2022-03-15 18:25:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:25:40,439 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 142 transitions. [2022-03-15 18:25:40,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 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:25:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 142 transitions. [2022-03-15 18:25:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 18:25:40,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:25:40,440 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:25:40,455 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:25:40,648 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:25:40,648 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:25:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:25:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -905435671, now seen corresponding path program 3 times [2022-03-15 18:25:40,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:25:40,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673486652] [2022-03-15 18:25:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:25:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:25:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:25:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:25:40,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:25:40,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673486652] [2022-03-15 18:25:40,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673486652] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:25:40,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564640649] [2022-03-15 18:25:40,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:25:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:25:40,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:25:40,863 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:25:40,864 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:25:41,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 18:25:41,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:25:41,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 18:25:41,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:25:41,413 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 18:25:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:25:44,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:25:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:25:45,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564640649] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:25:45,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:25:45,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-03-15 18:25:45,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372675919] [2022-03-15 18:25:45,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:25:45,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:25:45,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 74 transitions. [2022-03-15 18:25:45,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:25:50,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1189#(or (<= (mod ~n~0 4294967296) (mod (* 2 ~x1~0) 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))), 1182#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 1185#(or (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1188#(or (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))), 1186#(or (<= (+ (* 2 ~x2~0) (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 8589934592 (div ~x2~0 4294967296)) (* (div (+ (- 1) (* 3 ~x2~0) (* (div ~x2~0 4294967296) (- 12884901888))) 8589934592) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), 1183#(or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), 1190#(or (<= (+ (* 2 ~x2~0) (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 8589934592 (div ~x2~0 4294967296)) (* (div (+ (- 1) (* 3 ~x2~0) (* (div ~x2~0 4294967296) (- 12884901888))) 8589934592) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))), 1184#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1187#(or (<= (+ (* 2 ~x2~0) (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 8589934592 (div ~x2~0 4294967296)) (* (div (+ (- 1) (* 3 ~x2~0) (* (div ~x2~0 4294967296) (- 12884901888))) 8589934592) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:25:50,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:25:50,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:25:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:25:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=428, Unknown=1, NotChecked=0, Total=506 [2022-03-15 18:25:50,969 INFO L87 Difference]: Start difference. First operand 58 states and 142 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 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:25:53,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:25:56,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:25:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:25:59,379 INFO L93 Difference]: Finished difference Result 94 states and 224 transitions. [2022-03-15 18:25:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:25:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 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 14 [2022-03-15 18:25:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:25:59,381 INFO L225 Difference]: With dead ends: 94 [2022-03-15 18:25:59,381 INFO L226 Difference]: Without dead ends: 94 [2022-03-15 18:25:59,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=179, Invalid=876, Unknown=1, NotChecked=0, Total=1056 [2022-03-15 18:25:59,383 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:25:59,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 283 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-03-15 18:25:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-15 18:25:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2022-03-15 18:25:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.5324675324675323) internal successors, (195), 77 states have internal predecessors, (195), 0 states have call successors, (0), 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:25:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 195 transitions. [2022-03-15 18:25:59,391 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 195 transitions. Word has length 14 [2022-03-15 18:25:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:25:59,391 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 195 transitions. [2022-03-15 18:25:59,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 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:25:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 195 transitions. [2022-03-15 18:25:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 18:25:59,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:25:59,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:25:59,403 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:25:59,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:25:59,598 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:25:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:25:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1995765544, now seen corresponding path program 4 times [2022-03-15 18:25:59,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:25:59,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039987815] [2022-03-15 18:25:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:25:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:25:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:26:22,646 WARN L228 SmtUtils]: Spent 10.58s on a formula simplification. DAG size of input: 87 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:26:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:26:27,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:26:27,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039987815] [2022-03-15 18:26:27,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039987815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:26:27,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890007614] [2022-03-15 18:26:27,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:26:27,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:26:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:26:27,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:26:27,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 18:28:09,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:28:09,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:28:09,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:28:09,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:28:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:28:37,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:29:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:29:17,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890007614] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:29:17,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:29:17,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 18:29:17,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611558449] [2022-03-15 18:29:17,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:29:17,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:29:17,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 96 transitions. [2022-03-15 18:29:17,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:30:21,781 WARN L228 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 73 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:31:25,253 WARN L228 SmtUtils]: Spent 11.23s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:32:24,167 WARN L228 SmtUtils]: Spent 13.57s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:33:54,541 WARN L228 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 27 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 18:35:04,266 WARN L228 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 28 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 18:36:03,779 WARN L228 SmtUtils]: Spent 27.22s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:36:03,781 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [1572#(and (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))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (<= (+ 2147483651 ~x2~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 1577#(and (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* (div (+ (* (- 2) ~x1~0) 4294967295 (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296) 4294967296) ~n~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)) (* 17179869184 (div ~x2~0 4294967296))) (+ (* ~x2~0 4) (* (div ~n~0 4294967296) 4294967296)))) (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (* ~x2~0 4) (+ (* 2 ~x1~0) (* (div (+ (- 1) (* 3 ~x2~0) (* (div ~x2~0 4294967296) (- 12884901888)) (* (- 4294967296) (div (* 2 ~x1~0) 4294967296))) 4294967296) 4294967296) (* 17179869184 (div ~x2~0 4294967296))))) (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div ~n~0 4294967296) 4294967296) (* 5 ~x2~0)) (+ (* (div ~x2~0 4294967296) 21474836480) 4294967291 ~n~0 (* (div (+ (* (- 2) ~x1~0) (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296) 4294967296) (* 4294967296 (div (* 2 ~x1~0) 4294967296)))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 1571#(and (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))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~x2~0) (+ (* ~x1~0 4) (* (div ~x2~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 1565#(and (or (< (mod ~x1~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)) (<= (+ 2147483651 ~x2~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))), 1568#(and (or (<= (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296))) (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)))))), 1573#(and (or (<= (+ (* ~x1~0 4) (* (div (+ 2147483649 (* (- 4294967296) (div (* ~x1~0 4) 4294967296)) ~x2~0 (* (div ~x2~0 4294967296) 4294967296)) 4294967296) 4294967296)) (* 2 ~x2~0)) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* 8589934592 (div (* ~x1~0 4) 4294967296)) 4294967286 (* 8589934592 (div (+ (* ~x1~0 (- 4)) (* 2 ~x2~0)) 4294967296)) (* (div ~x2~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~n~0 (* (div (+ (* ~x1~0 (- 4)) (* 2 ~x2~0) 4294967295) 4294967296) 4294967296) (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (<= (* 2 ~x2~0) (+ (* ~x1~0 4) (* (div (+ (* 3 ~x2~0) (* (- 8589934592) (div (* ~x1~0 4) 4294967296)) (- 4294967298) (* (div ~x2~0 4294967296) 4294967296)) 8589934592) 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 1564#(and (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))))), 1576#(and (or (<= (+ (* 2 ~x1~0) (* (div (+ 2147483649 ~x2~0 (* (- 4294967296) (div (* 2 ~x1~0) 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 4294967296) 4294967296)) (* 2 ~x2~0)) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* 8589934592 (div (* 2 ~x1~0) 4294967296)) (* 8589934592 (div (+ (* 2 ~x2~0) (* (- 2) ~x1~0)) 4294967296)) 4294967286 (* (div ~x2~0 4294967296) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0)) (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~n~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)) (* (div (+ (* 2 ~x2~0) (* (- 2) ~x1~0) 4294967295) 4294967296) 4294967296) (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0))), 1578#(and (or (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~n~0 (* (div (+ (* ~x1~0 (- 4)) (* 2 ~x2~0) 4294967295) 4294967296) 4294967296) (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* ~x1~0 4) (* (div (+ 2147483649 (* (- 4294967296) (div (* ~x1~0 4) 4294967296)) ~x2~0 (* (div ~x2~0 4294967296) 4294967296)) 4294967296) 4294967296)) (* 2 ~x2~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)))), 1566#(and (or (<= (+ ~x1~0 (* 4294967296 (div (+ 2147483649 ~x2~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 4294967296))) (* 2 ~x2~0)) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0)) 4294967296) 8589934592) 4294967286 (* (div ~x1~0 4294967296) 8589934592) (* (div ~x2~0 4294967296) 4294967296)))) (or (<= (* 2 ~x2~0) (+ ~x1~0 (* (div (+ (* 3 ~x2~0) (- 4294967298) (* (div ~x2~0 4294967296) 4294967296) (* (- 8589934592) (div ~x1~0 4294967296))) 8589934592) 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0) 4294967295) 4294967296) 4294967296) (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296))))), 1569#(and (or (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)))) (<= (+ 2147483651 ~x2~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (<= (+ ~x2~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296))) (+ (* 2 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))), 1575#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0) 4294967295) 4294967296) 4294967296) (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x1~0 (* 4294967296 (div (+ 2147483649 ~x2~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 4294967296))) (* 2 ~x2~0)) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0)) 4294967296) 8589934592) 4294967286 (* (div ~x1~0 4294967296) 8589934592) (* (div ~x2~0 4294967296) 4294967296))))), 1570#(and (or (<= (* 2 ~x2~0) (+ (* 2 ~x1~0) (* (div (+ (* (- 8589934592) (div (* 2 ~x1~0) 4294967296)) (* 3 ~x2~0) (- 4294967298) (* (div ~x2~0 4294967296) 4294967296)) 8589934592) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~n~0 (* 4294967296 (div (* 2 ~x1~0) 4294967296)) (* (div (+ (* 2 ~x2~0) (* (- 2) ~x1~0) 4294967295) 4294967296) 4294967296) (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0)) (or (<= (+ (* 2 ~x1~0) (* (div (+ 2147483649 ~x2~0 (* (- 4294967296) (div (* 2 ~x1~0) 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 4294967296) 4294967296)) (* 2 ~x2~0)) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* 8589934592 (div (* 2 ~x1~0) 4294967296)) (* 8589934592 (div (+ (* 2 ~x2~0) (* (- 2) ~x1~0)) 4294967296)) 4294967286 (* (div ~x2~0 4294967296) 4294967296))) (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0))), 1567#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (* 2 ~x2~0) (+ ~x1~0 (* (div (+ (* 3 ~x2~0) (- 4294967298) (* (div ~x2~0 4294967296) 4294967296) (* (- 8589934592) (div ~x1~0 4294967296))) 8589934592) 4294967296))) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0) 4294967295) 4294967296) 4294967296) (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* 2 ~x2~0) (* (div ~x2~0 2147483648) 2147483648) (* (div ~n~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x1~0 (* 4294967296 (div (+ 2147483649 ~x2~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 4294967296))) (* 2 ~x2~0)) (<= (* (div (+ ~n~0 2147483648 (* (div ~n~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 2147483648) 2147483648) ~x2~0) (<= (+ (* (div ~n~0 4294967296) 8589934592) (* 5 ~x2~0)) (+ (* 2 ~n~0) (* (div (+ (* 2 ~x2~0) (* (- 1) ~x1~0)) 4294967296) 8589934592) 4294967286 (* (div ~x1~0 4294967296) 8589934592) (* (div ~x2~0 4294967296) 4294967296))))), 1574#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div ~n~0 4294967296) 4294967296) (* 5 ~x2~0)) (+ (* (div ~x2~0 4294967296) 21474836480) 4294967291 (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* (div (+ (* (- 1) ~x1~0) (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296) 4294967296)))) (or (<= (+ (* 4294967296 (div (+ (* (- 1) ~x1~0) 4294967295 (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296)) (* (div ~x1~0 4294967296) 4294967296) ~n~0 (* 17179869184 (div ~x2~0 4294967296))) (+ (* ~x2~0 4) (* (div ~n~0 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (* ~x2~0 4) (+ (* (div (+ (- 1) (* 3 ~x2~0) (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) (- 12884901888))) 4294967296) 4294967296) ~x1~0 (* 17179869184 (div ~x2~0 4294967296)))))), 1579#(and (or (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) ~n~0 (* 17179869184 (div ~x2~0 4294967296)) (* (div (+ (* ~x1~0 (- 4)) 4294967295 (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296) 4294967296)) (+ (* ~x2~0 4) (* (div ~n~0 4294967296) 4294967296)))) (or (<= (mod ~n~0 4294967296) (mod (* 2 ~x1~0) 4294967296)) (<= (* (div (+ ~n~0 (* (div (* 2 ~x2~0) 4294967296) 4294967296) 2147483648 (* (div ~n~0 4294967296) (- 4294967296))) 2147483648) 2147483648) (* 2 ~x2~0)) (<= (mod ~n~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* ~x1~0 4) (* (div (+ 2147483649 (* 2 ~x2~0) (* (- 4294967296) (div (* ~x1~0 4) 4294967296)) (* (div (* 2 ~x2~0) 4294967296) 4294967296)) 4294967296) 4294967296)) (* ~x2~0 4))) (or (<= (+ (* (div ~n~0 4294967296) 4294967296) (* 5 ~x2~0)) (+ (* (div (* ~x1~0 4) 4294967296) 4294967296) (* (div ~x2~0 4294967296) 21474836480) 4294967291 (* (div (+ (* ~x1~0 (- 4)) (* ~x2~0 4) (* (- 17179869184) (div ~x2~0 4294967296))) 4294967296) 4294967296) ~n~0)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))) (or (<= (* ~x2~0 4) (+ (* ~x1~0 4) (* (div (+ (- 1) (* 3 ~x2~0) (* (- 4294967296) (div (* ~x1~0 4) 4294967296)) (* (div ~x2~0 4294967296) (- 12884901888))) 4294967296) 4294967296) (* 17179869184 (div ~x2~0 4294967296)))) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod (* 2 ~x1~0) 4294967296) (mod ~n~0 4294967296))) (< (mod (* ~x1~0 4) 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:36:03,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 18:36:03,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:36:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 18:36:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=988, Unknown=80, NotChecked=0, Total=1190 [2022-03-15 18:36:03,782 INFO L87 Difference]: Start difference. First operand 78 states and 195 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:36:05,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:07,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:10,895 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:13,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:15,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:18,496 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:19,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:21,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:23,332 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:24,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:26,647 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:36:29,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:30,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:32,804 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:34,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:36,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:38,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:53,040 WARN L228 SmtUtils]: Spent 10.00s on a formula simplification. DAG size of input: 88 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:36:55,968 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 [] Received shutdown request... [2022-03-15 18:37:00,279 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 18:37:00,279 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:00,372 WARN L244 SmtUtils]: Removed 15 from assertion stack [2022-03-15 18:37:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 18:37:00,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 301.8s TimeCoverageRelationStatistics Valid=131, Invalid=1048, Unknown=81, NotChecked=0, Total=1260 [2022-03-15 18:37:00,373 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:37:00,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 38.1s Time] [2022-03-15 18:37:00,375 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 18:37:00,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 18:37:00,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:37:00,576 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (78states) and FLOYD_HOARE automaton (currently 6 states, 24 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 128 for 4199ms.. [2022-03-15 18:37:00,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 18:37:00,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 18:37:00,579 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-03-15 18:37:00,580 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:37:00,580 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:37:00,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:37:00 BasicIcfg [2022-03-15 18:37:00,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:37:00,582 INFO L158 Benchmark]: Toolchain (without parser) took 876439.25ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 153.6MB in the beginning and 153.4MB in the end (delta: 257.9kB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,583 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:37:00,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.46ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 153.5MB in the beginning and 203.3MB in the end (delta: -49.9MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.02ms. Allocated memory is still 226.5MB. Free memory was 203.3MB in the beginning and 201.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,583 INFO L158 Benchmark]: Boogie Preprocessor took 18.76ms. Allocated memory is still 226.5MB. Free memory was 201.8MB in the beginning and 200.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,584 INFO L158 Benchmark]: RCFGBuilder took 310.40ms. Allocated memory is still 226.5MB. Free memory was 200.5MB in the beginning and 189.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,584 INFO L158 Benchmark]: TraceAbstraction took 875861.57ms. Allocated memory is still 226.5MB. Free memory was 188.6MB in the beginning and 153.4MB in the end (delta: 35.3MB). Peak memory consumption was 36.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:00,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.46ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 153.5MB in the beginning and 203.3MB in the end (delta: -49.9MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.02ms. Allocated memory is still 226.5MB. Free memory was 203.3MB in the beginning and 201.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.76ms. Allocated memory is still 226.5MB. Free memory was 201.8MB in the beginning and 200.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.40ms. Allocated memory is still 226.5MB. Free memory was 200.5MB in the beginning and 189.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 875861.57ms. Allocated memory is still 226.5MB. Free memory was 188.6MB in the beginning and 153.4MB in the end (delta: 35.3MB). Peak memory consumption was 36.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 82 PlacesBefore, 21 PlacesAfterwards, 81 TransitionsBefore, 16 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 75 TotalNumberOfCompositions, 298 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 298, positive: 298, positive conditional: 0, positive unconditional: 298, 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: 136, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 298, positive: 162, positive conditional: 0, positive unconditional: 162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, 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: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (78states) and FLOYD_HOARE automaton (currently 6 states, 24 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 128 for 4199ms.. - TimeoutResultAtElement [Line: 64]: 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 (78states) and FLOYD_HOARE automaton (currently 6 states, 24 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 128 for 4199ms.. - TimeoutResultAtElement [Line: 65]: 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 (78states) and FLOYD_HOARE automaton (currently 6 states, 24 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 128 for 4199ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 875.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 153.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 58.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 58.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 504 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1224 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 0 mSDtfsCounter, 1224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 153 SyntacticMatches, 21 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 425.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 136.5s SatisfiabilityAnalysisTime, 155.9s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 188 ConstructedInterpolants, 6 QuantifiedInterpolants, 7559 SizeOfPredicates, 16 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 7/50 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