/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:04:22,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:04:22,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:04:22,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:04:22,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:04:22,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:04:22,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:04:22,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:04:22,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:04:22,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:04:22,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:04:22,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:04:22,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:04:22,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:04:22,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:04:22,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:04:22,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:04:22,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:04:22,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:04:22,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:04:22,675 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:04:22,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:04:22,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:04:22,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:04:22,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:04:22,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:04:22,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:04:22,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:04:22,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:04:22,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:04:22,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:04:22,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:04:22,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:04:22,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:04:22,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:04:22,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:04:22,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:04:22,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:04:22,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:04:22,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:04:22,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:04:22,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:04:22,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:04:22,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:04:22,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:04:22,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:04:22,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:04:22,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:04:22,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:04:22,717 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:04:22,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:04:22,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:04:22,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:04:22,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:04:22,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:04:22,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:04:22,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:04:22,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:04:22,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:04:22,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:04:22,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:04:22,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:04:22,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:04:22,720 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:04:22,720 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 05:04:22,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:04:22,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:04:22,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:04:22,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:04:22,875 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:04:22,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-05 05:04:22,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fe1250f/ff4e5e65d7eb4e9dbacf42a5e32bbbf6/FLAG4ff4ac699 [2022-04-05 05:04:23,276 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:04:23,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-05 05:04:23,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fe1250f/ff4e5e65d7eb4e9dbacf42a5e32bbbf6/FLAG4ff4ac699 [2022-04-05 05:04:23,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fe1250f/ff4e5e65d7eb4e9dbacf42a5e32bbbf6 [2022-04-05 05:04:23,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:04:23,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:04:23,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:04:23,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:04:23,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:04:23,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d121855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23, skipping insertion in model container [2022-04-05 05:04:23,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:04:23,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:04:23,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-04-05 05:04:23,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:04:23,464 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:04:23,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-04-05 05:04:23,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:04:23,479 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:04:23,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23 WrapperNode [2022-04-05 05:04:23,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:04:23,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:04:23,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:04:23,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:04:23,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:04:23,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:04:23,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:04:23,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:04:23,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:04:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:04:23,534 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-04-05 05:04:23,536 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-04-05 05:04:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:04:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:04:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:04:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 05:04:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-05 05:04:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:04:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:04:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:04:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:04:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:04:23,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:04:23,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:04:23,671 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:04:23,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:04:23,675 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 05:04:23,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:04:23 BoogieIcfgContainer [2022-04-05 05:04:23,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:04:23,676 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:04:23,676 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:04:23,677 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:04:23,679 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:04:23" (1/1) ... [2022-04-05 05:04:23,680 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:04:23,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:04:23 BasicIcfg [2022-04-05 05:04:23,687 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:04:23,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:04:23,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:04:23,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:04:23,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:04:23" (1/4) ... [2022-04-05 05:04:23,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ac7f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:04:23, skipping insertion in model container [2022-04-05 05:04:23,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:04:23" (2/4) ... [2022-04-05 05:04:23,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ac7f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:04:23, skipping insertion in model container [2022-04-05 05:04:23,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:04:23" (3/4) ... [2022-04-05 05:04:23,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ac7f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:04:23, skipping insertion in model container [2022-04-05 05:04:23,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:04:23" (4/4) ... [2022-04-05 05:04:23,694 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.cqvasr [2022-04-05 05:04:23,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:04:23,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 05:04:23,727 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:04:23,731 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 05:04:23,731 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 05:04:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 05:04:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:04:23,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:23,749 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:23,749 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1565505021, now seen corresponding path program 1 times [2022-04-05 05:04:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:23,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365248099] [2022-04-05 05:04:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:04:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:23,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365248099] [2022-04-05 05:04:23,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365248099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:04:23,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:04:23,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 05:04:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151970815] [2022-04-05 05:04:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:04:23,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 05:04:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 05:04:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 05:04:23,967 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:04:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:04:24,011 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-05 05:04:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 05:04:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-05 05:04:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:04:24,020 INFO L225 Difference]: With dead ends: 34 [2022-04-05 05:04:24,020 INFO L226 Difference]: Without dead ends: 17 [2022-04-05 05:04:24,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-05 05:04:24,025 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:04:24,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:04:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-05 05:04:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-05 05:04:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:04:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-05 05:04:24,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-05 05:04:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:04:24,052 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-05 05:04:24,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:04:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-05 05:04:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:04:24,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:24,053 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:24,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:04:24,053 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1564581500, now seen corresponding path program 1 times [2022-04-05 05:04:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:24,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458024697] [2022-04-05 05:04:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:04:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:24,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458024697] [2022-04-05 05:04:24,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458024697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:04:24,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:04:24,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 05:04:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444054261] [2022-04-05 05:04:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:04:24,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 05:04:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 05:04:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 05:04:24,133 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:04:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:04:24,171 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-05 05:04:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 05:04:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-05 05:04:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:04:24,173 INFO L225 Difference]: With dead ends: 25 [2022-04-05 05:04:24,173 INFO L226 Difference]: Without dead ends: 20 [2022-04-05 05:04:24,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:04:24,174 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:04:24,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:04:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-05 05:04:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-05 05:04:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:04:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-05 05:04:24,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-05 05:04:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:04:24,180 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-05 05:04:24,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:04:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-05 05:04:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:04:24,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:24,181 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:24,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:04:24,181 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1890585047, now seen corresponding path program 1 times [2022-04-05 05:04:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:24,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50215418] [2022-04-05 05:04:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 05:04:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:04:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50215418] [2022-04-05 05:04:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50215418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:04:24,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534824820] [2022-04-05 05:04:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:24,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:24,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:04:24,298 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-04-05 05:04:24,335 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-04-05 05:04:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 05:04:24,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:04:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:04:24,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:04:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:04:24,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534824820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:04:24,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:04:24,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-05 05:04:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165946857] [2022-04-05 05:04:24,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:04:24,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 05:04:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 05:04:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:04:24,632 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 05:04:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:04:24,782 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-05 05:04:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:04:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-05 05:04:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:04:24,784 INFO L225 Difference]: With dead ends: 29 [2022-04-05 05:04:24,784 INFO L226 Difference]: Without dead ends: 24 [2022-04-05 05:04:24,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-05 05:04:24,787 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:04:24,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:04:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-05 05:04:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-05 05:04:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 05:04:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-05 05:04:24,797 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-05 05:04:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:04:24,798 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-05 05:04:24,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 05:04:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-05 05:04:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-05 05:04:24,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:24,801 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:24,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 05:04:25,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:25,017 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1393393715, now seen corresponding path program 2 times [2022-04-05 05:04:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:25,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762418481] [2022-04-05 05:04:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:25,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 05:04:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:04:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 05:04:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 05:04:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:25,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762418481] [2022-04-05 05:04:25,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762418481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:04:25,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244760241] [2022-04-05 05:04:25,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:04:25,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:25,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:04:25,213 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-04-05 05:04:25,214 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-04-05 05:04:25,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:04:25,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:04:25,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-05 05:04:25,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:04:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 05:04:25,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:04:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-05 05:04:25,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244760241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:04:25,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:04:25,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2022-04-05 05:04:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445047885] [2022-04-05 05:04:25,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:04:25,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-05 05:04:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-05 05:04:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-05 05:04:25,659 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-05 05:04:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:04:26,124 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-05 05:04:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 05:04:26,125 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2022-04-05 05:04:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:04:26,126 INFO L225 Difference]: With dead ends: 41 [2022-04-05 05:04:26,126 INFO L226 Difference]: Without dead ends: 36 [2022-04-05 05:04:26,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2022-04-05 05:04:26,127 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:04:26,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:04:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-05 05:04:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-05 05:04:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-05 05:04:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-05 05:04:26,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 29 [2022-04-05 05:04:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:04:26,132 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-05 05:04:26,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-05 05:04:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-05 05:04:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-05 05:04:26,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:26,134 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:26,152 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-04-05 05:04:26,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-05 05:04:26,348 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 638375751, now seen corresponding path program 3 times [2022-04-05 05:04:26,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:26,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139656312] [2022-04-05 05:04:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 05:04:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:04:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 05:04:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:04:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 05:04:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 05:04:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:04:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-05 05:04:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139656312] [2022-04-05 05:04:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139656312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:04:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299169425] [2022-04-05 05:04:26,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 05:04:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:04:26,628 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-04-05 05:04:26,629 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-04-05 05:04:26,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-05 05:04:26,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:04:26,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-05 05:04:26,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:04:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-05 05:04:26,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:04:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-05 05:04:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299169425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:04:27,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:04:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 42 [2022-04-05 05:04:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350017898] [2022-04-05 05:04:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:04:27,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-05 05:04:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-05 05:04:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-04-05 05:04:27,647 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-05 05:04:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:04:32,048 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-05 05:04:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-05 05:04:32,049 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 53 [2022-04-05 05:04:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:04:32,050 INFO L225 Difference]: With dead ends: 65 [2022-04-05 05:04:32,050 INFO L226 Difference]: Without dead ends: 60 [2022-04-05 05:04:32,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=845, Invalid=4267, Unknown=0, NotChecked=0, Total=5112 [2022-04-05 05:04:32,052 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 05:04:32,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 143 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 05:04:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-05 05:04:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-05 05:04:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 05:04:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-05 05:04:32,069 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 53 [2022-04-05 05:04:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:04:32,070 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-05 05:04:32,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-05 05:04:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-05 05:04:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 05:04:32,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:04:32,074 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:04:32,092 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-04-05 05:04:32,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:32,277 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:04:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:04:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1561497967, now seen corresponding path program 4 times [2022-04-05 05:04:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:04:32,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302994700] [2022-04-05 05:04:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:04:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:04:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:04:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 05:04:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:04:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 05:04:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:04:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 05:04:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 05:04:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:04:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 05:04:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 05:04:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-05 05:04:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-05 05:04:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-05 05:04:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-05 05:04:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 05:04:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-05 05:04:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:04:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-05 05:04:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:04:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302994700] [2022-04-05 05:04:32,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302994700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:04:32,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29499745] [2022-04-05 05:04:32,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 05:04:32,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:04:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:04:32,952 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-04-05 05:04:32,974 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-04-05 05:04:33,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 05:04:33,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:04:33,026 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 153 conjunts are in the unsatisfiable core [2022-04-05 05:04:33,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:04:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-05 05:04:33,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:04:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-05 05:04:36,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29499745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:04:36,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:04:36,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 48] total 82 [2022-04-05 05:04:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069123210] [2022-04-05 05:04:36,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:04:36,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-05 05:04:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:04:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-05 05:04:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5953, Unknown=0, NotChecked=0, Total=6642 [2022-04-05 05:04:36,100 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-05 05:05:07,931 WARN L232 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 110 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:07:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:07:06,664 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-04-05 05:07:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-05 05:07:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 101 [2022-04-05 05:07:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:07:06,666 INFO L225 Difference]: With dead ends: 113 [2022-04-05 05:07:06,666 INFO L226 Difference]: Without dead ends: 108 [2022-04-05 05:07:06,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 150.7s TimeCoverageRelationStatistics Valid=3098, Invalid=17491, Unknown=3, NotChecked=0, Total=20592 [2022-04-05 05:07:06,672 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 3829 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:07:06,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 261 Invalid, 4217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3829 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 05:07:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-05 05:07:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-05 05:07:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-05 05:07:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2022-04-05 05:07:06,699 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 101 [2022-04-05 05:07:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:07:06,699 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2022-04-05 05:07:06,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-05 05:07:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-04-05 05:07:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-05 05:07:06,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:07:06,702 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:07:06,720 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-04-05 05:07:06,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:07:06,921 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:07:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:07:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1223308735, now seen corresponding path program 5 times [2022-04-05 05:07:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:07:06,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979745696] [2022-04-05 05:07:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:07:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:07:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:07:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 05:07:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:07:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 05:07:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:07:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 05:07:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 05:07:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:07:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 05:07:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 05:07:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-05 05:07:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-05 05:07:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-05 05:07:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-05 05:07:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 05:07:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-05 05:07:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-04-05 05:07:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-05 05:07:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-05 05:07:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-04-05 05:07:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-04-05 05:07:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-04-05 05:07:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-04-05 05:07:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-05 05:07:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-04-05 05:07:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-04-05 05:07:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-05 05:07:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-04-05 05:07:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-04-05 05:07:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-04-05 05:07:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-04-05 05:07:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-04-05 05:07:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:07:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-05 05:07:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:07:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979745696] [2022-04-05 05:07:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979745696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:07:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814535792] [2022-04-05 05:07:08,876 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 05:07:08,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:07:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:07:08,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:07:08,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 05:07:24,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-05 05:07:24,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:07:24,585 WARN L261 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 313 conjunts are in the unsatisfiable core [2022-04-05 05:07:24,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:07:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-05 05:07:26,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:07:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-05 05:07:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814535792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:07:35,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:07:35,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 96] total 162 [2022-04-05 05:07:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937261969] [2022-04-05 05:07:35,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:07:35,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-04-05 05:07:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:07:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-04-05 05:07:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2401, Invalid=23681, Unknown=0, NotChecked=0, Total=26082 [2022-04-05 05:07:35,251 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-05 05:08:46,827 WARN L232 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 136 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:08:48,871 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 05:08:50,904 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 05:10:17,792 WARN L232 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:11:37,020 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 05:12:58,783 WARN L232 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 118 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:13:00,799 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 05:15:29,662 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 05:17:31,728 WARN L232 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 116 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:17:33,826 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false